The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fingerprint Verification System Based on Triangular Matching and Dynamic Time Warping
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Intrinsic Coordinate System for Fingerprint Matching
AVBPA '01 Proceedings of the Third International Conference on Audio- and Video-Based Biometric Person Authentication
Handbook of Fingerprint Recognition
Handbook of Fingerprint Recognition
FVC2002: Second Fingerprint Verification Competition
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Fingerprint Matching Using an Orientation-Based Minutia Descriptor
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fingerprint matching combining the global orientation field with minutia
Pattern Recognition Letters
Minutiae-based partial fingerprint recognition
Minutiae-based partial fingerprint recognition
Local and global tree graph structures for fingerprint verification
SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
Rapid and brief communication: Two-class fingerprint matcher
Pattern Recognition
Fingerprint matching from minutiae texture maps
Pattern Recognition
An adaptive hybrid energy-based fingerprint matching technique
Image and Vision Computing
A deformable model for fingerprint matching
Pattern Recognition
A robust fingerprint matching method
Pattern Recognition
A minutia-based partial fingerprint recognition system
Pattern Recognition
K-plet and coupled BFS: a graph based fingerprint representation and matching algorithm
ICB'06 Proceedings of the 2006 international conference on Advances in Biometrics
| Hi-index | 0.00 |
The main aim of this paper is to describe an inter-minutiae binary network-based global matching algorithm. It exploits absolute minutiae features represented by a binary constraint graph. A dynamic tolerance area in the neighborhood of the minutiae combined with the search-rearrangement method on the binary constraint graph is used to perform the global matching. Tests on the public fingerprint databases DB1 and DB2 FVC2002 showed that our approach outperforms those based on the forward tracking search only. The most relevant aspect of this algorithm is that it does not require implicit alignment of the two fingerprint images due to the strong dependencies between minutiae described by the constraint graph.