Fast l1-minimization algorithms and an application in robust face recognition: A review

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2010, Pages 1849-1852

  Yang, Allen Y ^a   Sastry, S Shankar ^a   Ganesh, Arvind ^b   Ma, Yi ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

FACIAL IMAGES; GRADIENT PROJECTIONS; HOMOTOPIES; HUMAN IDENTITY; ILLUMINATION CHANGES; MINIMIZATION ALGORITHMS; MINIMIZATION METHODS; SPARSE REPRESENTATION; THRESHOLDING;

ALGORITHMS; IMAGE ENHANCEMENT; IMAGING SYSTEMS; LAGRANGE MULTIPLIERS; OPTIMIZATION;

FACE RECOGNITION;

EID: 78651090983     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2010.5651522     Document Type: Conference Paper

References (24)

1. A. Beck and M. Teboulle. A fast iterative shrinkagethresholding algorithm for linear inverse problems. SIAM J. on Im. Sci., 2(1):183-202, 2009.
2. S. Becker, J. Bobin, and E. Candes. NESTA: a fast and accurate first-order method for sparse recovery. preprint, 2009.
3. D. Bertsekas. Nonlinear Programming. Athena Scientific, 2003.
4. A. Bruckstein, D. Donoho, and M. Elad. From sparse solutions of systems of equations to sparse modeling of signals and images. (in press) SIAM Review, 2007.
5. E. Candès, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure and Appl. Math, 59(8):1207-1223, 2006.
6. S. Chen, D. Donoho, and M. Saunders. Atomic decomposition by basis pursuit. SIAM Review, 43(1):129-159, 2001.
7. P. Combettes and V. Wajs. Signal recovery by proximal forward-backward splitting. SIAM Multiscale Modeling and Simulation, 4:1168-1200, 2005.
8. 1-norm minimization problems when the solution may be sparse. preprint, 2006.
9. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani. Least angle regression. The Annals of Statistics, 32(2):407-499, 2004.
10. M. Figueiredo, R. Nowak, and S. Wright. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Sel. Top. in Sig. Proc., 1(4):586-597, 2007.
11. K. Frisch. The logarithmic potential method of convex programming. Technical report, University Institute of Economics (Oslo, Norway), 1955.
12. R. Gross, I. Mathews, J. Cohn, T. Kanade, and S. Baker. Multipie. In FGR, 2006.
13. 1-regularized minimization with applications to compressed sensing. Technical Report CAAM Tech. Rep. TR07-07, Rice University, 2007.
14. 1-regularized least squares. IEEE J. Sel. Top. Sig. Proc., 1(4):606-617, 2007. (Pubitemid 351266626)
15. M. Kojima, N. Megiddo, and S. Mizuno. Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Mathematical Programming, 59:1-21, 1993.
16. D. Malioutov, M. Cetin, and A. Willsky. Homotopy continuation for sparse signal representation. In ICASSP, 2005.
17. R. Monteiro and I. Adler. Interior path following primal-dual algorithms. Part I: Linear programming. Mathematical Programming, 44:27-41, 1989.
18. 2). Soviet Mathematics Doklady, 27(2):372-376, 1983.
19. M. Osborne, B. Presnell, and B. Turlach. A new approach to variable selection in least squares problems. IMA Journal of Numerical Analysis, 20:389-404, 2000.
20. 1- minimization. (accepted) IEEE Trans. Info. Theory, 2010.
21. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Robust face recognition via sparse representation. IEEE Trans. PAMI, 31(2):210 - 227, 2009.
22. S. Wright, R. Nowak, and M. Figueiredo. Sparse reconstruction by separable approximation. In ICASSP, 2008.
23. 1-minimization algorithms and an application in robust face recognition: a review. Technical Report UCB/EECS-2010-13, UC Berkeley, 2010.
24. 1- problems in compressive sensing. preprint, 2009.