Sparse bayesian methods for low-rank matrix estimation

S. Derin Babacan*, Martin Luessi, Rafael Molina, Aggelos K. Katsaggelos

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

213 Scopus citations


Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applications. In this paper, we present novel recovery algorithms for estimating low-rank matrices in matrix completion and robust principal component analysis based on sparse Bayesian learning (SBL) principles. Starting from a matrix factorization formulation and enforcing the low-rank constraint in the estimates as a sparsity constraint, we develop an approach that is very effective in determining the correct rank while providing high recovery performance. We provide connections with existing methods in other similar problems and empirical results and comparisons with current state-of-the-art methods that illustrate the effectiveness of this approach.

Original languageEnglish (US)
Article number6194350
Pages (from-to)3964-3977
Number of pages14
JournalIEEE Transactions on Signal Processing
Issue number8
StatePublished - 2012


  • Bayesian methods
  • low-rankness
  • matrix completion
  • outlier detection
  • robust principal component analysis
  • sparse Bayesian learning
  • sparsity
  • variational Bayesian inference

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Sparse bayesian methods for low-rank matrix estimation'. Together they form a unique fingerprint.

Cite this