Inpainting color images in learned dictionary

Sparse representation of natural images over redundant dictionary enables solution of the inpainting problem. A major challenge, in this regard, is learning of a dictionary that is well adapted to the image. Efficient methods are developed for grayscale images represented in patch space by using, for example, K-SVD or independent component analysis algorithms. Here, we address the problem of patch space-based dictionary learning for color images. To this end, an image in RGB color space is represented as a collection of vectorized 3D patch tensors. This leads to the state-of-the-art results in inpainting random and structured patterns of missing values as it is demonstrated in the paper.

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

[2]  I. Kopriva,et al.  A comparison of dictionary based approaches to inpainting and denoising with an emphasis to independent component analysis learned dictionaries , 2011 .

[3]  Aapo Hyvärinen,et al.  A Fast Fixed-Point Algorithm for Independent Component Analysis , 1997, Neural Computation.

[4]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[5]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[6]  Philip S. Yu,et al.  Limitations of matrix completion via trace norm minimization , 2011, SKDD.

[7]  Xuemei Zhang,et al.  Estimation of saturated pixel values in digital color imaging. , 2004, Journal of the Optical Society of America. A, Optics, image science, and vision.

[8]  H. Kiers Towards a standardized notation and terminology in multiway analysis , 2000 .

[9]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[10]  Rabab Kreidieh Ward,et al.  Color image desaturation using sparse reconstruction , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[11]  Jieping Ye,et al.  Tensor Completion for Estimating Missing Values in Visual Data , 2013, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Christian Jutten,et al.  A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm , 2008, IEEE Transactions on Signal Processing.

[13]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

[14]  Christian Jutten,et al.  Robust-SL0 for stable sparse representation in noisy settings , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[15]  Rick Chartrand,et al.  Exact Reconstruction of Sparse Signals via Nonconvex Minimization , 2007, IEEE Signal Processing Letters.

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

[17]  Tamara G. Kolda,et al.  Scalable Tensor Factorizations for Incomplete Data , 2010, ArXiv.

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

[20]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[21]  Ryota Tomioka,et al.  Estimation of low-rank tensors via convex optimization , 2010, 1010.0789.

[22]  B. Recht,et al.  Tensor completion and low-n-rank tensor recovery via convex optimization , 2011 .