The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2006 vol.28)
pp: 850-862
Jie Tian , IEEE
ABSTRACT
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.
INDEX TERMS
Fingerprint identification, ridge-based nearest neighborhood among minutiae, relative feature, minutia-simplex.
CITATION
Yuliang He, Jie Tian, Liang Li, Hong Chen, Xin Yang, "Fingerprint Matching Based on Global Comprehensive Similarity", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.28, no. 6, pp. 850-862, June 2006, doi:10.1109/TPAMI.2006.119
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool