File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Towards a robust face recognition system using compressive sensing
Title | Towards a robust face recognition system using compressive sensing |
---|---|
Authors | |
Keywords | Compressive sensing Face recognition |
Issue Date | 2010 |
Citation | Proceedings of the 11th Annual Conference of the International Speech Communication Association, INTERSPEECH 2010, 2010, p. 2250-2253 How to Cite? |
Abstract | An application of compressive sensing (CS) theory in image-based robust face recognition is considered. Most contemporary face recognition systems suffer from limited abilities to handle image nuisances such as illumination, facial disguise, and pose misalignment. Motivated by CS, the problem has been recently cast in a sparse representation framework: The sparsest linear combination of a query image is sought using all prior training images as an overcomplete dictionary, and the dominant sparse coefficients reveal the identity of the query image. The ability to perform dense error correction directly in the image space also provides an intriguing solution to compensate pixel corruption and improve the recognition accuracy exceeding most existing solutions. Furthermore, a local iterative process can be applied to solve for an image transformation applied to the face region when the query image is misaligned. Finally, we discuss the state of the art in fast ℓ1-minimization to improve the speed of the robust face recognition system. The paper also provides useful guidelines to practitioners working in similar fields, such as acoustic/speech recognition. © 2010 ISCA. |
Persistent Identifier | http://hdl.handle.net/10722/326867 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Allen Y. | - |
dc.contributor.author | Zhou, Zihan | - |
dc.contributor.author | Ma, Yi | - |
dc.contributor.author | Sastry, S. Shankar | - |
dc.date.accessioned | 2023-03-31T05:27:06Z | - |
dc.date.available | 2023-03-31T05:27:06Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Proceedings of the 11th Annual Conference of the International Speech Communication Association, INTERSPEECH 2010, 2010, p. 2250-2253 | - |
dc.identifier.uri | http://hdl.handle.net/10722/326867 | - |
dc.description.abstract | An application of compressive sensing (CS) theory in image-based robust face recognition is considered. Most contemporary face recognition systems suffer from limited abilities to handle image nuisances such as illumination, facial disguise, and pose misalignment. Motivated by CS, the problem has been recently cast in a sparse representation framework: The sparsest linear combination of a query image is sought using all prior training images as an overcomplete dictionary, and the dominant sparse coefficients reveal the identity of the query image. The ability to perform dense error correction directly in the image space also provides an intriguing solution to compensate pixel corruption and improve the recognition accuracy exceeding most existing solutions. Furthermore, a local iterative process can be applied to solve for an image transformation applied to the face region when the query image is misaligned. Finally, we discuss the state of the art in fast ℓ1-minimization to improve the speed of the robust face recognition system. The paper also provides useful guidelines to practitioners working in similar fields, such as acoustic/speech recognition. © 2010 ISCA. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the 11th Annual Conference of the International Speech Communication Association, INTERSPEECH 2010 | - |
dc.subject | Compressive sensing | - |
dc.subject | Face recognition | - |
dc.title | Towards a robust face recognition system using compressive sensing | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-79959820342 | - |
dc.identifier.spage | 2250 | - |
dc.identifier.epage | 2253 | - |