Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Is face recognition really a compressive sensing problem?|
Van Den Hengel, A.
|Citation:||Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, held in Providence, Rhode Island USA, 20-25 June, 2011: pp. 553-560|
|Series/Report no.:||IEEE Conference on Computer Vision and Pattern Recognition|
|Conference Name:||Conference on Computer Vision and Pattern Recognition (2011 : Rhode Island, USA)|
|Qinfeng Shi, Anders Eriksson, Anton van den Hengel and Chunhua Shen|
|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.|
|Rights:||Copyright 2011 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
|hdl_67036.pdf||Accepted version||666.99 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.