File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleFast l<inf>1</inf>-minimization algorithms and an application in robust face recognition: A review
Authors
Issue Date2010
Citation
Proceedings - International Conference on Image Processing, ICIP, 2010, p. 1849-1852 How to Cite?
AbstractWe provide a comprehensive review of five representative l1- minimization methods, i.e., gradient projection, homotopy, iterative shrinkage-thresholding, proximal gradient, and augmented Lagrange multiplier. The repository is intended to fill in a gap in the existing literature to systematically benchmark the performance of these algorithms using a consistent experimental setting. The experiment will be focused on the application of face recognition, where a sparse representation framework has recently been developed to recover human identities from facial images that may be affected by illumination change, occlusion, and facial disguise. The paper also provides useful guidelines to practitioners working in similar fields. © 2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/327470
ISSN
2020 SCImago Journal Rankings: 0.315
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorYang, Allen Y.-
dc.contributor.authorSastry, S. Shankar-
dc.contributor.authorGanesh, Arvind-
dc.contributor.authorMa, Yi-
dc.date.accessioned2023-03-31T05:31:34Z-
dc.date.available2023-03-31T05:31:34Z-
dc.date.issued2010-
dc.identifier.citationProceedings - International Conference on Image Processing, ICIP, 2010, p. 1849-1852-
dc.identifier.issn1522-4880-
dc.identifier.urihttp://hdl.handle.net/10722/327470-
dc.description.abstractWe provide a comprehensive review of five representative l1- minimization methods, i.e., gradient projection, homotopy, iterative shrinkage-thresholding, proximal gradient, and augmented Lagrange multiplier. The repository is intended to fill in a gap in the existing literature to systematically benchmark the performance of these algorithms using a consistent experimental setting. The experiment will be focused on the application of face recognition, where a sparse representation framework has recently been developed to recover human identities from facial images that may be affected by illumination change, occlusion, and facial disguise. The paper also provides useful guidelines to practitioners working in similar fields. © 2010 IEEE.-
dc.languageeng-
dc.relation.ispartofProceedings - International Conference on Image Processing, ICIP-
dc.titleFast l<inf>1</inf>-minimization algorithms and an application in robust face recognition: A review-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICIP.2010.5651522-
dc.identifier.scopuseid_2-s2.0-78651090983-
dc.identifier.spage1849-
dc.identifier.epage1852-
dc.identifier.isiWOS:000287728001235-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats