Abstract
Biometrics authentication can be achieved by either verification or identification. In terms of convenience, identification are superior since a user does not have to input his/her ID number. However, it must be capable of searching the database storing user enrollment templates at high speed. To meet this need, we proposed an identification algorithm. In this paper, we describe our proposed method and discuss its characteristics of response speed using some simulation results. It is shown that response speed depends on the way to select enrollment data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kamei, T., Mizoguchi, M.: Fingerprint preselection using eigenfeatures. In: Proc. IEEE Computer Society Conference, Computer Vision and Pattern Recognition, pp. 918–923 (1998)
Germain, R.S., Califano, A., Colville, S.: Fingerprint matching using transformation parameter clustering. IEEE Computational Science and Engineering 4(4), 42–49 (1997)
Maeda, T., Matsushita, M., Sasakawa, K.: Identification algorithm using a matching score matrix. IEICE Trans. on Information and Systems E84-D(7), 819–824 (2001)
Shen, W.: Automated fingerprint pattern classification error analysis. Lect. Notes Computer Science, vol. 1351, pp. 24–31 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maeda, T., Matsushita, M., Sasakawa, K. (2004). Characteristics of the Identification Algorithm Using a Matching Score Matrix. In: Zhang, D., Jain, A.K. (eds) Biometric Authentication. ICBA 2004. Lecture Notes in Computer Science, vol 3072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25948-0_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-25948-0_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22146-3
Online ISBN: 978-3-540-25948-0
eBook Packages: Springer Book Archive