Fingerprint Minutiae Matching Algorithm using Distance Histogram of Neighborhood

  • Sharma, Neeraj (Division of Computer and Information Engineering, Dongseo University) ;
  • Lee, Joon-Jae (Department of Game and Mobile Contents, Keimyung University)
  • Published : 2007.12.30


Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.