This paper proposes a new minutiae-based fingerprint matching algorithm using a variation of the Generalized Hough Transform called MGHT, which allows variations in translation, rotation, scale, and some distortions of the fingerprints, with very low complexity. A simple local structure of the fingerprint is constructed to collect template data from a number of minutiae. The matching process is performed by voting for transformation parameters by using target fingerprint local structure to look up similar data in the template. The result with a strong peak in the parameter space is considered as a match. The algorithm is efficient, precise, and robust to noise. The test results on several images demonstrate the effectiveness of this fingerprint matching method.
A Fingerprint Matching Scheme Based on Gradient Difference Compatibility
2007-04-01
7696768 byte
Conference paper
Electronic Resource
English
Alignment-Based Algorithm of Fingerprint Minutiae Matching
British Library Online Contents | 2005
|A Robust Fingerprint Matching Method
IEEE | 2005
|Compatibility Modelling for Graph Matching
British Library Conference Proceedings | 1994
|Fingerprint minutia matching algorithm based on ridge alignment
British Library Online Contents | 2008
|An adaptive hybrid energy-based fingerprint matching technique
British Library Online Contents | 2005
|