Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Rapid face recognition using hashing|
|Citation:||Proceedings of 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2010; pp.2753-2760|
|Conference Name:||IEEE Conference on Computer Vision and Pattern Recognition (23rd : 2010 : San Francisco, CA)|
|Qinfeng Shi, Hanxi Li, Chunhua Shen|
|Abstract:||We propose a face recognition approach based on hashing. The approach yields comparable recognition rates with the random ℓ1 approach, which is considered the state-of-the-art. But our method is much faster: it is up to 150 times faster than on the YaleB dataset. We show that with hashing, the sparse representation can be recovered with a high probability because hashing preserves the restrictive isometry property. Moreover, we present a theoretical analysis on the recognition rate of the proposed hashing approach. Experiments show a very competitive recognition rate and significant speedup compared with the state-of-the-art.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.