A Fingerprint Matching Algorithm Based On Delaunay Triangulation Net

Author

Liu, Ning ; Yin, Yilong ; Zhang, Hongwei

Author_Institution

Comput. Dept., Shandong Univ., Jinan

fYear

2005

fDate

21-23 Sept. 2005

Firstpage

591

Lastpage

595

Abstract

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

Keywords

computational geometry; fingerprint identification; pattern matching; Delaunay triangulation net; automatic fingerprint identification system; computational geometry; fingerprint matching algorithm; point pattern; reference minutiae pairs; template minutiae set; topological structure; Bifurcation; Biometrics; Computational geometry; Feature extraction; Fingerprint recognition; Focusing; Image enhancement; Image matching; Indexing; Pattern matching;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on

Conference_Location

Shanghai

Print_ISBN

0-7695-2432-X

Type

conf

DOI

10.1109/CIT.2005.9

Filename

1562717