Robust principal component analysis?

@article{Cands2011RobustPC,
  title={Robust principal component analysis?},
  author={Emmanuel J. Cand{\`e}s and Xiaodong Li and Yi Ma and John Wright},
  journal={J. ACM},
  year={2011},
  volume={58},
  pages={11:1-11:37}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 838 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 4,683 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 2,601 extracted citations

Low-Rank-Sparse Subspace Representation for Robust Regression

2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) • 2017
View 13 Excerpts
Highly Influenced

Automatic Subspace Learning via Principal Coefficients Embedding

IEEE Trans. Cybernetics • 2017
View 16 Excerpts
Highly Influenced

Automatic Subspace Learning via Principal Coefficients Embedding

IEEE Transactions on Cybernetics • 2017
View 16 Excerpts
Highly Influenced

BSS with Corrupted Data in Transformed Domains

View 12 Excerpts
Highly Influenced

4,684 Citations

0500'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 4,684 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

A Framework for Robust Subspace Learning

International Journal of Computer Vision • 2003
View 4 Excerpts
Highly Influenced

A Simpler Approach to Matrix Completion

Journal of Machine Learning Research • 2011
View 3 Excerpts
Highly Influenced

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

IEEE Transactions on Information Theory • 2011
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…