Learning adapted dictionaries for geometry and texture separation

This article proposes a new method for image separation into a linear combination of morphological components. This method is applied to decompose an image into meaningful cartoon and textural layers and is used to solve more general inverse problems such as image inpainting. For each of these components, a dictionary is learned from a set of exemplar images. Each layer is characterized by a sparse expansion in the corresponding dictionary. The separation inverse problem is formalized within a variational framework as the optimization of an energy functional. The morphological component analysis algorithm allows to solve iteratively this optimization problem under sparsity-promoting penalties. Using adapted dictionaries learned from data allows to circumvent some difficulties faced by fixed dictionaries. Numerical results demonstrate that this adaptivity is indeed crucial to capture complex texture patterns.

[1]  D. Donoho,et al.  Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA) , 2005 .

[2]  Antonin Chambolle,et al.  Image Decomposition into a Bounded Variation Component and an Oscillating Component , 2005, Journal of Mathematical Imaging and Vision.

[3]  Michael Elad,et al.  Submitted to Ieee Transactions on Image Processing Image Decomposition via the Combination of Sparse Representations and a Variational Approach , 2022 .

[4]  Ronald R. Coifman,et al.  Brushlets: A Tool for Directional Image Analysis and Image Compression , 1997 .

[5]  Naonori Ueda,et al.  Deterministic annealing EM algorithm , 1998, Neural Networks.

[6]  Jean-Michel Morel,et al.  An axiomatic approach to image interpolation , 1997, Proceedings of International Conference on Image Processing.

[7]  Guillermo Sapiro,et al.  Filling-in by joint interpolation of vector fields and gray levels , 2001, IEEE Trans. Image Process..

[8]  Thomas Brox,et al.  On the Equivalence of Soft Wavelet Shrinkage, Total Variation Diffusion, Total Variation Regularization, and SIDEs , 2004, SIAM J. Numer. Anal..

[9]  S. Mallat,et al.  Orthogonal bandelet bases for geometric images approximation , 2008 .

[10]  R. Tibshirani,et al.  Least angle regression , 2004, math/0406456.

[11]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[12]  S. Mallat A wavelet tour of signal processing , 1998 .

[13]  David L. Donoho,et al.  Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit , 2006 .

[14]  Patrick L. Combettes,et al.  Signal Recovery by Proximal Forward-Backward Splitting , 2005, Multiscale Model. Simul..

[15]  Michael Elad,et al.  Sparse Representation for Color Image Restoration , 2008, IEEE Transactions on Image Processing.

[16]  Guillermo Sapiro,et al.  Image inpainting , 2000, SIGGRAPH.

[17]  Simon Masnou,et al.  Disocclusion: a variational approach using level lines , 2002, IEEE Trans. Image Process..

[18]  D. Donoho Wedgelets: nearly minimax estimation of edges , 1999 .

[19]  Yves Meyer,et al.  Oscillating Patterns in Image Processing and Nonlinear Evolution Equations: The Fifteenth Dean Jacqueline B. Lewis Memorial Lectures , 2001 .

[20]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[21]  Michael Elad,et al.  Sparse Representation for Color Image Restoration (PREPRINT) , 2006 .

[22]  Rachid Deriche,et al.  Vector-valued image regularization with PDEs: a common framework for different applications , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Feng Liu,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries in Wavelet Domain , 2009, 2009 Fifth International Conference on Image and Graphics.

[24]  D. Donoho,et al.  Redundant Multiscale Transforms and Their Application for Morphological Component Separation , 2004 .

[25]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[26]  M. R. Osborne,et al.  A new approach to variable selection in least squares problems , 2000 .

[27]  E. Candès,et al.  New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities , 2004 .

[28]  L. Demanet,et al.  Wave atoms and sparsity of oscillatory patterns , 2007 .

[29]  Terrence J. Sejnowski,et al.  Learning Overcomplete Representations , 2000, Neural Computation.

[30]  David J. Field,et al.  Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.

[31]  Mohamed-Jalal Fadili,et al.  EM algorithm for sparse representation-based image inpainting , 2005, IEEE International Conference on Image Processing 2005.

[32]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[33]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[34]  Joseph F. Murray,et al.  Dictionary Learning Algorithms for Sparse Representation , 2003, Neural Computation.

[35]  P. Tseng Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .

[36]  Stéphane Mallat,et al.  Bandelet Image Approximation and Compression , 2005, Multiscale Model. Simul..

[37]  Mohamed-Jalal Fadili,et al.  Inpainting and Zooming Using Sparse Representations , 2009, Comput. J..