A variable-penalty alternating directions method for convex optimization
Mathematical Programming: Series A and B
Latent semantic indexing: a probabilistic analysis
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
Atomic Decomposition by Basis Pursuit
SIAM Review
Lambertian Reflectance and Linear Subspaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Framework for Robust Subspace Learning
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Smooth minimization of non-smooth functions
Mathematical Programming: Series A and B
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Compressive Sensing for Background Subtraction
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
SIAM Journal on Optimization
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
SIAM Journal on Imaging Sciences
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
SIAM Journal on Imaging Sciences
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
SIAM Journal on Imaging Sciences
Exact Matrix Completion via Convex Optimization
Foundations of Computational Mathematics
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
SIAM Journal on Matrix Analysis and Applications
The power of convex relaxation: near-optimal matrix completion
IEEE Transactions on Information Theory
Matrix completion from a few entries
IEEE Transactions on Information Theory
A Singular Value Thresholding Algorithm for Matrix Completion
SIAM Journal on Optimization
Fixed point and Bregman iterative methods for matrix rank minimization
Mathematical Programming: Series A and B
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
SIAM Journal on Imaging Sciences
IEEE Transactions on Information Theory
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
IEEE Transactions on Information Theory
Statistical modeling of complex backgrounds for foreground object detection
IEEE Transactions on Image Processing
Image tag refinement towards low-rank, content-tag prior and error sparsity
Proceedings of the international conference on Multimedia
Robust classification of curvilinear and surface-like structures in 3d point cloud data
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Exact matrix completion via convex optimization
Communications of the ACM
Music retagging using label propagation and robust principal component analysis
Proceedings of the 21st international conference companion on World Wide Web
Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
SIAM Journal on Imaging Sciences
Foreground detection by robust PCA solved via a linearized alternating direction method
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
A fast tri-factorization method for low-rank matrix recovery and completion
Pattern Recognition
Bayesian Robust PCA of Incomplete Data
Neural Processing Letters
On sparse and low-rank matrix decomposition for singing voice separation
Proceedings of the 20th ACM international conference on Multimedia
Background subtraction using low rank and group sparsity constraints
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Finding correspondence from multiple images via sparse and low-rank decomposition
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Block-Sparse RPCA for consistent foreground detection
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Robust and efficient subspace segmentation via least squares regression
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Background modeling from surveillance video using rank minimization
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Active subspace: Toward scalable low-rank learning
Neural Computation
An ADM-based splitting method for separable convex programming
Computational Optimization and Applications
Advances in Computational Mathematics
One-Class multiple instance learning via robust PCA for common object discovery
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part I
Foreground detection via robust low rank matrix decomposition including spatio-temporal constraint
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume Part I
Robust principal component analysis via capped norms
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Low-rank matrix completion using alternating minimization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Motion matters: a novel framework for compressing surveillance videos
Proceedings of the 21st ACM international conference on Multimedia
With one look: robust face recognition using single sample per person
Proceedings of the 21st ACM international conference on Multimedia
Iterative reweighted algorithms for matrix rank minimization
The Journal of Machine Learning Research
Learning a factor model via regularized PCA
Machine Learning
International Journal of Computer Vision
Nobody likes Mondays: foreground detection and behavioral patterns analysis in complex urban scenes
Proceedings of the 4th ACM/IEEE international workshop on Analysis and retrieval of tracked events and motion in imagery stream
Robust subspace discovery via relaxed rank minimization
Neural Computation
Matrix Recipes for Hard Thresholding Methods
Journal of Mathematical Imaging and Vision
Hi-index | 0.02 |
This article is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, simply minimize a weighted combination of the nuclear norm and of the ℓ1 norm. This suggests the possibility of a principled approach to robust principal component analysis since our methodology and results assert that one can recover the principal components of a data matrix even though a positive fraction of its entries are arbitrarily corrupted. This extends to the situation where a fraction of the entries are missing as well. We discuss an algorithm for solving this optimization problem, and present applications in the area of video surveillance, where our methodology allows for the detection of objects in a cluttered background, and in the area of face recognition, where it offers a principled way of removing shadows and specularities in images of faces.