Rank adaptive atomic decomposition for low-rank matrix completion and its application on image recovery

Abstract Recently, a greedy algorithm called Atomic Decomposition for Minimum Rank Approximation (ADMiRA) was proposed. It has solved the low-rank matrix approximation problem when the rank of the matrix is known. However, the rank of the matrix is usually unknown in practical application. In this paper, a Rank Adaptive Atomic Decomposition for Low-Rank Matrix Completion (RAADLRMC) algorithm is proposed based on the Atomic Decomposition for Minimum Rank Approximation. The advantage of RAADLRMC is that it works when the parameter rank-r of matrix is not given. Furthermore, the step size of iteration is decreased adaptively in order to improve the efficiency and accuracy. As illustrated by our experiments, our algorithm is robust, and the rank of matrix can be predicted accurately.

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

[2]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

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

[4]  Li-Hui Cen,et al.  Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal Reconstruction , 2013, J. Appl. Math..

[5]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[6]  E. Candes,et al.  11-magic : Recovery of sparse signals via convex programming , 2005 .

[7]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[8]  Benjamin Recht,et al.  A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..

[9]  Shao-hai Hu,et al.  Regularized Adaptive Matching Pursuit Algorithm for Signal Reconstruction Based on Compressive Sensing: Regularized Adaptive Matching Pursuit Algorithm for Signal Reconstruction Based on Compressive Sensing , 2010 .

[10]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[11]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[12]  Xiaoming Yuan,et al.  Sparse and low-rank matrix decomposition via alternating direction method , 2013 .

[13]  赵瑞珍 Zhao Ruizhen,et al.  Variable Step Size Adaptive Matching Pursuit Algorithm for Image Reconstruction Based on Compressive Sensing , 2010 .

[14]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[15]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[16]  Li-Hui Cen,et al.  A new approach of conditions on δ2s(Φ) for s-sparse recovery , 2013, Science China Information Sciences.

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

[18]  Yoram Bresler,et al.  ADMiRA: Atomic Decomposition for Minimum Rank Approximation , 2009, IEEE Transactions on Information Theory.

[19]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[20]  Deanna Needell,et al.  Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit , 2007, IEEE Journal of Selected Topics in Signal Processing.

[21]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

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

[23]  Shiqian Ma,et al.  Fixed point and Bregman iterative methods for matrix rank minimization , 2009, Math. Program..

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