Robust principal component analysis?

Journal of the ACM

Volumn 58, Issue 3, 2011, Pages

  Candès, Emmanuel J ^a   Li, Xiaodong ^a   Ma, Yi ^b,c   Wright, John ^c  

^a STANFORD UNIVERSITY   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

Duality; L1 norm minimization; Low rank matrices; Nuclear norm minimization; Principal components; Robustness vis a vis outliers; Sparsity; Video surveillance

Indexed keywords

DUALITY; L1-NORM MINIMIZATION; LOW-RANK MATRICES; NUCLEAR-NORM MINIMIZATION; PRINCIPAL COMPONENTS; SPARSITY; VIDEO SURVEILLANCE;

FACE RECOGNITION; MATRIX ALGEBRA; RECOVERY; SECURITY SYSTEMS;

PRINCIPAL COMPONENT ANALYSIS;

EID: 79960675858     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1970392.1970395     Document Type: Conference Paper

References (54)

1. BASRI, R., AND JACOBS, D. 2003. Lambertian reflectance and linear subspaces. IEEE Trans. Patt. Anal. Mach. Intel. 25, 2, 218-233.
2. BECK, A., AND TEBOULLE, M. 2009. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2, 1, 183-202.
3. BECKER, S., BOBIN, J., AND CANDÈS, E. J. 2011. NESTA: A fast and accuract first-order method for sparse recovery. SIAM J. Imag. Sci. 4, 1, 1-39.
4. BELKIN, M., AND NIYOGI, P. 2003. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15, 6, 1373-1396. (Pubitemid 37049796)
5. BERTSEKAS, D. 1982. Constrained Optimization and Lagrange Multiplier Method. Academic Press.
6. CAI, J., CANDÈS, E. J., AND SHEN, Z. 2010. A singular value thresholding algorithm for matrix completion. SIAM J. Optimiz. 20, 4, 1956-1982.
7. CANDÈS, E. J., AND PLAN, Y. 2010. Matrix completion with noise. Proc. IEEE 98, 6, 925-936.
8. CANDÈS, E. J., AND RECHT, B. 2009. Exact matrix completion via convex optimzation. Found. Comput. Math. 9, 717-772.
9. CANDÈS, E. J., ROMBERG, J., AND TAO, T. 2006. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52, 2, 489-509. (Pubitemid 43174093)
10. CANDÈS, E. J., AND TAO, T. 2010. The power of convex relaxation: Near-optimalmatrix completion. IEEE Trans. Inf. Theory 56, 5, 2053-2080.
11. CEVHER, V., SANKARANARAYANAN, A., DUARTE, M., REDDY, D., BARANIUK, R., AND CHELLAPPA, R. 2009. Compressive sensing for background subtraction. In Proceedings of the European Conference on Computer Vision (ECCV).
12. CHANDRASEKARAN, V., SANGHAVI, S., PARRILO, P., AND WILLSKY, A. 2009. Rank-sparsity incoherence for matrix decomposition. Siam J. Optim., to appear http://arxiv.org/abs/0906.2220.
13. CHEN, S., DONOHO, D., AND SAUNDERS, M. 2001. Atomic decomposition by basis pursuit. SIAM Rev. 43, 1, 129-159. (Pubitemid 32406896)
14. DEWESTER, S., DUMAINS, S., LANDAUER, T., FURNAS, G., AND HARSHMAN, R. 1990. Indexing by latent semantic analysis. J. Soc. Inf. Sci. 41, 6, 391-407.
15. ECKART, C., AND YOUNG, G. 1936. The approximation of one matrix by another of lower rank. Psychometrika 1, 211-218.
16. FAZEL, M., HINDI, H., AND BOYD, S. 2003. Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In Proceedings of the American Control Conference 2156-2162.
17. FISCHLER, M., AND BOLLES, R. 1981. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Comm. ACM 24, 381-385.
18. GEORGHIADES, A., BELHUMEUR, P., AND KRIEGMAN, D. 2001. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Patt. Anal. Mach. Intel. 23, 6.
19. GNANADESIKAN, R., AND KETTENRING, J. 1972. Robust estimates, residuals, and outlier detection with multiresponse data. Biometrics 28, 81-124.
20. GOLDFARB, D., AND MA, S. 2009. Convergence of fixed point continuation algorithms for matrix rank minimization. http://arxiv.org/abs/0906.3499.
21. GRANT, M., AND BOYD, S. 2009. CVX: Matlab software for disciplined convex programming (web page and software). http://stanford.edu/~boyd/cvx.
22. GROSS,D. 2011. Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57, 3, 1548-1566.
23. GROSS, D.,LIU, Y.-K., FLAMMIA, S. T.,BECKER, S., AND EISERT, J. 2010. Quantum state tomography via compressed sensing. Phys. Rev. Lett. 105, 15.
24. HEY, T., TANSLEY, S., AND TOLLE, K. 2009. The Fourth Paradigm: Data-Intensive Scientific Discovery. Microsoft Research.
25. HOTELLING, H. 1933. Analysis of a complex of statistical variables into principal components. J. Educat. Psych. 24, 417-441.
26. HUBER, P. 1981. Robust Statistics. Wiley.
27. JOLLIFFE, I. 1986. Principal Component Analysis. Springer-Verlag.
28. 1-norm factorization in the presence of outliers and missing data. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition.
29. KESHAVAN, R. H., MONTANARI, A., AND OH, S. 2010. Matrix completion from a few entries. IEEE Trans. Inf. Theory 56, 6, 2980-2998.
30. KONTOGIORGIS, S., AND MEYER, R. 1989. A variable-penalty alternating direction method for convex optimization. Math. Prog. 83, 29-53.
31. LEDOUX, M. 2001. The Concentration of Measure Phenomenon. American Mathematical Society.
32. LI, L.,HUANG, W.,GU, I., AND TIAN, Q. 2004. Statistical modeling of complex backgrounds for foreground object detection. IEEE Trans. Image Proc. 13, 11, 1459-1472.
33. LIN, Z., CHEN, M., AND MA, Y. 2009a. The augmented Lagrange multiplier method for exact recovery of a corrupted low-rank matrices. http://arxiv.org/ abs/1009.5055.
34. LIN, Z., GANESH, A., WRIGHT, J., WU, L., CHEN, M., AND MA, Y. 2009b. Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix. In Proceedings of the Symposium on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).
35. LIONS, P., AND MERCIER, B. 1979. Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 6, 964-979.
36. LIU, Z., AND VANDENBERGE, L. 2009. Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31, 3, 1235-1256.
37. MA, S., GOLDFARB, D., AND CHEN, L. 2009. Fixed point and Bregman iterative methods for matrix rank minimization. Math. Prog. Ser. A. DOI 10.1007/s10107-009-0306-5.
38. NESTEROV, Y. 1983. A method of solving a convex programming problem with convergence rate O(1/k2). Soviet Math. Dokl. 27, 2, 372-376.
39. NESTEROV, Y. 2005. Smooth minimization of non-smooth functions. Math. Prog. 103, 1.
40. NESTEROV, Y. 2007. Gradient methods for minimizing composite objective functions. Tech. rep. - CORE - Universite Catholique de Louvain.
41. NETFLIX, INC. The Netflix prize. http://www.netflixprize.com/.
42. OSHER, S., BURGER, M., GOLDFARB, D., XU, J., AND YIN, W. 2005. An iterative regularization method for total variation-based image restoration. Multi. Model. Simul. 4, 460-489. (Pubitemid 43885248)
43. PAPADIMITRIOU, C., RAGHAVAN, P., TAMAKI, H., AND VEMPALA, S. 2000. Latent semantic indexing, a probabilistic analysis. J. Comput. Syst. Sci. 61, 2, 217-235.
44. RECHT, B. 2009. A simpler approach to matrix completion. CoRR abs/0910.0651.
45. RECHT, B., FAZEL, M., AND PARILLO, P. 2010. Guaranteed minimum rank solution of matrix equations via nuclear norm minimization. SIAM Rev. 52, 471-501.
46. STAUFFER, C., AND GRIMSON, E. 1999. Adaptive background mixture models for real-time tracking. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition.
47. TENENBAUM, J., DE SILVA, V., AND LANGFORD, J. 2000. A global geometric framework for nonlinear dimensionality reduction. Science 290, 5500, 2319-2323. (Pubitemid 32041577)
48. TOH, K. C., AND YUN, S. 2010. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac. J. Optim. 6, 615-640.
49. TORRE, F. D. L., AND BLACK, M. 2003. A framework for robust subspace learning. Int. J. Comput. Vis. 54, 117-142.
50. VERSHYNIN, R. 2011. Introduction to the non-asymptotic analysis of random matrices. http://wwwpersonal. umich.edu/̃romanv/papers/non-asymptotic-rmt- plain.pdf.
51. 1-minimization: Methodology and convergence. SIAM J. Optimiz. 19, 3, 1107-1130.
52. 1-minimization with applications to compressed sensing. SIAM J. Imag. Sci. 1, 1, 143-168.
53. YUAN, X., AND YANG, J. 2009. Sparse and low-rank matrix decomposition via alternating direction methods. http://www.optimization-online.org/08 HTML/2009/11/2447.html
54. ZHOU, Z., WAGNER, A., MOBAHI, H., WRIGHT, J., AND MA, Y. 2009. Face recognition with contiguous occlusion using Markov random fields. In Proceedings of the International Conference on Computer Vision (ICCV).