DocumentCode :
2917336
Title :
Is face recognition really a Compressive Sensing problem?
Author :
Qinfeng Shi ; Eriksson, Anders ; van den Hengel, A. ; Chunhua Shen
Author_Institution :
Australian Centre for Visual Technol., Univ. of Adelaide, Adelaide, SA, Australia
fYear :
2011
fDate :
20-25 June 2011
Firstpage :
553
Lastpage :
560
Abstract :
Compressive Sensing has become one of the standard methods of face recognition within the literature. We show, however, that the sparsity assumption which underpins much of this work is not supported by the data. This lack of sparsity in the data means that compressive sensing approach cannot be guaranteed to recover the exact signal, and therefore that sparse approximations may not deliver the robustness or performance desired. In this vein we show that a simple ℓ2 approach to the face recognition problem is not only significantly more accurate than the state-of-the-art approach, it is also more robust, and much faster. These results are demonstrated on the publicly available YaleB and AR face datasets but have implications for the application of Compressive Sensing more broadly.
Keywords :
approximation theory; data compression; face recognition; image coding; AR face dataset; YaleB face dataset; compressive sensing approach; face recognition; sparse approximation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on
Conference_Location :
Providence, RI
ISSN :
1063-6919
Print_ISBN :
978-1-4577-0394-2
Type :
conf
DOI :
10.1109/CVPR.2011.5995556
Filename :
5995556
Link To Document :
بازگشت