Rank Minimization-Based Fast Image Completion

We propose an image completion algorithm using a rank minimization framework. Based on the lowrank property of an image, we formulate image completion as a low-rank matrix completion problem. Then, we solve the optimization problem efficiently using the augmented Lagrange multiplier (ALM) method. Experiments show that the proposed algorithm provides comparable or even higher image qualities than state-of-the-art approaches, while demanding significantly lower computational resources.

[1]  Patrick Pérez,et al.  Region filling and object removal by exemplar-based image inpainting , 2004, IEEE Transactions on Image Processing.

[2]  Lei Zhang,et al.  Weighted Nuclear Norm Minimization with Application to Image Denoising , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Xuelong Li,et al.  Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Yin Zhang,et al.  Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm , 2012, Mathematical Programming Computation.

[5]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[6]  Edmund Y. Lam,et al.  Computationally Efficient Truncated Nuclear Norm Minimization for High Dynamic Range Imaging , 2016, IEEE Transactions on Image Processing.

[7]  Narendra Ahuja,et al.  Image completion using planar structure guidance , 2014, ACM Trans. Graph..

[8]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[9]  Yi Ma,et al.  The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.

[10]  Emmanuel J. Candès,et al.  Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[11]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, ISIT.