Local feature Hashing for face recognition

Zhihong Zeng, Tianhong Fang, Shishir Shah, Ioannis A. Kakadiaris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationIEEE 3rd International Conference on Biometrics
Subtitle of host publicationTheory, Applications and Systems, BTAS 2009
DOIs
StatePublished - 2009
EventIEEE 3rd International Conference on Biometrics: Theory, Applications and Systems, BTAS 2009 - Washington, DC, United States
Duration: Sep 28 2009Sep 30 2009

Publication series

NameIEEE 3rd International Conference on Biometrics: Theory, Applications and Systems, BTAS 2009

Conference

ConferenceIEEE 3rd International Conference on Biometrics: Theory, Applications and Systems, BTAS 2009
Country/TerritoryUnited States
CityWashington, DC
Period9/28/099/30/09

ASJC Scopus subject areas

  • Biotechnology
  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Local feature Hashing for face recognition'. Together they form a unique fingerprint.

Cite this