Fast Fingerprint Retrieval Using Minutiae Neighbor Structure
This paper proposes a novel fingerprint identification system using minutiae neighborhood structure. First, we construct the nearest neighborhood for each minutia in the fingerprint. In the next step, we extract the features such as rotation invariant distances and orientation differences from the neighborhood structure. Then, we use these features to compute the index keys for each fingerprint. During identification of a query, a nearest neighbor algorithm is used to retrieve the best matches. Further, this approach enrolls the new fingerprints dynamically. This approach has been experimented on different benchmark Fingerprint Verification Competition (FVC) databases and the results are promising.
KeywordsMinutiae Quadruplet Nearest neighbors Indexing Identification Retrieval
- 2.Iloanusi, O., Gyaourova, A., Ross, A.: Indexing fingerprints using minutiae quadruplets. In: 2011 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pp. 127–133. IEEE (2011)Google Scholar
- 4.Jain, A.K., Ross, A.A., Nandakumar, K.: Fingerprint recognition. Introd. Biom. 51–96 (2011)Google Scholar
- 6.Kavati, I., Chenna, V., Prasad, M.V.N.K., Bhagvati, C.: Classification of extended delaunay triangulation for fingerprint indexing. In: 8th Asia Modelling Symposium (AMS), pp. 153–158. IEEE (2014)Google Scholar
- 7.Kavati, I., Prasad, M.V., Bhagvati, C.: Search space reduction in biometric databases: a review. In: Developing Next-Generation Countermeasures for Homeland Security Threat Prevention p. 236 (2016)Google Scholar
- 14.Wayman, J., Jain, A., Maltoni, D., Maio, D.: An introduction to biometric authentication systems. Biom. Syst. 1–20 (2005)Google Scholar