Robust locally linear analysis with applications to image denoising and blind inpainting

SIAM Journal on Imaging Sciences

Volumn 6, Issue 1, 2013, Pages 526-562

  Wang, Yi ^a   Szlam, Arthur ^b   Lerman, Gilad ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

Alternating least squares; Blind inpainting; Denoising; Impulsive noise; Locally linear; Multiple subspaces modeling; Robust pca; Subspace clustering

Indexed keywords

ALTERNATING LEAST SQUARES; DE-NOISING; INPAINTING; LOCALLY LINEAR; ROBUST PCA; SUB-SPACE CLUSTERING;

CLUSTERING ALGORITHMS; IMPULSE NOISE; ITERATIVE METHODS;

IMAGE DENOISING;

EID: 84875876270     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/110843642     Document Type: Article

References (49)

1. A. Agarwal, S. Negahban, and M. Wainwright, Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions, in Proceedings of the 28th International Conference on Machine Learning (ICML), Omnipress, Madison, WI, 2011, pp. 1129-1136.
2. M. Aharon, M. Elad, and A. Bruckstein, K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation, IEEE Trans. Signal Process., 54 (2006), pp. 4311-4322.
3. L. Balzano, B. Recht, and R. Nowak, High-dimensional matched subspace detection when data are missing, in Proceedings of the International Symposium on Information Theory, IEEE, New York, 2010.
4. L. Bottou and Y. Bengio, Convergence properties of the k-means algorithms, in Advances in Neural Information Processing Systems 7, MIT Press, Cambridge, MA, 1995, pp. 585-592.
5. P. Bradley and O. Mangasarian, k-plane clustering, J. Global Optim., 16 (2000), pp. 23-32.
6. A. Buades, B. Coll, and J.-M. Morel, A non-local algorithm for image denoising, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, pp. 60-65.
7. A. M. Buchanan and A. W. Fitzgibbon, Damped Newton algorithms for matrix factorization with missing data, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, pp. 316-322.
8. E. J. Candès, X. Li, Y. Ma, and J. Wright, Robust principal component analysis?, J. ACM, 58 (2011), 11.
9. V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky, Rank-sparsity incoherence for matrix decomposition, SIAM J. Optim., 21 (2011), pp. 572-596.
10. R. R. Coifman and D. L. Donoho, Translation-invariant de-noising, in Wavelets and Statistics, Springer-Verlag, New York, 1995, pp. 125-150.
11. G. B. Dantzig, J. Folkman, and N. Shapiro, On the continuity of the minimum set of continuous functions, J. Math. Anal. Appl., 17 (1967), pp. 519-548.
12. B. Dong, H. Ji, J. Li, Z. Shen, and Y. Xu, Wavelet frame based blind image inpainting, Appl. Comput. Harmon. Anal., 32 (2011), pp. 268-279.
13. M. Elad and M. Aharon, Image denoising via learned dictionaries and sparse representation, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2006, pp. 17-22.
14. J. C. Fiorot and P. Huard, Composition and union of general algorithms of optimization. Point-to-set maps and mathematical programming, Math. Programming Studies, No. 10 (1979), pp. 69-85.
15. J. Ho, M. Yang, J. Lim, K. Lee, and D. Kriegman, Clustering appearances of objects under varying illumination conditions, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vol. 1, 2003, pp. 11-18.
16. D. Hsu, S. M. Kakade, and T. Zhang, Robust matrix decomposition with sparse corruptions, IEEE Trans. Inform. Theory, 57 (2011), pp. 7221-7234.
17. P. J. Huber and E. M. Ronchetti, Robust Statistics, Wiley Ser. Probab. Stat., John Wiley & Sons, Hoboken, NJ, 2009.
18. N. Kambhatla and T. K. Leen, Fast non-linear dimension reduction, in Advances in Neural Information Processing Systems 6, Morgan Kaufmann, San Francisco, CA, 1994, pp. 152-159.
19. A. T. Kyrillidis and V. Cevher, Matrix ALPS: Accelerated Low Rank and Sparse Matrix Reconstruction, CoRR, abs/1203.3864, 2012.
20. J. A. Lee and M. Verleysen, Nonlinear Dimensionality Reduction, Inf. Sci. Stat., Springer, New York, 2007.
21. G. Lerman and T. Zhang, Robust recovery of multiple subspaces by geometric lp minimization, Ann. Statist., 39 (2011), pp. 2686-2715.
22. X. Liang, X. Ren, Z. Zhang, and Y. Ma, Repairing sparse low-rank texture, in Proceedings of the 12th European Conference on Computer Vision, Part V, Lecture Notes in Comput. Sci. 7572, SpringerVerlag, Berlin, Heidelberg, 2012, pp. 482-495.
23. Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma, Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix, Technical report UILU-ENG-09-2214, University of Illinois at Urbana-Champaign, Urbana, IL, 2009.
24. G. Liu, Z. Lin, S. Yan, J. Sun, Y. Yu, and Y. Ma, Robust recovery of subspace structures by low-rank representation, IEEE Trans. Pattern Anal. Mach. Intell., 35 (2013), pp. 171-184.
25. G. Liu, Z. Lin, and Y. Yu, Robust subspace segmentation by low-rank representation, in Proceedings of the 27th International Conference on Machine Learning (ICML), Omnipress, Madison, WI, 2010.
26. R. A. Maronna, R. D. Martin, and V. J. Yohai, Robust Statistics: Theory and Methods, Wiley Ser. Probab. Stat., John Wiley & Sons, Chichester, UK, 2006.
27. D. Martin, C. Fowlkes, D. Tal, and J. Malik, A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, in Proceedings of the Eighth IEEE International Conference on Computer Vision (ICCV), Vol. 2, 2001, pp. 416-423.
28. R. R. Meyer, Sufficient conditions for the convergence of monotonic mathematical programming algorithms, J. Comput. System Sci., 12 (1976), pp. 108-121.
29. T. Okatani and K. Deguchi, On the Wiberg algorithm for matrix factorization in the presence of missing components, Int. J. Comput. Vision, 72 (2007), pp. 329-337.
30. G. Peyre, Toolbox Non-Local Means, http://www.mathworks.com/matlabcentral/fileexchange/13619 (27 June 2009).
31. S. Roweis, EM algorithms for PCA and sensible PCA, in Proceedings of Neural Information Processing Systems, 1997.
32. S. Roweis and L. Saul, Nonlinear dimensionality reduction by locally linear embedding, Science, 290 (2000), pp. 2323-2326.
33. J. Salmon, Z. T. Harmany, C.-A. Deledalle, and R. Willett, Poisson Noise Reduction with Non-Local PCA, CoRR, abs/1206.0338, 2012.
34. Y. Shen, Z. Wen, and Y. Zhang, Augmented Lagrangian Alternating Direction Method for Matrix Separation Based on Low-Rank Factorization, Technical Report TR11-02, Rice University, Houston, TX, 2011.
35. M. Tao and X. Yuan, Recovering low-rank and sparse components of matrices from incomplete and noisy observations, SIAM J. Optim., 21 (2011), pp. 57-81.
36. J. B. Tenenbaum, V. de Silva, and J. C. Langford, A global geometric framework for nonlinear dimensionality reduction, Science, 290 (2000), pp. 2319-2323.
37. B. Triggs, P. F. McLauchlan, R. I. Hartley, and A. W. Fitzgibbon, Bundle adjustment-a modern synthesis, in Proceedings of the International Workshop on Vision Algorithms: Theory and Practice (ICCV'99), Springer-Verlag, London, 2000, pp. 298-372.
38. J. Tropp, I. Dhillon, R. Heath, and T. Strohmer, Designing structured tight frames via an alternating projection method, IEEE Trans. Inform. Theory, 51 (2005), pp. 188-209.
39. P. Tseng, Nearest q-flat to m points, J. Optim. Theory Appl., 105 (2000), pp. 249-252.
40. R. Vidal and R. I. Hartley, Motion segmentation with missing data using power factorization and GPCA, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004, pp. 310-316.
41. M. B. Wakin, Manifold-Based Signal Recovery and Parameter Estimation from Compressive Measurements, preprint, arXiv:1002.1247v1 [stat.ML], 2010.
42. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, Image quality assessment: From error visibility to structural similarity, IEEE Trans. Image Process., 13 (2004), pp. 600-612. 562 YI WANG, ARTHUR SZLAM, AND GILAD LERMAN
43. A. E. Waters, A. C. Sankaranarayanan, and R. G. Baraniuk, SpaRCS: Recovering low-rank and sparse matrices from compressive measurements, in Proceedings of Neural Information Processing Systems (NIPS), Granada, Spain, 2011.
44. T. Wiberg, Computation of principal components when data are missing, in Proceedings of the Second Symposium on Computational Statistics, Berlin, Physica-Verlag, Heidelberg, 1976, pp. 229-326.
45. M. Yan, Restoration of Images Corrupted by Impulse Noise Using Blind Inpainting and l0 Norm, UCLA CAM report 11-72, Department of Mathematics, University of California, Los Angeles, CA, 2011.
46. G. Yu, G. Sapiro, and S. Mallat, Image modeling and enhancement via structured sparse model selection, in Proceedings of the 17th IEEE International Conference on Image Processing (ICIP), 2010.
47. W. I. Zangwill, Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, NJ, 1969.
48. K. Zhao and Z. Zhang, Successively alternate least square for low-rank matrix factorization with bounded missing data, Comput. Vis. Image Underst., 114 (2010), pp. 1084-1096.
49. Z. Zhou, X. Li, J. Wright, E. J. Candès, and Y. Ma, Stable principal component pursuit, in Proceedings of the International Symposium on Information Theory (ISIT), IEEE, New York, 2010.