Fast ℓ1-minimization algorithms for robust face recognition

IEEE Transactions on Image Processing

Volumn 22, Issue 8, 2013, Pages 3234-3246

  Yang, Allen Y ^a   Zhou, Zihan ^b   Balasubramanian, Arvind Ganesh ^c   Sastry, S Shankar ^a   Ma, Yi ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c IBM RESEARCH   (United States)

^d MICROSOFT RESEARCH ASIA   (China)

Author keywords

1 minimization; augmented Lagrangian methods; face recognition

Indexed keywords

AUGMENTED LAGRANGIAN METHODS; CLASSIFICATION FRAMEWORK; INTERIOR-POINT METHOD; LARGE-SCALE APPLICATIONS; MINIMIZATION ALGORITHMS; NUMERICAL IMPLEMENTATION; OPTIMIZATION FRAMEWORK; UNDERDETERMINED LINEAR SYSTEMS;

ALGORITHMS; CONVEX OPTIMIZATION; LINEAR SYSTEMS; SCALABILITY;

FACE RECOGNITION;

ALGORITHM; ANATOMY AND HISTOLOGY; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; FACE; HUMAN; IMAGE ENHANCEMENT; IMAGE SUBTRACTION; PROCEDURES; REPRODUCIBILITY; ROBOTICS; SENSITIVITY AND SPECIFICITY; ARTICLE; HISTOLOGY; METHODOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FACE; HUMANS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; ROBOTICS; SENSITIVITY AND SPECIFICITY; SUBTRACTION TECHNIQUE;

EID: 84879044578     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2013.2262292     Document Type: Article

References (68)

