By Topic

Fingerprint matching based on global comprehensive similarity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yuliang He ; Inst. of Autom., Chinese Acad. of Sci., Beijing, China ; Jie Tian ; Liang Li ; Hong Chen
more authors

This paper introduces a novel algorithm based on global comprehensive similarity with three steps. To describe the Euclidean space-based relative features among minutiae, we first build a minutia-simplex that contains a pair of minutiae as well as their associated textures, with its transformation-variant and invariant relative features employed for the comprehensive similarity measurement and parameter estimation, respectively. By the second step, we use the ridge-based nearest neighborhood among minutiae to represent the ridge-based relative features among minutiae. With these ridge-based relative features, minutiae are grouped according to their affinity with a ridge. The Euclidean space-based and ridge-based relative features among minutiae reinforce each other in the representation of a fingerprint. Finally, we model the relationship between transformation and the comprehensive similarity between two fingerprints in terms of histogram for initial parameter estimation. Through these steps, our experiment shows that the method mentioned above is both effective and suitable for limited memory AFIS owing to its less than 1k byte template size.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:28 ,  Issue: 6 )