Abstract
With the emerging trend of incorporating biometrics information in e-financial and e-government systems arisen from international efforts in anti-money laundering and counter-terrorism, biometric identification is gaining increasing importance as a component in information security applications. Recently, fingercode has been demonstrated to be an effective fingerprint biometric scheme, which can capture both local and global details in a fingerprint. In this paper, we formulate fingercode identification as a vector quantization (VQ) problem, and propose an efficient algorithm for fingercode-based biometric identification. Given a fingercode of the user, the algorithm aims to efficiently find, among all fingercodes in the database of registered users, the one with minimum Euclidean distance from the user’s fingercode. Our algorithm is based on a new VQ technique which is designed to address the special needs of fingercode identification. Experimental results on DB1 of FVC 2004 demonstrate that our algorithm can outperform the full search algorithm, the partial distance search algorithm and the 2-pixel-merging sum pyramid based search algorithm for fingercode-based identification in terms of computation efficiency without sacrificing accuracy and storage.
Keywords
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11915034_125.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jain, A.K., Prabhakar, S., Hong, L., Pankanti, S.: Filterbank-based fingerprint matching. IEEE Trans. on Image Processing 9(5), 846–859 (2000)
Linde, Y., Buzo, A., Gray, R.M.: An algorithm for vector quantizer design. IEEE Trans. on Comm. 28(1), 84–95 (1980)
Nasrabadi, N.M., King, R.A.: Image coding using vector quantization: a review. IEEE Trans. on Comm. 36(8), 957–971 (1988)
Bei, C., Gray, R.M.: An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization. IEEE Trans. on Comm. 33(10), 1132–1133 (1985)
Pan, Z., Kotani, K., Ohmi, T.: Improved fast encoding method for vector quantization based on subvector technique. In: 2005 IEEE International Symposium on Circuits and Systems, pp. 6332–6335 (2005)
Pan, Z., Kotani, K., Ohmi, T.: A memory-efficient fast encoding method for vector quantization using 2-pixel-merging sum pyramid. In: 2004 IEEE Int’l. Conf. on Acoustics, Speech and Signal Processing, vol. 3, pp. 669–672 (2004)
Jiang, X.D., Liu, M.H., Kot, A.C.C.: Reference Point Detection for Fingerprint Recognition. In: The 17th Int’l. Conf. on Pattern Recognition, vol. 1, pp. 540–543 (2004)
FVC 2004. The 3rd International Fingerprint Verification Competition, http://bias.csr.unibo.it/fvc2004/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, HW., Lam, KY., Gu, M., Sun, JG. (2006). An Efficient Algorithm for Fingercode-Based Biometric Identification. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops. OTM 2006. Lecture Notes in Computer Science, vol 4277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11915034_70
Download citation
DOI: https://doi.org/10.1007/11915034_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48269-7
Online ISBN: 978-3-540-48272-7
eBook Packages: Computer ScienceComputer Science (R0)