The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Sparse Bayesian Methods for Low-Rank Matrix Estimation
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Huber, P. J., & Ronchetti, E. M. (2009) · Wiley Series in Probability and Statistics · doi:10.1002/9780470434697 · Cited by 1,718
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Salakhutdinov, R., & Mnih, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390267 · Cited by 1,413
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Rank-Sparsity Incoherence for Matrix Decomposition
Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., & Willsky, A. S. (2011) · SIAM Journal on Optimization · doi:10.1137/090761793 · Cited by 686
Wagner, A., Wright, J., Ganesh, A., Zhou, Z., Mobahi, H., & Ma, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.112 · Cited by 629
A Framework for Robust Subspace Learning
De la Torre, F., & Black, M. J. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023709501986 · Cited by 604
Latent Semantic Indexing: A Probabilistic Analysis
Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1711 · Cited by 556
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Robust video denoising using low rank matrix completion
Ji, H., Liu, C., Shen, Z., & Xu, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539849 · Cited by 483
Bayesian Robust Principal Component Analysis
Ding, X., He, L., & Carin, L. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2156801 · Cited by 282
Variational principal components
Bishop, C. M. (1999) · 9th International Conference on Artificial Neural Networks: ICANN '99 · doi:10.1049/cp:19991160 · Cited by 270
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
Lee, K., & Bresler, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054251 · Cited by 267
RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images
Peng, Y., Ganesh, A., Wright, J., Xu, W., & Ma, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540138 · Cited by 242
Spatiotemporal Imaging with Partially Separable Functions
Liang, Z.-P. (2007) · 2007 Joint Meeting of the 6th International Symposium on Noninvasive Functional Source Imaging of the Brain and Heart and the International Conference on Functional Biomedical Imaging · doi:10.1109/nfsi-icfbi.2007.4387720 · Cited by 204
Rank-Constrained Solutions to Linear Matrix Equations Using PowerFactorization
Haldar, J. P., & Hernando, D. (2009) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2018223 · Cited by 156
Recovering the missing components in a large noisy low-rank matrix: application to SFM
Chen, P., & Suter, D. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.52 · Cited by 154
Robust L1 Principal Component Analysis and Its Bayesian Variational Inference
Gao, J. (2007) · Neural Computation · doi:10.1162/neco.2007.11-06-397 · Cited by 92
Principal Component Analysis for Large Scale Problems with Lots of Missing Values
Raiko, T., Ilin, A., & Karhunen, J. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74958-5_69 · Cited by 70
Cited by
Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision
Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., & Zhang, L. (2017) · International Journal of Computer Vision · doi:10.1007/s11263-016-0930-5 · Cited by 816
Traditional and recent approaches in background modeling for foreground detection: An overview
Bouwmans, T. (2014) · Computer Science Review · doi:10.1016/j.cosrev.2014.04.001 · Cited by 676
Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
Zhao, Q., Zhang, L., & Cichocki, A. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2392756 · Cited by 587
Bouwmans, T., & Zahzah, E. H. (2014) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.11.009 · Cited by 463
Laplacian Regularized Low-Rank Representation and Its Applications
Yin, M., Gao, J., & Lin, Z. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2462360 · Cited by 442
Metadata
- Authors
- Babacan, S. D., Luessi, M., Molina, R., & Katsaggelos, A. K.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-08
- Volume
- 60
- Issue
- 8
- Pages
- 3964-3977
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2153742431
- Cited by
- 327
- References
- 27
- FWCI
- 19.70
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.