Sparse Bayesian Learning for Robust PCA: Algorithms and Analyses
- 7 October 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (22) , 5837-5849
Abstract
In this paper, we propose a new Bayesian model to solve the Robust PCA problem - recovering the underlying low-rank matrix and sparse matrix from their noisy compositions. We first derive and analyze a new objective function, which is proven to be equivalent to the fundamental objective of minimizing the “rank+sparsity”. To solve this objective, we develop a concise Sparse Bayesian Learning (SBL) method that makes minimal assumptions and effectively deals with the requirements of the problem. The concise modeling allows simple and effective Empirical Bayesian inference via maximum a posteriori – expectation-maximization (MAP-EM). We further propose a modified SBL method that additionally utilizes the sparsity pattern information of the outliers in the Robust PCA problem. Simulation studies demonstrate the superiority of the proposed methods over the existing state-of-the-art methods. The efficacy of the proposed methods is further verified through two image processing tasks.Keywords
Funding Information
- Ericsson Endowed Chair Funds
This publication has 32 references indexed in Scilit:
- Bayesian learning for robust principal component analysis2015
- An alternating direction method with increasing penalty for stable principal component pursuitComputational Optimization and Applications, 2015
- Compressive Sensing via Nonlocal Low-Rank RegularizationIEEE Transactions on Image Processing, 2014
- Robust principal component analysis via capped norms2013
- Robust principal component analysis?Journal of the ACM, 2011
- Rank-Sparsity Incoherence for Matrix DecompositionSIAM Journal on Optimization, 2011
- Dense Error Correction Via $\ell^1$-MinimizationIEEE Transactions on Information Theory, 2010
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- Sparse Bayesian Learning for Basis SelectionIEEE Transactions on Signal Processing, 2004
- Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices2004