Rapid Face Recognition Using Hashing
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.
Cite
Text
Shi et al. "Rapid Face Recognition Using Hashing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2010. doi:10.1109/CVPR.2010.5540001Markdown
[Shi et al. "Rapid Face Recognition Using Hashing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2010.](https://mlanthology.org/cvpr/2010/shi2010cvpr-rapid/) doi:10.1109/CVPR.2010.5540001BibTeX
@inproceedings{shi2010cvpr-rapid,
title = {{Rapid Face Recognition Using Hashing}},
author = {Shi, Qinfeng and Li, Hanxi and Shen, Chunhua},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2010},
pages = {2753-2760},
doi = {10.1109/CVPR.2010.5540001},
url = {https://mlanthology.org/cvpr/2010/shi2010cvpr-rapid/}
}