Open AccessFast pore matching method based on deterministic annealing algorithm
Author(s) -
Lu Guangming,
Xu Yuanrong
Publication year - 2017
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2017.0138
Subject(s) - minutiae , fingerprint (computing) , computer science , simulated annealing , matching (statistics) , convex hull , fingerprint recognition , algorithm , artificial intelligence , blossom algorithm , pattern recognition (psychology) , identification (biology) , regular polygon , mathematics , statistics , botany , geometry , biology
High‐resolution fingerprint identification system (HRFIS) has become a hot topic in the field of academic research. Compared to traditional automatic fingerprint identification system, HRFIS reduces the risk of being faked by using level 3 features, such as pores, which cannot be detected in lower resolution images. However, there is a serious problem in HRFIS: there are hundreds of sweat pores in one fingerprint image, which will spend a considerable amount of time for direct fingerprint matching. The authors propose a method to match pores in two fingerprint images based on deterministic annealing algorithm. In this method, fingerprints are aligned using singular points. Then minutiae are matched based on the alignment result. To reduce the impact of deformation, they build a convex hull for each of these fingerprints. Pores in these convex hulls are used for matching. In the experiments, their method is compared with random sample consensus method, minutia and ICP‐based method, and direct pore matching method. The results show that the proposed method is more efficient.