Fingerprint Matching Algorithm using String-Based MHC Detector Set

Fingerprints have been widely used in the biometric authentication because of its performance, uniqueness and universality. Lately, the speed of identification has become a very important aspect in the fingerprint-based security applications. Also, the reliability still remains the main issue in the fingerprint identification. A fast and reliable fingerprint matching algorithm based on the process of the 'self-nonself' discrimination in the biological immune system was proposed. The proposed algorithm is organized by two-matching stages. The 1st matching stage utilized the self-space and MHC detector string set that are generated from the information of the minutiae and the values of the directional field. The 2nd matching stage was made based on the local-structure of the minutiae. The proposed matching algorithm reduces matching time while maintaining the reliability of the matching algorithm.

[1]  Nalini K. Ratha,et al.  Biometric perils and patches , 2002, Pattern Recognit..

[2]  Alessandro Farina,et al.  Fingerprint minutiae extraction from skeletonized binary images , 1999, Pattern Recognit..

[3]  Arun Ross,et al.  A hybrid fingerprint matcher , 2003, Pattern Recognit..