Comparisons of several algorithms for Toeplitz matrix recovery

In this paper, we study algorithms for Toeplitz matrix recovery. Inspired by the singular value thresholding (SVT) algorithm for matrix completion and the alternating directions iterative method, we first propose a new mean value algorithm for Toeplitz matrix recovery. Then we apply our idea to the augmented Lagrange multiplier (ALM) algorithm for matrix recovery and put forward four modified ALM algorithms for Toeplitz matrix recovery. Convergence analysis of the new algorithms is discussed. All the iterative matrices generated by the five algorithms keep a Toeplitz structure that ensures the fast singular value decomposition (SVD) of Toeplitz matrices. Compared with the original algorithms, our algorithms are far superior in the time of SVD, as well as the CPU time.

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

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

[3]  F. Sebert,et al.  Toeplitz block matrices in compressed sensing and their applications in imaging , 2008, 2008 International Conference on Information Technology and Applications in Biomedicine.

[4]  Stephen J. Wright,et al.  Toeplitz-Structured Compressed Sensing Matrices , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

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

[6]  Ramdas Kumaresan,et al.  Toeplitz and Hankel matrix approximation using structured approach , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[7]  A. Böttcher,et al.  Functions of banded Hermitian block Toeplitz matrices in signal processing , 2007 .

[8]  Gene H. Golub,et al.  Matrix computations , 1983 .

[9]  Jie Huang,et al.  Image restoration with shifting reflective boundary conditions , 2011, Science China Information Sciences.

[10]  Yi Ma,et al.  Face recovery in conference video streaming using robust principal component analysis , 2011, 2011 18th IEEE International Conference on Image Processing.

[11]  Yi Ma,et al.  Unwrapping low-rank textures on generalized cylindrical surfaces , 2011, 2011 International Conference on Computer Vision.

[12]  John Wright,et al.  RASL: Robust Alignment by Sparse and Low-Rank Decomposition for Linearly Correlated Images , 2012, IEEE Trans. Pattern Anal. Mach. Intell..

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

[14]  C. Loan.  Computational Frameworks for the Fast Fourier Transform , 1992 .

[15]  Thomas Kailath,et al.  Fast reliable algorithms for matrices with structure , 1999 .

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

[17]  Franklin T. Luk,et al.  Fast singular value algorithm for Hankel matrices , 2001, SPIE Optics + Photonics.

[18]  Arvind Ganesh,et al.  Fast algorithms for recovering a corrupted low-rank matrix , 2009, 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).

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

[20]  S. Qiao,et al.  A fast symmetric SVD algorithm for square Hankel matrices , 2008 .

[21]  Tao Yu,et al.  Impacts of short-channel effects on the random threshold voltage variation in nanoscale transistors , 2013, Science China Information Sciences.

[22]  Chao Li,et al.  A mean value algorithm for Toeplitz matrix completion , 2015, Appl. Math. Lett..