An automated matching technique for fingerprint identification

The purpose of this paper is to demonstrate how a structural matching approach can be used to perform effective rotational invariant fingerprint identification. In this approach, each of the extracted features is correlated with five of its nearest neighbouring features to form a local feature group for a first-stage matching. After that, the feature with the highest match is used as a central feature whereby all the other features are correlated to form a global feature group for a second-stage matching. The correlation between the features is in terms of distance and relative angle. This approach actually makes the matching method rotational invariant. A substantial amount of testing was carried out and it shows that this matching technique is capable of matching the four basic fingerprint patterns with an average matching time of 4 seconds on a 66 Mhz, 486 DX personal computer.

[1]  Safwat G. Zaky,et al.  Fingerprint identification using graph matching , 1986, Pattern Recognit..

[2]  Qinghan Xiao,et al.  Combining Statistical and Structural Information for Fingerprint Image Processing, Classification and identification , 1991, Pattern Recognition.

[3]  NABIL JEAN NACCACHE,et al.  An investigation into the skeletonization approach of hilditch , 1984, Pattern Recognit..

[4]  King-Sun Fu,et al.  A Tree System Approach for Fingerprint Pattern Recognition , 1976, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  James A. McHugh,et al.  Automated fingerprint recognition using structural matching , 1990, Pattern Recognit..

[6]  C. H. Kuo,et al.  A topology-based matching algorithm for fingerprint authentication , 1991, Proceedings. 25th Annual 1991 IEEE International Carnahan Conference on Security Technology.