Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Pose Estimation with Parameter-Sensitive Hashing
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Face recognition: A literature survey
ACM Computing Surveys (CSUR)
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Patch Based Blind Image Super Resolution
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Face Description with Local Binary Patterns: Application to Face Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face recognition from a single image per person: A survey
Pattern Recognition
Matching sets of features for efficient retrieval and recognition
Matching sets of features for efficient retrieval and recognition
Face recognition using HOG-EBGM
Pattern Recognition Letters
Local invariant feature detectors: a survey
Foundations and Trends® in Computer Graphics and Vision
A Viewpoint Invariant, Sparsely Registered, Patch Based, Face Verifier
International Journal of Computer Vision
A survey of approaches and challenges in 3D and multi-modal 3D+2D face recognition
Computer Vision and Image Understanding
PCA-SIFT: a more distinctive representation for local image descriptors
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
IEEE Transactions on Circuits and Systems for Video Technology
Robust re-identification using randomness and statistical learning: Quo vadis
Pattern Recognition Letters
Hi-index | 0.00 |
In this paper, we present Local Feature Hashing (LFH), a novel approach for face recognition. Focusing on the scalability of face recognition systems, we build our LFH algorithm on the p-stable distribution Locality-Sensitive Hashing (pLSH) scheme that projects a set of local features representing a query image to an ID histogram where the maximum bin is regarded as the recognized ID. Our extensive experiments on two publicly available databases demonstrate the advantages of our LFH method, including: i) significant computational improvement over naive search; ii) hashing in high-dimensional Euclidean space without embedding; and iii) robustness to pose, facial expression, illumination and partial occlusion.