Compressive principal component pursuit

Information and Inference

Volumn 2, Issue 1, 2013, Pages 32-68

  Wright, John ^a   Ganesh, Arvind ^b   Min, Kerui ^c   Ma, Yi ^c,d  

^a Columbia University ^*  (United States)

^b IBM RESEARCH INDIA   (India)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d MICROSOFT RESEARCH ASIA   (China)

Author keywords

Compressed sensing; Convex optimization; Low rank recovery; Sparse recovery

Indexed keywords

EID: 85071489887     PISSN: None     EISSN: 20498772     Source Type: Journal    
DOI: 10.1093/imaiai/iat002     Document Type: Article

References (41)

1. Agarwal, A., Negahban, S. & Wainwright, M. J. (2011) Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions. http://arxiv.org/abs/1102.4807.
2. Bach, F. (2010) Structured sparsity-inducing norms through submodular functions. http://arxiv.org/pdf/1008.4220.pdf.
3. Basri, R. and Jacobs, D. (2003) Lambertian reflectance and linear subspaces. IEEE Trans. Pattern Anal. Mach. Intell., 25, 218-233.
4. Becker, S., Candès, E. & Grant, M. (2010) Templates for convex cone problems with applications to sparse signal recovery. Math. Prog. Comp., 3, 165-218.
5. Bobin, J., Moudden, Y., Starck, J. L. & Elad, M. (2007) Sparsity and morphological diversity and source separation. IEEE Trans. Image Process., 16, 2662-2674.
6. Candès, E., Li, X., Ma, Y. & Wright, J. (2011) Robust principal component analysis? J. ACM, 58, 1-37.
7. Candès, E. & Recht, B. (2008) Exact matrix completion via convex optimzation. Found. Comput. Math., 9, 717-772.
8. Candès, E. & Recht, B. (2011) Simple bounds for low-complexity model reconstruction. http://arxiv.org/abs/1106.1474.
9. Candès, E. & Tao, T. (2005) Decoding by linear programming. IEEE Trans. Inf. Theory, 51, 4203-4215.
10. Chandrasekaran, V., Recht, B., Parillo, P. & Wilsky, A. (2010) The convex geometry of linear inverse problems. Foundations of Comp. Math., 12, 805-849.
11. Chandrasekaran, V., Sanghavi, S., Parillo, P. & Wilsky, A. (2011) Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim., 21, 572-596.
12. Chen, Y., Jalali, A., Sanghavi, S. & Caramanis, C. (2013) Low-rank matrix recovery from errors and erasures. IEEE Trans. Inf. Theory. http://arxiv.org/abs/1104.0354.
13. Dasgupta, S. & Gupta, A. (2003) An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms, 22, 60-65.
14. Davidson, K. & Szarek, S. (2001) Local operator theory, random matrices and banach spaces. Handbook of the Geometry of Banach Spaces (W. B. Johnson & J. Lindenstrauss eds) Elsevier Science, pp. 317-366.
15. Donoho, D. (2006) Compressive sensing. IEEE Trans. Inf. Theory, 52, 1289-1306.
16. Ganesh, A., Li, X., Wright, J., Candes, E. & Ma, Y. (2010) Dense error correction for low-rank matrices via principal component pursuit. Proceedings of the International Symposium on Information Theory, Austin, Texas, United States.
17. Ganesh, A., Min, K., Wright, J. & Ma, Y. (2012) Principal component pursuit with reduced linear measurements. Available at http://arxiv.org/pdf/1202.6445.
18. Golbabaee, M. & Vandergheynst, P. (2011) Hyperspectral image compressed sensing via low-rank and joint sparse matrix recovery. Indernational Conference on Acoustics, Speech and Signal Processing ICASSP, Prague, Czech Republic.
19. Gross, D. (2011) Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory, 57, 1548-1566.
20. Horn, R. & Johnson, C. (1990) Matrix Analysis. Cambridge: Cambridge University Press.
21. Hsu, D., Kakade, S. & Zhang, T. (2011) Robust matrix decomposition with outliers. IEEE Trans. Inf. Theory, 57, 7221-7234.
22. Laurent, B. & Massart, P. (2000) Adaptive estimation of a quadratic function by model selection. Ann. Statist., 28, 1302-1338.
23. Ledoux, M. (2001) The Concentration of Measure Phenomenon. Providence, RI: American Mathematical Society.
24. Ledoux, M. & Talagrand, M. (1991) Probability in Banach Spaces: Isoperimetry and Processes. Berlin: Springer.
25. Li, X. (2011) Compressed sensing and matrix completion with constant proportion of corruptions. Available at http://arxiv.org/abs/1104.1041.
26. McCoy, M. & Tropp, J. (2011) Two proposals for robust PCA using semidefinite programming. Electron. J. Stat. 5, 1123-1160.
27. Needell, D. & Tropp, J. (2008) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal., 26, 301-321.
28. Negahban, S., Ravikumar, P., Wainwright, M. & Yu, B. (2010) A unified framework for analyzing m-estimators with decomposible regularizers. Available at http://arxiv.org/abs/1010.2731v1.
29. 2). Soviet Math. Dokl., 27, 372-376.
30. Peng, Y., Ganesh, A., Wright, J., Xu, W. & Ma, Y. (2012) Rasl: robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell., 34, 2233-2246.
31. Recht, B. (2011) A simpler approach to matrix completion. J. Mach. Learn. Res., 12, 3413-3430.
32. Shu, X. & Ahuja, N. (2011) Imaging via three-dimensional compressive sampling (3DCS). International Conference on Computer Vision ICCV. Barcelona, Spain.
33. Vershynin, R. (2009) Lectures on geometric functional analysis. Available at http://www-personal.umich.edu/ romanv/papers/GFA-book/GFA-book.pdf.
34. Vershynin, R. (2011) Introduction to the non-asymptotic analysis of random matrices. Available at http://www-personal.umich.edu/ romanv/papers/non-asymptotic-rmt-plain.pdf.
35. Watson, G. (1992) Characterization of the subdifferential of some matrix norms. Linear Algebra Appl., 170, 33-45.
36. Waters, A., Sankaranarayanan, A. & Baraniuk, R. (2011) Sparcs: recovering low-rank and sparse matrices from compressive measurements. Proceedings of the Neural Information Processing Systems (NIPS). Vancouver, Canada.
37. Wu, L., Ganesh, A., Shi, B., Matsushita, Y., Wang, Y. & Ma, Y. (2010) Robust photometric stereo via low-rank matrix completion and recovery. Asian Conference on Computer Vision. Queenstown, New Zealand.
38. Xu, H., Sanghavi, S. & Caramanis, C. (2011) Robust PCA via outlier pursuit. IEEE Trans, Inf. Theory, 58, 3047-3064.
39. Zhang, H., Cai, J. & Zhu, J. (2012) Strongly convex programming for exact matrix completion and robust principal component analysis. http://arxiv.org/abs/1112.3946.
40. Zhang, Z., Ganesh, A., Liang, X. & Ma, Y. (2012) Tilt: transform invariant low-rank textures. Int. J. Comput. Vis., 99, 1-24.
41. Zhou, Z., Li, X., Wright, J., Candes, E. & Ma, Y. (2010) Stable principal component pursuit. Proceedings of International Symposium on Information Theory, Austin, Texas, United States.