Fingerprint Matching Based on Inter-minutiae Constraint Network

This paper presents a new fingerprint matching algorithm based on inter-minutiae relational network. This latter is represented by constraint graph (binary CSP graph) which uses, in addition to distances between minutiae, ridge counts and the relative ridge count angles according to the both minutiae pair orientations. Therefore, the resulting minutiae features are invariant to the geometric transformation and the matching process does not require an implicit alignment of the two fingerprint images. The main advantage of our approach is that it can be used for partial fingerprints. Finally, we report the results of testing our method on the public fingerprint databases DB1 and DB2 FVC2002