A Fast Weighted SVT Algorithm

Singular value thresholding (SVT) plays an important role in the well-known robust principal component analysis (RPCA) algorithms which have many applications in machine learning, pattern recognition, and computer vision. There are many versions of generalized SVT proposed by researchers to achieve improvement in speed or performance. In this paper, we propose a fast algorithm to solve aweighted singular value thresholding (WSVT) problem as formulated in [1], which uses a combination of the nuclear norm and a weighted Frobenius norm and has shown to be comparable with RPCA method in some real world applications.

[1]  Xin Li,et al.  Weighted Low-Rank Approximation of Matrices and Background Modeling , 2018, ArXiv.

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

[3]  Rick Chartrand,et al.  Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition , 2012, IEEE Transactions on Signal Processing.

[4]  Qiang Wang,et al.  Weighted singular value thresholding for sparse photoacoustic microscopy , 2017, 2017 IEEE International Instrumentation and Measurement Technology Conference (I2MTC).

[5]  Xin Li,et al.  On a Problem of Weighted Low-Rank Approximation of Matrices , 2015, SIAM J. Matrix Anal. Appl..

[6]  Shuicheng Yan,et al.  Generalized Singular Value Thresholding , 2014, AAAI.

[7]  Aritra Dutta,et al.  A Batch-Incremental Video Background Estimation Model Using Weighted Low-Rank Approximation of Matrices , 2017, 2017 IEEE International Conference on Computer Vision Workshops (ICCVW).

[8]  Aritra Dutta,et al.  Weighted Low Rank Approximation for Background Estimation Problems , 2017, 2017 IEEE International Conference on Computer Vision Workshops (ICCVW).

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

[10]  Lei Zhang,et al.  Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision , 2016, International Journal of Computer Vision.

[11]  Xiaoming Yuan,et al.  Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations , 2011, SIAM J. Optim..

[12]  Shuicheng Yan,et al.  Generalized Nonconvex Nonsmooth Low-Rank Minimization , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[13]  M. Shah,et al.  Weighted Singular Value Thresholding and its Application to Background Estimation , 2017, 1707.00133.

[14]  Aritra Dutta.  Weighted Low-Rank Approximation of Matrices:Some Analytical and Numerical Aspects , 2016 .

[15]  Tommi S. Jaakkola,et al.  Weighted Low-Rank Approximations , 2003, ICML.

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

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

[18]  Maryam Fazel,et al.  Iterative reweighted algorithms for matrix rank minimization , 2012, J. Mach. Learn. Res..

[19]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[20]  Aritra Dutta,et al.  A Nonconvex Projection Method for Robust PCA , 2018, AAAI.

[21]  Robert E. Mahony,et al.  The geometry of weighted low-rank approximations , 2003, IEEE Trans. Signal Process..

[22]  Shuicheng Yan,et al.  Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm , 2015, IEEE Transactions on Image Processing.

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

[24]  I. Jolliffe.  Principal Component Analysis , 2002 .

[25]  Paul S. Wang,et al.  Weighted Low-Rank Approximation of General Complex Matrices and Its Application in the Design of 2-D Digital Filters , 1997 .