Synonyms
Definition
Hashing is the process of compressing a given input real-valued feature representation into a binary code of a relatively small number of bits. For the application of face search with deep features, it corresponds to encoding a feature extracted from a deep learning-based face recognition model into a binary representation with the goal of maintaining most of the retrieval ability of the original representation.
Background
The state-of-the-art face recognition methods represent a face image as a high-dimensional real-valued feature, obtained using a deep network. However, comparisons of this high-dimensional feature can be computationally expensive. Furthermore, when dealing with large face images database, this representation can lead to prohibitive storage requirements. Thus, the goal of hashing for face search is mainly to:
Lower the memory consumption: hashing is a way to produce a compact representation, and thus a larger face...
This is a preview of subscription content, log in via an institution to check access.
References
Wang J, Liu W, Kumar S, Chang SF (2016) Learning to hash for indexing big data—a survey. Proc IEEE 104(1):34–57
Karaman S, Chang SF (2019) Hashing a Face. In: Ratha N, Chellapa R, Patel V (eds) Deep learning based face analytics, chap 1. Cambridge University Press, Cambridge, pp 1–1, in press
Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on theory of computing. ACM, pp 604–613
Gong Y, Lazebnik S, Gordo A, Perronnin F (2013) Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans Pattern Anal Mach Intell 35(12):2916–2929
Park Y, Cafarella M, Mozafari B (2015) Neighbor-sensitive hashing. Proc VLDB Endowment 9(3):144–155
Heo JP, Lee Y, He J, Chang SF, Yoon SE (2015) Spherical hashing: binary code embedding with hyperspheres. IEEE Trans Pattern Anal Mach Intell 37(11):2304–2316
Karaman S, Lin X, Hu X, Chang SF (2019) Unsupervised rank-preserving hashing for large-scale retrieval. In: International conference on multimedia retrieval (ICMR’19)
Maze B, Adams J, Duncan JA, Kalka N, Miller T, Otto C, Jain AK, Niggel WT, Anderson J, Cheney J et al (2018) Iarpa janus benchmark–c: face dataset and protocol. In: 11th IAPR international conference on biometrics
Bansal A, Nanduri A, Castillo CD, Ranjan R, Chellappa R (2016) Umdfaces: an annotated face dataset for training deep networks. Tech. rep.
Ranjan R, Bansal A, Xu H, Sankaranarayanan S, Chen JC, Castillo CD, Chellappa R (2018) Crystal loss and quality pooling for unconstrained face verification and recognition. arXiv preprint arXiv:180401159
Sankaranarayanan S, Alavi A, Castillo CD, Chellappa R (2016) Triplet probabilistic embedding for face verification and clustering. In: IEEE 8th international conference on biometrics theory, applications and systems (BTAS), IEEE, pp 1–8
Malkov YA, Yashunin DA (2018) Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans Pattern Anal Mach Intell. https://doi.org/10.1109/TPAMI.2018.2889473
Author information
Authors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this entry
Cite this entry
Karaman, S., Chang, SF. (2020). Hashing for Face Search. In: Computer Vision. Springer, Cham. https://doi.org/10.1007/978-3-030-03243-2_817-1
Download citation
DOI: https://doi.org/10.1007/978-3-030-03243-2_817-1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03243-2
Online ISBN: 978-3-030-03243-2
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering