Sparse Bayesian Methods for Low-Rank Matrix Estimation

DOI10.1109/TSP.2012.2197748zbMath1393.94670arXiv1102.5288OpenAlexW2963762195MaRDI QIDQ4573905

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

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5288

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Estimation in multivariate analysis (62H12) Bayesian inference (62F15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20) Matrix completion problems (15A83)

Related Items (14)

A novel robust principal component analysis method for image and video processing. ⋮ Disordered systems insights on computational hardness ⋮ Bayesian robust principal component analysis with structured sparse component ⋮ Variational Bayesian sparse additive matrix factorization ⋮ Bayesian singular value regularization via a cumulative shrinkage process ⋮ Bayesian rank penalization ⋮ Gradient-Based Markov Chain Monte Carlo for Bayesian Inference With Non-differentiable Priors ⋮ Bayesian robust principal component analysis with adaptive singular value penalty ⋮ Weighted nuclear norm minimization and its applications to low level vision ⋮ Approximate Bayesian Algorithm for Tensor Robust Principal Component Analysis ⋮ Variational Bayesian inference for CP tensor completion with subspace information ⋮ Adaptive variational Bayes: optimality, computation and applications ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification

This page was built for publication: Sparse Bayesian Methods for Low-Rank Matrix Estimation