Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit

Journal of Scientific Computing

Volumn 56, Issue 3, 2013, Pages 433-449

  Yan, Ming ^a   Yang, Yi ^a   Osher, Stanley ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Adaptive outlier pursuit; Grassmann manifold; Random valued noise; Robust matrix completion

Indexed keywords

ADAPTIVE OUTLIER PURSUIT; GRASSMANN MANIFOLD; LOW-RANK MATRIX COMPLETIONS; MATRIX COMPLETION; MATRIX COMPLETION PROBLEMS; NUMERICAL EXPERIMENTS; RANDOM-VALUED NOISE; SCIENCE AND ENGINEERING;

ALGORITHMS; GAUSSIAN NOISE (ELECTRONIC); PROBLEM SOLVING; RECOVERY; STATISTICS;

MATRIX ALGEBRA;

EID: 84881146105     PISSN: 08857474     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10915-013-9682-3     Document Type: Article

References (30)

1. Absil, P.A.; Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303-330 (2006)
2. Balzano, L.; Nowak, R.; Recht, B.: Online identification and tracking of subspaces from highly incomplete information. In: 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010, pp. 704-711 (2010)
3. Boumal, N.; Absil, P.A.: RTRMC: A Riemannian trust-region method for matrix completion. In: Twenty-Fifth Annual Conference on Neural Information Processing Systems, Grenade (2011)
4. Cai, J.; Candès, E.J.; Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956-1982 (2010)
5. Cai, J.; Osher, S.: Fast singular value thresholding without singular value decomposition. In: UCLA CAM Report, pp. 10-24 (2010)
6. Candes, E.J.; Li, X.; Ma, Y.; Wright, J.: Robust principal component analysis? J. ACM 58(1), 1-37 (2009)
7. Candès, E.J.; Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717-772 (2008)
8. Candès, E.J.; Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053-2080 (2010)
9. Dai, W.; Kerman, E.; Milenkovic, O.: A geometric approach to low-rank matrix completion. IEEE Trans. Inf. Theory 58(1), 237-247 (2012)
10. Dai, W.; Milenkovic, O.; Kerman, E.: Subspace evolution and transfer (SET) for low-rank matrix completion. IEEE Trans. Signal Process. 59(7), 3120-3132 (2011)
11. Dong, B.; Ji, H.; Li, J.; Shen, Z.; Xu, Y.: Wavelet frame based blind image inpainting. Appl. Comput Harmon. Anal. 32(2), 155-312 (2012)
12. Elden, L.: Matrix Methods in Data Mining and Pattern Recognition. Society for Industrial and Applied Mathematics, Philadephia (2007). doi: 10.1137/1.9780898718867
13. Fazel, M.; Hindi, H.; Boyd, H.; Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. Proc. 2001 Am. Control Conf. Cat No. 01CH37148 6(2), 4734-4739 (2001)
14. He, J.; Balzano, L.; Lui, J.C.S.: Online robust subspace tracking from partial information, arXiv: 1109.3827 (preprint) (2011)
15. Jain, P.; Meka, R.; Dhillon, I.: Guaranteed rank minimization via singular value projection. Adv. Neural Inf. Process. Syst. 23, 937-945 (2010)
16. Ji, H.; Huang, S.; Shen, Z.; Xu, Y.: Robust video restoration by joint sparse and low rank matrix approximation. SIAM J. Imaging Sci. 4(4), 1112-1142 (2012)
17. Ji, H.; Liu, C.; Shen, Z.; Xu, Y.: Robust video denoising using low rank matrix completion. In: IEEE Conference in Computer Vision and Pattern Recognition (CVPR), San Francisco, CA (2010)
18. Keshavan, R.; Montanari, A.: Regularization for matrix completion. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1503-1507. Boston (2010)
19. Keshavan, R.; Montanari, A.; Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980-2998 (2010)
20. Keshavan, R.H.; Montanari, A.; Oh, S.: Low-rank matrix completion with noisy observations: a quantitative comparison. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton'09, pp. 1216-1222. IEEE Press, Los Alamitos (2009)
21. Linial, N.; London, E.; Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215-245 (1995)
22. Ma, S.; Goldfarb, D.; Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1-2), 73-122 (2011)
23. Meyer, G.; Bonnabel, S.; Sepulchre, R.: Linear regression under fixed-rank constraints: a Riemannian approach. In: 28th International Conference on Machine Learning (ICML), Washington (2011)
24. Recht, B.; Fazel, M.; Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471-501 (2010)
25. Toh, K.C.; Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Engineering 117543(3), 1-31 (2009)
26. Vandereycken, B.: Low-rank matrix completion by Riemannian optimization (preprint) (2011)
27. Waters, A.E.; Sankaranarayanan, A.C.; Baraniuk, R.G.: Sparcs: Recovering low-rank and sparse matrices from compressive measurements. In: Neural Information Processing Systems (NIPS). Granada, Spain (2011)
28. Wen, Z.; Yin, W.; Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Rice University CAAM Technical Report TR1007, pp. 1-24 (2010)
29. Yan, M.: Restoration of images corrupted by impulse noise using blind inpainting and norm, UCLA CAM Report 11-72 (under review) (2011)
30. Yan, M.; Yang, Y.; Osher, S.: Robust 1-bit compressive sensing using adaptive outlier pursuit. IEEE Trans. Signal Process. 60(7), 3868-3875 (2012)