Low-n-rank tensor recovery based on multi-linear augmented Lagrange multiplier method

The problem of recovering data in multi-way arrays (i.e., tensors) arises in many fields such as image processing and computer vision, etc. In this paper, we present a novel method based on multi-linear n-rank and @?"0 norm optimization for recovering a low-n-rank tensor with an unknown fraction of its elements being arbitrarily corrupted. In the new method, the n-rank and @?"0 norm of the each mode of the given tensor are combined by weighted parameters as the objective function. In order to avoid relaxing the observed tensor into penalty terms, which may cause less accuracy problem, the minimization problem along each mode is accomplished by applying the augmented Lagrange multiplier method. In experiments, we test the influence of parameters on the results of the proposed method, and then compare with one state-of-the-art method on both simulated data and real data. Numerical results show that the method can reliably solve a wide range of problems at a speed at least several times faster than the state-of-the-art method while the results of the method are comparable to the previous method in terms of accuracy.

[1]  Christof Koch,et al.  A Model of Saliency-Based Visual Attention for Rapid Scene Analysis , 2009 .

[2]  Arvind Ganesh,et al.  Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix , 2009 .

[3]  Yin Zhang,et al.  Fixed-Point Continuation for l1-Minimization: Methodology and Convergence , 2008, SIAM J. Optim..

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

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

[6]  H. Simon The Lanczos algorithm with partial reorthogonalization , 1984 .

[7]  Demetri Terzopoulos,et al.  Multilinear Analysis of Image Ensembles: TensorFaces , 2002, ECCV.

[8]  L. Tucker,et al.  Some mathematical notes on three-mode factor analysis , 1966, Psychometrika.

[9]  Yin Li,et al.  Optimum Subspace Learning and Error Correction for Tensors , 2010, ECCV.

[10]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

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

[13]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[14]  Rasmus Bro,et al.  The N-way Toolbox for MATLAB , 2000 .

[15]  Vincenzo Verardi Robust principal component analysis in Stata , 2009 .

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

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

[18]  H. H. Rachford,et al.  On the numerical solution of heat conduction problems in two and three space variables , 1956 .

[19]  J.-C. Pesquet,et al.  A Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery , 2007, IEEE Journal of Selected Topics in Signal Processing.

[20]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[21]  Adrian S. Lewis,et al.  Image compression using the 2-D wavelet transform , 1992, IEEE Trans. Image Process..

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

[23]  Richard A. Harshman,et al.  Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis , 1970 .

[24]  Yaser Sheikh,et al.  Bayesian modeling of dynamic scenes for object detection , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Stan Sclaroff,et al.  Segmenting foreground objects from a dynamic textured background via a robust Kalman filter , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

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

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

[28]  J. Chang,et al.  Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .