HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Partial Least Squares for Face Hashing

Abstract : Face identification is an important research topic due to areas such as its application to surveillance, forensics and human-computer interaction. In the past few years, a myriad of methods for face identification has been proposed in the literature, with just a few among them focusing on scalability. In this work, we propose a simple but efficient approach for scalable face identification based on partial least squares (PLS) and random independent hash functions inspired by locality-sensitive hashing (LSH), resulting in the PLS for hashing (PLSH) approach. The original PLSH approach is further extended using feature selection to reduce the computational cost to evaluate the PLS-based hash functions, resulting in the state-of-the-art extended PLSH approach (ePLSH). The proposed approach is evaluated in the dataset FERET and in the dataset FRGCv1. The results show significant reduction in the number of subjects evaluated in the face identification (reduced to 0.3% of the gallery), providing averaged speedups up to 233 times compared to evaluating all subjects in the face gallery and 58 times compared to previous works in the literature.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

Contributor : Guillaume Gravier Connect in order to contact the contributor
Submitted on : Sunday, November 20, 2016 - 1:29:50 PM
Last modification on : Wednesday, February 2, 2022 - 3:57:55 PM
Long-term archiving on: : Monday, March 27, 2017 - 9:30:45 AM


Files produced by the author(s)



Cassio dos Santos, Ewa Kijak, William Robson Schwartz, Guillaume Gravier. Partial Least Squares for Face Hashing. Neurocomputing, Elsevier, 2016, 213, pp.34-47. ⟨10.1016/j.neucom.2016.02.083⟩. ⟨hal-01399660⟩



Record views


Files downloads