Fingerprint minutiae matching algorithm sorted regional information gradient approach

Abstract

This paper presents a non-core based fingerprint minutiae matching algorithm that has been implemented and tested in simulation. Fingerprint matching is the decision making part of a fingerprint identification system and thus it must be reliable and efficient enough to be used in a real-time application. A non-core based fingerprint minutiae matching algorithm is used because it eliminates the strenuous process of aligning the fingerprints to be matched, does not run the risk of selecting a false core point and carries the potential to cater for almost all the inconsistencies in the representation of the fingerprint data. The algorithm presented in this project takes care of most of these inconsistencies: translation, rotation, missing points, additional points and noise. The algorithm presented is tested to be reliable and the computational complexity of the algorithm is O(n2k) that makes it very desirable to be used in real-time fingerprint matching applications.