Fast ℓ 1-minimization and parallelization for face recognition

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2011, Pages 1199-1203

  Shia, Victor ^a   Yang, Allen Y ^a   Sastry, S Shankar ^a   Wagner, Andrew ^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

AUGMENTED LAGRANGIAN METHODS; COMPUTATIONAL COSTS; EXTENSIVE SIMULATIONS; HIGH-DIMENSIONAL; LARGE-SCALE PROBLEM; PARALLELIZATIONS; REAL WORLD EXPERIMENT;

ALGORITHMS;

FACE RECOGNITION;

EID: 84861304308     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2011.6190205     Document Type: Conference Paper

References (18)

1. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. on Im. Sci., 2(1):183-202, 2009.
2. D. Bertsekas. Nonlinear Programming. Athena Scientific, 2003.
3. 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.
4. E. Candès and T. Tao. Decoding by linear programming. IEEE Transactions on Information Theory, 51(12), 2005.
5. S. Chen, D. Donoho, and M. Saunders. Atomic decomposition by basis pursuit. SIAM Review, 43(1):129-159, 2001. (Pubitemid 32406896)
6. I. Daubechies, M. Defrise, and C. Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math., 57:1413-1457, 2004. (Pubitemid 39427442)
7. 1-norm solution is also the sparsest solution. Comm. on Pure and Applied Math, 59(6):797-829, 2006.
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. (Pubitemid 41250302)
10. R. Gross, I. Matthews, J. Cohn, T. Kanade, and S. Baker. Multi-pie. Image and Vision Computing, 28:807-813, 2010.
11. 1-regularized least squares. IEEE J. Sel. Top. Sig. Proc., 1(4):606-617, 2007.
12. R. Tibshirani. Regression shrinkage and selection via the LASSO. J. Royal Stat. Soc. B, 58(1):267-288, 1996.
13. A. Wagner, J. Wright, A. Ganesh, Z. Zhou, and Y. Ma. Toward a practical face recognition system: Robust alignment and illumination by sparse representation. (accepted) PAMI, 2011.
14. 1- minimization. (accepted) IEEE Trans. Info. Theory, 2010.
15. 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.
16. S. Wright, R. Nowak, and M. Figueiredo. Sparse reconstruction by separable approximation. In ICASSP, 2008.
17. A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Fast l1-minimization algorithms and an application in robust face recognition: a review. In Proceedings of the International Conference on Image Processing, 2010.
18. 1-problems in compressive sensing. preprint, 2009.