loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
A Fingerprint Matching Algorithm Based On Delaunay Triangulation Net
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
Ning Liu, Shandong University
Yilong Yin, Shandong University
Hongwei Zhang, Shandong University

Fingerprint matching is a key issue in research of an automatic fingerprint identification system. On the basis of Delaunay triangulation (DT) in computational geometry, we proposed a fingerprint matching algorithm based on DT net in this paper. It uses DT in fingerprint matching, and then develops a matching algorithm based on DT net to find reference minutiae pairs (RMPs). Using DT on the topological structure of minutiae set, a DT net is formed with minutiae as vertexes. From the nets of the input minutiae set and template minutiae set, select out a certain pairs of minutiae which have similar structures as RMPs for aligning, and matching is carried out based on point pattern. The experiment is conducted on FVC2002, and the result indicates the validity of our algorithm.

Citation:
Ning Liu, Yilong Yin, Hongwei Zhang, "A Fingerprint Matching Algorithm Based On Delaunay Triangulation Net," cit, pp.591-595, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.