Abstract
We consider the robust principal component analysis (RPCA) problem where the observed data are decomposed to a low-rank component and a sparse component. Conventionally, the matrix rank in RPCA is often approximated using a nuclear norm. Recently, RPCA has been formulated using the nonconvex \(\ell _{\gamma }\)-norm, which provides a closer approximation to the matrix rank than the traditional nuclear norm. However, the low-rank component generally has sparse property, especially in the transform domain. In this paper, a sparsity-based regularization term modeled with \(\ell _1\)-norm is introduced to the formulation. An iterative optimization algorithm is developed to solve the obtained optimization problem. Experiments using synthetic and real data are utilized to validate the performance of the proposed method.
Similar content being viewed by others
Notes
The codes of noncvxRPCA were downloaded from the Web site https://github.com/sckangz/noncvx-PRCA. As the codes of the LRSD-TNN algorithm are not available, we implemented this algorithm by ourselves. The codes of IALM were downloaded from http://perception.csl.illinois.edu/matrix-rank/sample_code.html.
References
A. Beck, M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009)
S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1–122 (2011)
S. Boyd, L. Vandenberghe, Convex Optimization (Cambridge Univeristy Press, Cambridge, 2004)
E.J. Candès, X. Li, Y. Ma, J. Wright, Robust principal component analysis? J. ACM (JACM) 58(3), 11 (2011)
E.J. Candès, B. Recht, Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717 (2009)
E.J. Candes, T. Tao, The Power of Convex Relaxation: Near-Optimal Matrix Completion (IEEE Press, Piscataway, 2010)
F. Cao, J. Chen, H. Ye, J. Zhao, Z. Zhou, Recovering low-rank and sparse matrix based on the truncated nuclear norm. Neural Netw. 85, 10–20 (2017)
W. Cao, Y. Wang, J. Sun, D. Meng, C. Yang, A. Cichocki, Z. Xu, Total variation regularized tensor RPCA for background subtraction from compressive measurements. IEEE Trans. Image Process. 25(9), 4075–4090 (2016)
J. Dong, Z. Xue, J. Guan, Z.F. Han, W. Wang, Low rank matrix completion using truncated nuclear norm and sparse regularizer. Sig. Process. Image Commun. 68, 76–87 (2018)
D. Goldfarb, S. Ma, K. Scheinberg, Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. 141(1–2), 349–382 (2013)
Y. Hu, D. Zhang, J. Ye, X. Li, X. He, Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117–2130 (2013)
P.S. Huang, S.D. Chen, P. Smaragdis, Hasegawa-Johnson, M.: Singing-voice separation from monaural recordings using robust principal component analysis, in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (IEEE, 2012), pp. 57–60
Y. Jianchao, W. John, H. Thomas, M. Yi, Image super-resolution via sparse representation. IEEE Trans. Image Process. 19(11), 2861–2873 (2010)
W. John, A.Y. Yang, G. Arvind, S.S. Shankar, M. Yi, Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 210–227 (2009)
I. Jolliffe, Principal Component Analysis (Springer, Berlin, 2011)
Z. Kang, C. Peng, Q. Cheng, Robust PCA via nonconvex rank approximation, in IEEE International Conference on Data Mining (ICDM) (IEEE, 2015), pp. 211–220
V.A. Kumar, C.V.R. Rao, A. Dutta, Performance analysis of blind source separation using canonical correlation. Circuits Syst. Sig. Process. 37(2), 658–673 (2018)
K.C. Lee, J. Ho, D.J. Kriegman, Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 684–698 (2005)
L. Li, W. Huang, I.Y.H. Gu, Q. Tian, Statistical modeling of complex backgrounds for foreground object detection. IEEE Trans. Image Process. 13(11), 1459–1472 (2004)
Z. Lin, M. Chen, Y. Ma, The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055 (2010)
G. Liu, Z. Lin, Y. Yu, Robust subspace segmentation by low-rank representation, in Proceedings of the 27th International Conference on Machine Learning (ICML-10) (2010), pp. 663–670
N. Merhav, R. Kresch, Approximate convolution using DCT coefficient multipliers. IEEE Trans. Circuits Syst. Video Technol. 8(4), 378–385 (1998)
R. Otazo, E. Candès, D.K. Sodickson, Low-rank plus sparse matrix decomposition for accelerated dynamic mri with separation of background and dynamic components. Magn. Reson. Med. 73(3), 1125–1136 (2015)
Y. Peng, A. Ganesh, J. Wright, W. Xu, Y. Ma, RASL: robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34(11), 2233–2246 (2012)
Y. Shen, Z. Wen, Y. Zhang, Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization. Optim. Methods Softw. 29(2), 239–263 (2014)
K.-C. Toh, S. Yun, An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac. J. Optim. 6(3), 615–640 (2010)
E. Vincent, R. Gribonval, C. Févotte, Performance measurement in blind audio source separation. IEEE Trans. Audio Speech Lang. Process. 14(4), 1462–1469 (2006)
R. Werner, M. Wilmsy, B. Cheng, N.D. Forkert, Beyond cost function masking: RPCA-based non-linear registration in the context of VLSM, in International Workshop on Pattern Recognition in Neuroimaging (PRNI) (IEEE, 2016), pp. 1–4
J. Wright, A. Ganesh, S. Rao, Y. Peng, Y. Ma, Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization, in Advances in Neural Information Processing Systems (2009), pp. 2080–2088
J. Wright, Y. Ma, J. Mairal, G. Sapiro, T.S. Huang, S. Yan, Sparse representation for computer vision and pattern recognition. Proc. IEEE 98(6), 1031–1044 (2010)
Z. Xue, J. Dong, Y. Zhao, C. Liu, R. Chellali, Low-rank and sparse matrix decomposition via the truncated nuclear norm and a sparse regularizer. Vis. Comput. 35(11), 1549–1566 (2018)
X. Yuan, J. Yang, Sparse and low rank matrix decomposition via alternating direction method. Pac. J. Optim. 9(1), 1–11 (2009)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (61906087), the Natural Science Foundation of Jiangsu Province of China (BK20180692), and the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province of China (17KJB510025). The authors thank the associate editor and the anonymous reviewers for their contributions to improving the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Dong, J., Xue, Z. & Wang, W. Robust PCA Using Nonconvex Rank Approximation and Sparse Regularizer. Circuits Syst Signal Process 39, 3086–3104 (2020). https://doi.org/10.1007/s00034-019-01310-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00034-019-01310-y