z-logo
open-access-imgOpen Access
An efficient ANN Based approach for Latent Fingerprint Matching
Author(s) -
Jugal Kishor Gupta,
Rajendra Kumar
Publication year - 2010
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/1285-1706
Subject(s) - computer science , fingerprint (computing) , matching (statistics) , artificial intelligence , data mining , pattern recognition (psychology) , machine learning , statistics , mathematics
matching is the process used to determine whether two sets of fingerprint ridge detail come from the same finger. There exist multiple algorithms that do fingerprint matching in many different ways. Some methods involve matching minutiae points between the two images, while others look for similarities in the bigger structure of the fingerprint. A major approach for fingerprint recognition today is to extract minutiae from fingerprint images and to perform fingerprint matching based on the number of corresponding minutiae pairings. One of the most difficult problems in fingerprint recognition has been that the recognition performance is significantly influenced by fingertip surface condition, which may vary depending on environmental or personal causes. In this paper we propose a method for offline fingerprint matching based on minutiae matching. However, unlike conventional minutiae matching algorithms, our algorithm also takes into account region and line structures that exist between minutiae pairs. This allows filling the small breaks in the curves created because of uneven surface and uneven pressure.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom