Robust PCA via Alternating Iteratively Reweighted Low-Rank Matrix Factorization

Nowadays, many modern imaging applications generate large-scale and high-dimensional data. In order to efficiently handle these data, statistical tools amenable to exploiting their intrisic low-dimensional nature are needed. PCA is a ubiquitous method which has been widely applied in a variety of applications. However a major shortcoming of PCA is its sensitivity to gross errors - outliers. In light of this, robust PCA has been recently proposed. Robust PCA accounts for gross errors by assuming that the data matrix is the superposition of a low-rank matrix and a sparse matrix. In this work, a matrix factorization-based formulation of robust PCA which can efficiently handle large scale data is proposed. Low-rankness is imposed via a novel low-rank promoting term applied on the matrix factors, which can be viewed as a weighted version of the variational form of the nuclear norm. The newly formulated robust PCA problem is addressed via an alternating iteratively reweighted least squares-type algorithm. Simulated and real data experiments verify the effectiveness of the proposed algorithm as compared to other state-of-the-art robust PCA algorithms.

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

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

[3]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[4]  Paris V. Giampouras,et al.  Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization , 2017, ArXiv.

[5]  Zhi-Quan Luo,et al.  A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing , 2015, IEEE Signal Processing Magazine.

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

[7]  Michael J. Black,et al.  A Framework for Robust Subspace Learning , 2003, International Journal of Computer Vision.

[8]  Zhi-Quan Luo,et al.  Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Lei Zhang,et al.  Weighted Nuclear Norm Minimization with Application to Image Denoising , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Feiping Nie,et al.  Low-Rank Matrix Recovery via Efficient Schatten p-Norm Minimization , 2012, AAAI.

[11]  Alexandre Bernardino,et al.  Unifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition , 2013, 2013 IEEE International Conference on Computer Vision.

[12]  Prateek Jain,et al.  Low-rank matrix completion using alternating minimization , 2012, STOC '13.