research-article

Study on thresholding operation for efficient 1:N matching scheme of fingerprint identification

Authors:

Young-Jin Goh,

Buhm Lee,

Kyoung-Min KimAuthors Info & Claims

ICSCA '17: Proceedings of the 6th International Conference on Software and Computer Applications

Pages 122 - 126

https://doi.org/10.1145/3056662.3056703

Published: 26 February 2017 Publication History

Get Access

Abstract

Usually, in the minutiae-based matching scheme, fingerprint matching score could be calculated by analyzing geometrical similarity between minutiae from two fingerprints. To calculate the geometrical similarity between them, it is necessary to previously align a fingerprint data with the other one. The final matching score is obtained by bidirectional matching in the common fingerprint matching scheme, because the similarity between two fingerprints varies with the result of alignments. The reliability of matching score by the bidirectional matching is better than by the unidirectional matching, but, it takes two times comparing with unidirectional matching. To solve the problem, this paper proposes an efficient 1:N fingerprint matching scheme based on the distribution of bidirectional matching scores for the large fingerprints database. The experimental result shows the usefulness of the proposed scheme.

References

[1]

Jain A.K., Bolle R., and Pankaniti S. (Eds). 1998. Biometrics, Personal Identification in Networked Society. Kluwer Academic Publishers Norwell, MA.

Digital Library

Google Scholar

[2]

Ratha N.K., Chen S.Y., and Jain A.K. 1995. Adaptive Flow Orientation-Based Feature Extraction in Fingerprint Images. Pattern Recognition. 28. 11 (Nov. 1995), 1657--1672.

Google Scholar

[3]

Arcelli C. and Baja G.S.D. 2009. A Width Independent Fast Thinning Algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence. PAMI-7. 4(Jan. 2009), 463--474.

Digital Library

Google Scholar

[4]

Maltoni D., Maio D., Jain A.K., and Prabhakar S. 2009. Handbook of Fingerprint Recognition. Springer Publishing Company, Inc,.

Digital Library

Google Scholar

[5]

Ranade A. and Rosenfeld A. 1979. Point Pattern Matching by Relaxation. Pattern Recognition. 12. 4(Dec. 1979), 269--275.

Google Scholar

[6]

Z. Wu. 2002. Fingerprint Recognition. Ph. D. Dissertation, Hong Kong Baptist University.

Google Scholar

[7]

S. W. Jung. 2008. Efficient 1:N Matching Scheme for Fingerprint Identification. The Institute of Electronics Engineers of Korea - Computer and Information. 45. 5 (Sept.2008), 173--179.

Google Scholar

[8]

K. M. Kim, J. J. Park, B. Lee, Y. J. Go and S. W. Jung. 2012. Efficient 1:N Fingerprint Matching Algorithm using Matching Score Distribution. Institute of Control, Robotics and System. 18.3 (Mar. 2012), 208--217.

Google Scholar

Index Terms

Study on thresholding operation for efficient 1:N matching scheme of fingerprint identification
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Computer vision problems
        Matching
        Object identification

Recommendations

Fingerprint matching using ridges

Traditionally, fingerprint matching is minutia-based, which establishes the minutiae correspondences between two fingerprints. In this paper, a novel fingerprint matching algorithm is presented, which establishes both the ridge correspondences and the ...
Fingerprint Feature-Point Matching Based on Motion Coherence
FITME '09: Proceedings of the 2009 Second International Conference on Future Information Technology and Management Engineering

Fingerprint matching is very important for automatic fingerprint recognition system (AFIS). After local structure matching, one minutia in query fingerprint may have multiple candidate matching minutiae in template fingerprint. So how to get right one-...
Latent Fingerprint Matching

Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICSCA '17: Proceedings of the 6th International Conference on Software and Computer Applications

February 2017

339 pages

ISBN:9781450348577

DOI:10.1145/3056662

Conference Chairs:
Vitaliy Mezhuyev
Universiti Malaysia Pahang, Malaysia
,
Luigi Benedicenti
University of Regina, Canada

© 2017 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 February 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICSCA 2017

ICSCA 2017: 2017 6th International Conference on Software and Computer Applications

February 26 - 28, 2017

Bangkok, Thailand

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
48
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Fingerprint matching using ridges

Fingerprint Feature-Point Matching Based on Motion Coherence

Latent Fingerprint Matching