Fingerprint identification using space invariant transforms
Pattern Recognition Letters
Efficient fingerprint matching algorithm for integrated circuit cards
Journal of Computer Science and Technology
Fingerprint matching using OrientationCodes and PolyLines
Pattern Recognition
Exploring fingerprint matching through a topology-based perspective
International Journal of Biometrics
A Novel Coding Scheme for Indexing Fingerprint Patterns
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Minutiae-based template synthesis and matching for fingerprint authentication
Computer Vision and Image Understanding
Vehicle localization by matching triangulated point patterns
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Personal authentication using hand vein triangulation and knuckle shape
IEEE Transactions on Image Processing
An FPGA implementation of the local global graph-based voice biometric authentication scheme
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
A multiple substructure matching algorithm for fingerprint verification
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Simultaneous latent fingerprint recognition
Applied Soft Computing
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
A combined radial basis function model for fingerprint distortion
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
Hybrid algorithm for fingerprint matching using delaunay triangulation and local binary patterns
CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Modified geometric hashing for face database indexing
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Fingerprint recognition based on minutes groups using directing attention algorithms
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Fingerprint matching with minutiae quality score
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
Fingerprint indexing with bad quality areas
Expert Systems with Applications: An International Journal
Indexing and retrieving in fingerprint databases under structural distortions
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
This paper presents a new indexing-based approach to fingerprint identification. Central to the proposed approach is the idea of associating a unique topological structure with the fingerprint minutiae using the Delaunay triangulation. This allows for choosing more "meaningful" minutiae groups (i.e., triangles) during indexing, preserves index selectivity, reduces memory requirements without sacrificing recognition accuracy, and improves recognition time. Specifically, assuming N minutiae per fingerprint on the average, the proposed approach considers only O(N) minutiae triangles during indexing or recognition. This compares favorably to O(N3), the number of triangles usually considered by other approaches, leading to significant memory savings and improved recognition time. Besides their small number, the minutiae triangles we used for indexing have good discrimination power since, among all possible minutiae triangles, they are the only ones satisfying the properties of the Delaunay triangulation. As a result, index selectivity is preserved and indexing can be implemented in a low-dimensional space. Some key characteristics of the Delaunay triangulation are (i) it is unique (assuming no degeneracies), (ii) can be computed efficiently in O(NlogN) time, and (iii) noise or distortions affect it only locally. The proposed approach has been tested on a database of 300 fingerprints (10 fingerprints from 30 persons), demonstrating good performance.