Learning Compact Binary Codes for Hash-Based Fingerprint Indexing
- 9 April 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 10 (8) , 1603-1616
Abstract
Compact binary codes can in general improve the speed of searches in large-scale applications. Although fingerprint retrieval was studied extensively with real-valued features, only few strategies are available for search in Hamming space. In this paper, we propose a theoretical framework for systematically learning compact binary hash codes and develop an integrative approach to hash-based fingerprint indexing. Specifically, we build on the popular minutiae cylinder code (MCC) and are inspired by observing that the MCC bit-based representation is bit-correlated. Accordingly, we apply the theory of Markov random field to model bit correlations in MCC. This enables us to learn hash bits from a generalized linear model whose maximum likelihood estimates can be conveniently obtained using established algorithms. We further design a hierarchical fingerprint indexing scheme for binary hash codes. Under the new framework, the code length can be significantly reduced from 384 to 24 bits for each minutiae representation. Statistical experiments on public fingerprint databases demonstrate that our proposed approach can significantly improve the search accuracy of the benchmark MCC-based indexing scheme. The binary hash codes can achieve a significant search speedup compared with the MCC bit-based representation.Keywords
Funding Information
- HBKU Strategic Development Fund, Hong Kong Research Grants Council (HKBU211612, HKBU12202214)
- National Natural Science Foundation of China (61272366, 61403324)
This publication has 41 references indexed in Scilit:
- Fast Exact Search in Hamming Space With Multi-Index HashingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Learning Binary Hash Codes for Large-Scale Image Search2013
- A fingerprint retrieval system based on level-1 and level-2 featuresExpert Systems with Applications, 2012
- mvabund– an R package for model‐based analysis of multivariate abundance dataMethods in Ecology and Evolution, 2012
- Semantic hashingInternational Journal of Approximate Reasoning, 2009
- Indexing Multimodal Biometric Databases Using Kd-Tree with Feature Level Fusion2008
- Fingerprint indexing based on novel features of minutiae tripletsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- Multispace KL for pattern representation and classificationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Fingerprint matching using transformation parameter clusteringIEEE Computational Science and Engineering, 1997
- Geometric hashing: an overviewIEEE Computational Science and Engineering, 1997