1. 1-minimization algorithms and an application in robust face recognition: A review," in Proc. Int. Conf. Image Process., Feb. 2010, pp. 1849-1852.
2. E. Candès, "Compressive sampling," in Proc. Int. Congr. Math., 2006, pp. 1433-1452.
3. D. Donoho, "For most large underdetermined systems of linear equations the minimal t-norm near solution approximates the sparest solution," Commun. Pure Appl. Math., vol. 59, no. 7, pp. 907-934, 2006.
4. A. Bruckstein, D. Donoho, and M. Elad, "From sparse solutions of systems of equations to sparse modeling of signals and images," SIAM Rev., vol. 51, no. 1, pp. 34-81, 2009.
5. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-159, 2001. (Pubitemid 32406896)
6. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207-1223, 2006. (Pubitemid 43988295)
7. J. F Gemmeke, H. V. Hamme, B. Cranen, and L. Boves, "Compressive sensing for missing data imputation in noise robust speech recognition," J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 272-287, 2010.
8. J. Yang, J. Wright, T. Huang, and Y Ma, "Image super-resolution as sparse representation of raw image patches," in Proc. IEEE Int. Conf. Comput. Vis. Pattern Recognit, 2008, pp. 1-8.
9. D. Baron, M. Wakin, M. Duarte, S. Sarvotham, and R. Baraniuk, Distributed Compressed Sensing. Houston, TX, USA: Rice Univ., Nov. 2005.
10. A. Yang, M. Gastpar, R. Bajcsy, and S. Sastry, "Distributed sensor perception via sparse representation," Proc. IEEE, vol. 98, no. 6, pp. 1077-1088, Jun. 2010.
11. J. Wright, Y Ma, J. Mairal, G. Sapiro, T. Huang, and S. Yan, "Sparse representation for computer vision and pattern recognition," Proc. IEEE, vol. 98, no. 6, pp. 1031-1044, Jun. 2010.
12. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210-227, Feb. 2009.
13. A. Wagner, J. Wright, A. Ganesh, Z. Zhou, and Y Ma, "Toward a practical face recognition: Robust pose and illumination via sparse representation," in Proc. IEEE Int. Conf. Comput. Vis. Pattern Recognit., Jun. 2009, pp. 597-604.
14. 1-penalized functionals," Inverse Problems, vol. 25, no. 3, pp. 1-16, 2009.
15. S. Becker, J. Bobin, and E. Candes, NESTA: A Fast and Accurate First-Order Method for Sparse Recovery. Berkeley, CA, USA: Univ. of California Press, Apr. 2009.
16. M. Zibulevskyb and M. Elad, "L1-L2 optimization in signal and image processing," IEEE Signal Process. Mag., vol. 27, no. 3, pp. 76-88, May 2010.
17. D. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. Belmont, MA, USA: Athena Scientific, 1982.
18. 1-Problems in Compressive Sensing. Berkeley, CA, USA: Univ. of California Press, Apr. 2009.
19. Y Nesterov, "A method of solving a convex programming problem with convergence rate O(1/k )," Soviet Math. Doklady, vol. 27, no. 2, pp. 372-376, 1983.
20. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imaging Sci., vol. 2, no. 1, pp. 183-202, Jan. 2009.
21. M. Elad, B. Matalon, and M. Zibulevskyb, "Coordinate and subspace optimization methods for linear least squares with non-quadratic regu-larization," Appl. Comput. Harmonic Anal., vol. 23, no. 3, pp. 346-367, Nov. 2007. (Pubitemid 47552874)
22. D. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," PNAS, vol. 106, no. 45, pp. 18914-18919, Jul. 2009.
23. S. R. Becker, E. J. Candès, and M. Grant, "Templates for convex cone problems with applications to sparse signal recovery," Math. Program. Compon., vol. 3, no. 3, pp. 165-218, 2010.
24. L. Zhang, M. Yang, and X. Feng, "Sparse representation or collaborative representation: Which helps face recognition?" in Proc. IEEE Int. Conf. Comput. Vis., Nov. 2011, pp. 471-478.
25. J. Wright, A. Ganesh, A. Yang, Z. Zhou, and Y Ma, Sparsity and Robustness in Face Recognition-A Tutorial on How to Apply the Models and Tools Correctly. Berkeley, CA, USA: Univ. of California Press, 2011.
26. M. Figueiredo, R. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 586-597, Apr. 2007. (Pubitemid 351276802)
27. S. Wright, R. Nowak, and M. Figueiredo, "Sparse reconstruction by separable approximation," IEEE Trans. Signal Process., vol. 57, no. 7, Jul. 2009, pp. 2479-2493.
28. E. van den Berg and M. P. Friedlander, "Probing the pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput, vol. 31, no. 2, pp. 890-912, 2008.
29. M. V. Afonso, J. M. Bioucas-Dias, and M. A. T. Figueiredo, "Fast image recovery using variable splitting and constrained optimization," IEEE Trans. Image Process., vol. 19, no. 9, pp. 2345-2356, Sep. 2010.
30. J. Friedman, T. Hastie, and R. Tibshirani, "Regularization paths for generalized linear models via coordinate descent," J. Stat. Softw., vol. 33, no. 1, pp. 1-22, 2010.
31. 1-minimization with applications to compressed sensing," SIAM J. Imaging Sci., vol. 1, no. 1, pp. 143-168, 2008.
32. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," J. Constructive Approx., vol. 13, no. 1, pp. 57-98, 1997.
33. D. Needell and J. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., vol. 26, no. 3, pp. 301-321, May 2008.
34. W Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2230-2249, May 2009.
35. J. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
36. J. Tropp and S. Wright, "Computational methods for sparse solution of linear inverse problems," Proc. IEEE, vol. 98, no. 6, pp. 948-958, Jun. 2010.
37. P. Belhumeur, J. Hespanda, and D. Kriegman, "Eigenfaces vs. Fisher-faces: Recognition using class specific linear projection," IEEE Trans. Pattern Anal. Mach. Intell., vol. 19, no. 7, pp. 711-720, Jul. 1997. (Pubitemid 127762263)
38. R. Basri and D. Jacobs, "Lambertian reflectance and linear subspaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 2, pp. 218-233, Feb. 2003.
39. J. Wright and Y Ma, "Dense error correction via t-minimization, " IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3540-3560, Jul. 2010.
40. K. Frisch, The Logarithmic Potential Method of Convex Programming. Univ. Inst. Econ., Oslo, Norway, Tech. Rep., 1955.
41. N. Karmarkar, "A new polynomial time algorithm for linear programming," Combinatorica, vol. 4, no. 4, pp. 373-395, Apr. 1984.
42. N. Megiddo, "Pathways to the optimal set in linear programming," in Proc. Progr. Math. Program., Interior-Point Rel. Methods Conf., 1989, pp. 131-158.
43. R. Monteiro and I. Adler, "Interior path following primal-dual algorithms. Part I: Linear programming," Math. Program., vol. 44, nos. 1-3, pp. 27-41, May 1989.
44. M. Kojima, N. Megiddo, and S. Mizuno, "Theoretical convergence of large-step primal-dual interior point algorithms for linear programming," Math. Program., vol. 59, nos. 1-3, pp. 1-21, Mar. 1993. (Pubitemid 23683318)
45. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
46. S. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "An interior-point method for large-scale t1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Sep. 2007. (Pubitemid 351266626)
47. C. Kelley, Iterative Methods for Linear and Nonlinear Equations. Philadelphia, PA, USA: SIAM, 1995.
48. J. Nocedal and S. Wright, Numerical Optimization, 2nd ed. New York, NY, USA: Springer-Verlag, 2006.
49. M. Osborne, B. Presnell, and B. Turlach, "A new approach to variable selection in least squares problems," IMA J. Numer. Anal, vol. 20, no. 3, pp. 389-404, 2000.
50. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Stat., vol. 32, no. 2, pp. 407-499, 2004. (Pubitemid 41250302)
51. D. Malioutov, M. Cetin, and A. Willsky, "Homotopy continuation for sparse signal representation," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Mar. 2005, pp. 733-736.
52. D. Donoho and Y. Tsaig. (2006). Fast Solution of €-Norm Minimization Problems When the Solution May be Sparse [Online]. Available: http://www.stanford.edu/tsaig/research.html
53. M. Asif, "Primal dual prusuit: A homotopy based algorithm for the dantzig selector," M.S. thesis, Dept. School Electr. Comput. Eng., Georgia Inst. Technol., Atlanta, GA, USA, Aug. 2008.
54. P. Combettes and V. Wajs, "Signal recovery by proximal forward-backward splitting," SIAM Multiscale Model. Simul, vol. 4, no. 4, pp. 1168-1200, 2005. (Pubitemid 44932287)
55. I. Daubechies, M. Defrise, and C. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, Nov. 2004. (Pubitemid 39427442)
56. E. Hale, W. Yin, and Y Zhang, "A fixed-point continuation method for I-regularized minimization with applications to compressed sensing," Dept. Comput. Appl. Math., Rice Univ., Houston, TX, USA, CAAM Tech. Rep. TR07-07, Jul. 2007.
57. J. Barzilai and J. Borwein, "Two point step size gradient methods," IMA J. Numer. Anal, vol. 8, no. 1, pp. 141-148, 1988.
58. W. W. Hager, D. T. Phan, and H. Zhang, "Gradient-based methods for sparse recovery," SIAM J. Imaging Sci., vol. 4, no. 1, pp. 146-165, 2011.
59. Y Nesterov, Gradient Methods for Minimizing Composite Objective Function. Louvain-La-Neuve, Belgium: University Catholique De Lou-vain, Sep. 2007.
60. D. Baron, S. Sarvotham, and R. Baraniuk, "Bayesian compressive sensing via belief propagation," IEEE Trans. Signal Process., vol. 58, no. 1, pp. 269-280, Jan. 2010.
61. F. Kschischang, B. Frey, and H. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001. (Pubitemid 32318087)
62. P. Tseng, "On accelerated proximal gradient methods for convex-concave optimization," SIAM J. Optim., vol. 6, pp. 1-20, May 2008.
63. A. Auslender and M. Teboulle, "Interior gradient and proximal methods for convex and conic optimization," SIAM J. Optim., vol. 16, no. 3, pp. 697-725, 2006. (Pubitemid 44231146)
64. D. P. Bertsekas, Nonlinear Programming. Belmont, MA, USA: Athena Scientific, 2003.
65. T. Goldstein and S. Osher, "The split bregman method for l1-regularized problems," SIAM J. Imaging Sci., vol. 2, no. 2, pp. 323-343, 2009.
66. M. V. Afonso, J. M. Bioucas-Dias, and M. A. T. Figueiredo, "An augmented lagrangian approach to the constrained optimization formulation of imaging inverse problems," IEEE Trans. Image Process., vol. 20, no. 3, pp. 681-695, Mar. 2011.
67. R. Gross, I. Mathews, J. Cohn, T. Kanade, and S. Baker, "Multi-PIE," in Proc. IEEE Int. Conf. Autom. Face Gesture Recognit., Sep. 2008, pp. 1-8.
68. V. Shia, A. Yang, and S. Sastry, "Fast l1-minimization and algorithm parallelization for face recognition," in Proc. Asilomar Conf. Signals, Syst. Comput., 2011, pp. 1-5.