DocumentCode :
2997959
Title :
Fingerprints as Spatial Graphs: Nodes and Edges
Author :
Horadam, K.J. ; Davis, S.A. ; Arakala, A. ; Jeffers, J.
Author_Institution :
Sch. of Math. & Geospatial Sci., RMIT Univ., Melbourne, VIC, Australia
fYear :
2011
fDate :
6-8 Dec. 2011
Firstpage :
400
Lastpage :
405
Abstract :
Point-pattern matching of minutiae is the most common method used in fingerprint biometrics, but it is generally insufficient by itself. It has particular limitations in matching partial prints or in secure (biocryptographic) matching. Here, we add structure with a new spatial graph represention of a fingerprint, with minutiae as nodes. Using a sample of fingerprint graphs extracted from the FVC2002 database, we show that matching fingerprints using only the edges of the graphs performs almost as well as using only the nodes. Combinations of edges and nodes have superior performance to either individual score.
Keywords :
cryptography; fingerprint identification; graph theory; pattern matching; biocryptographic matching; fingerprint biometrics; point-pattern matching; secure matching; spatial graph represention; Bifurcation; Databases; Feature extraction; Fingerprint recognition; Image edge detection; Manuals; Pattern matching; edge matching; fingerprint biometric; fingerprint graph; minutiae matching; score fusion; structural matching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Digital Image Computing Techniques and Applications (DICTA), 2011 International Conference on
Conference_Location :
Noosa, QLD
Print_ISBN :
978-1-4577-2006-2
Type :
conf
DOI :
10.1109/DICTA.2011.74
Filename :
6128648
Link To Document :
بازگشت