Image Separation Based on Augmented Lagrange Multiplier Using Rank Prior

Natural or synthetic image can be decomposed into pattern images with regular or near regular objects. Effective separation makes possible to track object or recognize and recover hidden area from occlusion, or estimate the background from video. To separate high dimensional data with low rank matrix and sparse matrix, Robust Principal Component Analysis, RPCA is commonly used since it is stronger for gross error or outliers than PCA. There are many algorithms for convex optimization problem formulated by RPCA. Among them the Augmented Lagrange Multiplier Method are very fast and converge to exact optimal solution. This paper focuses on the regularization parameter dependent on input signal complexity, such as rank, instead of previous work has fixed value dependent on the size of row. The rank of input image helps to predict the weight of low rank matrix and sparse matrix. A number of experimental results prove that our regularization parameter is robust on various situations.

[1]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[2]  Pablo A. Parrilo,et al.  Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..

[3]  Volkan Cevher,et al.  Convexity in Source Separation : Models, geometry, and algorithms , 2013, IEEE Signal Processing Magazine.

[4]  Rina Foygel,et al.  Corrupted Sensing: Novel Guarantees for Separating Structured Signals , 2013, IEEE Transactions on Information Theory.

[5]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[6]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[7]  G. Sapiro,et al.  A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.

[8]  Zhixun Su,et al.  Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation , 2011, NIPS.

[9]  Justin K. Romberg,et al.  Blind Deconvolution Using Convex Programming , 2012, IEEE Transactions on Information Theory.

[10]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[11]  S. Yun,et al.  An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems , 2009 .

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

[13]  M. Fukushima,et al.  A generalized proximal point algorithm for certain non-convex minimization problems , 1981 .

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