The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
Open accessAbstract
Principal component analysis (PCA) is one of the most widely used dimension reduction techniques. A related easier problem is termed subspace learning or subspace estimation. Given relatively clean data, both are easily solved via singular value decomposition (SVD). The problem of subspace learning or PCA in the presence of outliers is called robust subspace learning (RSL) or robust PCA (RPCA). For long data sequences, if one tries to use a single lower-dimensional subspace to represent the data, the required subspace dimension may end up being quite large. For such data, a better model is to assume that it lies in a low-dimensional subspace that can change over time, albeit gradually. The problem of tracking such data (and the subspaces) while being robust to outliers is called robust subspace tracking (RST). This article provides a magazine-style overview of the entire field of RSL and tracking. In particular, solutions for three problems are discussed in detail: RPCA via sparse+low-rank (S+LR) matrix decomposition; RST via S+LR; robust subspace recovery (RSR). RSR assumes that an entire data vector is either an outlier or an inlier. The S+LR formulation instead assumes that outliers occur on only a few data vector indices and, hence, are well modeled as sparse corruptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
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
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Projection approximation subspace tracking
Yang, B. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.365290 · Cited by 1,273
Vidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
ROBPCA: A New Approach to Robust Principal Component Analysis
Hubert, M., Rousseeuw, P. J., & Vanden Branden, K. (2005) · Technometrics · doi:10.1198/004017004000000563 · Cited by 1,052
CDnet 2014: An Expanded Change Detection Benchmark Dataset
Wang, Y., Jodoin, P.-M., Porikli, F., Konrad, J., Benezeth, Y., & Ishwar, P. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops · doi:10.1109/cvprw.2014.126 · Cited by 882
Otazo, R., Candès, E., & Sodickson, D. K. (2015) · Magnetic Resonance in Medicine · doi:10.1002/mrm.25240 · Cited by 697
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
SuBSENSE: A Universal Change Detection Method With Local Adaptive Sensitivity
St-Charles, P.-L., Bilodeau, G.-A., & Bergevin, R. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2378053 · Cited by 653
Moving Object Detection by Detecting Contiguous Outliers in the Low-Rank Representation
Zhou, X., Yang, C., & Yu, W. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.132 · Cited by 648
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
Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
Vaswani, N., & Lu, W. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2051150 · Cited by 517
Self-citationRobust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173156 · Cited by 445
Robust Procedures in Multivariate Analysis I: Robust Covariance Estimation
Campbell, N. A. (1980) · Applied Statistics · doi:10.2307/2346896 · Cited by 381
He, J., Balzano, L., & Szlam, A. D. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6247848 · Cited by 368
Online identification and tracking of subspaces from highly incomplete information
Balzano, L., Nowak, R., & Recht, B. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706976 · Cited by 331
Dense Error Correction Via $\ell^1$-Minimization
Wright, J., & Ma, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048473 · Cited by 305
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
Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
Liu, X., Zhao, G., Yao, J., & Qi, C. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2419084 · Cited by 246
Simultaneous Video Stabilization and Moving Object Detection in Turbulence
Oreifej, O., Li, X., & Shah, M. A. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.97 · Cited by 225
Robust principal component analysis by self-organizing rules based on statistical physics approach
Xu, L., & Yuille, A. L. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363442 · Cited by 215
Fast Algorithms for Robust PCA via Gradient DescentPreprint
Yi, X., Park, D., Chen, Y., & Caramanis, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07784 · Cited by 213
Total Variation Regularized RPCA for Irregularly Moving Object Detection Under Dynamic Background
Cao, X., Yang, L., & Guo, X. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2419737 · Cited by 185
Robust Online Matrix Factorization for Dynamic Background Subtraction
Yong, H., Meng, D., Zuo, W., & Lei Zhang, A. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2732350 · Cited by 182
Non-convex Robust PCAPreprint
Netrapalli, P., Niranjan, U. N., Sanghavi, S., Anandkumar, A., & Jain, P. (2014) · CaltechAUTHORS (California Institute of Technology) · doi:10.48550/arxiv.1410.7660 · Cited by 177
An Overview of Robust Subspace Recovery
Lerman, G., & Maunu, T. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2853141 · Cited by 156
Weighted and robust incremental method for subspace learning
Skocaj, & Leonardis (2003) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2003.1238667 · Cited by 156
Improving background subtraction using Local Binary Similarity Patterns
St-Charles, P.-L., & Bilodeau, G.-A. (2014) · IEEE Winter Conference on Applications of Computer Vision · doi:10.1109/wacv.2014.6836059 · Cited by 154
Block-Sparse RPCA for Salient Motion Detection
Gao, Z. Y., Cheong, L., & Wang, Y. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2314663 · Cited by 147
Two proposals for robust PCA using semidefinite programming
McCoy, M., & Tropp, J. A. (2011) · Electronic Journal of Statistics · doi:10.1214/11-ejs636 · Cited by 141
Chi, Y., Eldar, Y. C., & Calderbank, R. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2282910 · Cited by 140
Incremental Principal Component Pursuit for Video Background Modeling
Rodríguez, P., & Wohlberg, B. E. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-015-0610-z · Cited by 137
Outlier-Robust PCA: The High-Dimensional Case
Xu, H., Caramanis, C., & Mannor, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2212415 · Cited by 132
A Fast Algorithm for Robust Principal Components Based on Projection Pursuit
Croux, C., & Ruiz‐Gazen, A. (1996) · COMPSTAT · doi:10.1007/978-3-642-46992-3_22 · Cited by 130
Robust Computation of Linear Models by Convex Relaxation
Lerman, G., McCoy, M. B., Tropp, J. A., & Zhang, T. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9221-0 · Cited by 130
Dynamic Anomalography: Tracking Network Anomalies Via Sparsity and Low Rank
Mardani, M., Mateos, G., & Giannakis, G. B. (2012) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2012.2233193 · Cited by 127
Background–Foreground Modeling Based on Spatiotemporal Sparse Subspace Clustering
Javed, S., Mahmood, A., Bouwmans, T., & Jung, S. K. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2746268 · Cited by 124
Self-citationGOSUS: Grassmannian Online Subspace Updates with Structured-Sparsity
Xu, J. W., Ithapu, V. K., Mukherjee, L., Rehg, J. M., & Singh, V. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.419 · Cited by 117
Robust PCA as Bilinear Decomposition With Outlier-Sparsity Regularization
Mateos, G., & Giannakis, G. B. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2204986 · Cited by 112
A Novel M-Estimator for Robust PCAPreprint
Zhang, T., & Lerman, G. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.4863 · Cited by 108
Background Subtraction via generalized fused lasso foreground modeling
Xin, B., Tian, Y., Wang, Y., & Gao, W. (2015) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2015.7299099 · Cited by 104
Foreground–Background Separation From Video Clips via Motion-Assisted Matrix Restoration
Ye, X., Yang, J., Sun, X., Li, K., Hou, C., & Wang, Y. (2015) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2015.2392491 · Cited by 102
LRSLibrary: Low-Rank and Sparse Tools for Background Modeling and Subtraction in Videos
Sobral, A. C., Bouwmans, T., & Zahzah, E.-H. (2016) · CRC Press eBooks · doi:10.1201/b20190-24 · Cited by 102
Self-citationSpatiotemporal Low-Rank Modeling for Complex Scene Background Initialization
Javed, S., Mahmood, A., Bouwmans, T., & Jung, S. K. (2016) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2016.2632302 · Cited by 102
Self-citationRecovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies
Mardani, M., Mateos, G., & Giannakis, G. B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2257913 · Cited by 99
Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise
Qiu, C., Vaswani, N., Lois, B., et al. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2331344 · Cited by 92
Self-citationRobust Matrix Completion and Corrupted Columns
Chen, Y., Xu, H., Caramanis, C., & Sanghavi, S. (2011) · Cited by 90
Provable Non-convex Phase Retrieval with Outliers: Median Truncated Wirtinger FlowPreprint
Zhang, H., Chi, Y., & Liang, Y. (2016) · arXiv (Cornell University) · Cited by 76
COROLA: A sequential solution to moving object detection using low-rank approximation
Shakeri, M., & Zhang, H. (2016) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2016.02.009 · Cited by 71
Real-time Robust Principal Components' Pursuit
Qiu, C., & Vaswani, N. (2010) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2010.5706961 · Cited by 69
Self-citationAn integrated algorithm of incremental and robust PCA
Li, Y., Xu, L., Morphett, J., et al. (2004) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2003.1246944 · Cited by 68
Recursive Tensor Subspace Tracking for Dynamic Brain Network Analysis
Ozdemir, A., Bernat, E. M., & Aviyente, S. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2668146 · Cited by 44
Support-Predicted Modified-CS for recursive robust principal components' Pursuit
Qiu, C., & Vaswani, N. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6034215 · Cited by 43
Self-citationA Fast and Memory-Efficient Algorithm for Robust PCA (MEROP)
Narayanamurthy, P. K., & Vaswani, N. (2018) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2018.8461540 · Cited by 40
Self-citationOnline PCA for Contaminated Data
Feng, J., Xu, H., Mannor, S., et al. (2013) · Cited by 39
LRSLibrary: Low-Rank and Sparse Tools for Background Modeling and Subtraction in Videos
(2016) · CRC Press eBooks · doi:10.1201/b20190-19 · Cited by 34
A robust online subspace estimation and tracking algorithm
Mansour, H., & Jiang, X. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7178735 · Cited by 32
Robust Subspace Tracking With Missing Entries: The Set-Theoretic Approach
Chouvardas, S., Kopsinis, Y., & Theodoridis, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2449254 · Cited by 31
Robust Stochastic Principal Component Analysis
Goes, J., Zhang, T., Arora, R., & Lerman, G. (2015) · Cited by 28
Reinforced Robust Principal Component Pursuit
Brahma, P. P., She, Y., Li, S., Li, J., & Wu, D. O. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2671849 · Cited by 22
Video denoising via online sparse and low-rank matrix decomposition
Guo, H., & Vaswani, N. (2016) · doi:10.1109/ssp.2016.7551731 · Cited by 14
Self-citationNayer, S. S. (2021) · Iowa State University Digital Repository (Iowa State University) · doi:10.31274/etd-20210609-131 · Cited by 2
Cited by
Bouwmans, T., Javed, S., Sultana, M., & Jung, S. K. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.04.024 · Cited by 396
Self-citationNonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Background subtraction in real applications: Challenges, current models and future directions
Garcia-Garcia, B., Bouwmans, T., & Rosales Silva, A. J. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2019.100204 · Cited by 337
Self-citationSun, Y., Yang, J., & An, W. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3022069 · Cited by 332
Zhu, J., Ge, Z., Song, Z., & Gao, F. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.09.003 · Cited by 308
Metadata
- Authors
- Vaswani, N., Bouwmans, T., Javed, S., & Narayanamurthy, P.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2018-07
- Volume
- 35
- Issue
- 4
- Pages
- 32-55
- ISSN
- 1053-5888 (ISSN-L)
- 1558-0792
- OpenAlex
- W2951401720
- Cited by
- 356
- References
- 63
- FWCI
- 30.02
- 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.