Local feature based retrieval approach for iris biometrics

Abstract

This paper proposes an efficient retrieval approach for iris using local features. The features are extracted from segmented iris image using scale invariant feature transform (SIFT). The keypoint descriptors extracted from SIFT are clustered into m groups using k-means. The idea is to perform indexing of keypoints based on descriptor property. During database indexing phase, k-d tree k-dimensional tree is constructed for each cluster center taken from N iris images. Thus for m clusters, m such k-d trees are generated denoted as t_i, where 1≤i ≤m. During the retrieval phase, the keypoint descriptors from probe iris image are clustered into m groups and ith cluster center is used to traverse corresponding t_i for searching. k nearest neighbor approach is used, which finds p neighbors from each tree (t_i) that falls within certain radius r centered on the probe point in k-dimensional space. Finally, p neighbors from m trees are combined using union operation and top S matches (S ⊆ (m× p)) corresponding to query iris image are retrieved. The proposed approach has been tested on publicly available databases and outperforms the existing approaches in terms of speed and accuracy.

Keywords

Indexing / SIFT / k-means / k-d tree / k nearest neighbors / iris / biometrics

References

[1] Daugman J. The importance of being random: statistical principles of iris recognition. Pattern Recognition, 2003, 36(2): 279−291

[2] Daugman J. How iris recognition works. IEEE Transactions on Circuits and Systems for Video Technology, 2004, 14(1): 21−30

[3] Li S Z, Jain A K, eds. . Encyclopedia of Biometrics. Springer US, 2009

[4] . Unique Identification Authority of India.

[5] Iris Recognition Immigration System (IRIS).

[6] Mhatre A, Chikkerur S, Govindaraju V. Indexing biometric databases using pyramid technique. In: Proceedings of the 5th International Conference on Audio-and Video-Based Biometric Person Authentication. 2005, 841−849

[7] Yu L, Zhang D, Wang K, Yang W. Coarse iris classification using boxcounting to estimate fractal dimensions. Pattern Recognition, 2005, 38(11): 1791−1798

[8] Qiu X, Sun Z, Tan T. Global texture analysis of iris images for ethnic classification. In: Advances in Biometrics. 2005, 411−418

[9] Qiu X, Sun Z, Tan T. Coarse iris classification by learned visual dictionary. In: Proceedings of the 2007 International Conference on Advances in Biometrics. 2007, 770−779

[10] Gyaourova A, Ross A. Index codes for multibiometric pattern retrieval. IEEE Transactions on Information Forensics and Security, 2012, 7(2): 518−529

[11] Mhatre A, Palla S, Chikkerur S, Govindaraju V. Efficient search and retrieval in biometric databases. In: Proceedings of Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 2005, 265−273

[12] Jayaraman U, Prakash S, Gupta P. Indexing multimodal biometric databases using Kd-tree with feature level fusion. In: Proceedings of the 4th International Conference on Information Systems Security. 2008, 221−234

[13] Jayaraman U, Prakash S, Gupta P. Use of geometric features of prince pal components for indexing a biometric database. Mathematical and Computer Modelling, 2012 (in press)

[14] Munoz-Briseno A, Gago-Alonso A, Hernandez-Palancar J. . Fingerprint indexing with bad quality areas. Expert Systems with Applications, 2013, 40(5): 1839−1846

[15] Feng H, Daugman J, Zielinski P. A fast search algorithm for a large fuzzy database. IEEE Transactions on Information Forensics and Security, 2008, 3(2): 203−212

[16] Mukherjee R, Ross A. Indexing iris images. In: Proceedings of the 19th International Conference on Pattern Recognition. 2008, 1−4

[17] Puhan N, Sudha N. A novel iris database indexing method using the iris color. In: Proceedings of the 3rd IEEE Conference on Industrial Electronics and Applications. 2008, 1886−1891

[18] Mehrotra H, Srinivas B, Majhi B, Gupta P. Indexing iris biometric database using energy histogram of DCT subbands. In: Proceedings of the 2009 International Conference on Contemporary Computing. 2009, 194−204

[19] Gadde R, Adjeroh D, Ross A. Indexing iris images using the Burrows-Wheeler Transform. In: Proceedings of the 2010 IEEE International Workshop on Information Forensics and Security. 2010, 1−6

[20] Rathgeb C, Uh l A. Iris-biometric hash generation for biometric database indexing. In: Proceedings of the 2010 International Conference on Pattern Recognition. 2010, 2848−2851

[21] Dey S, Samanta D. Iris data indexing method using gabor energy features. IEEE Transactions on Information Forensics and Security, 2012, 7(4): 1192−1203

[22] Mehrotra H, Majhi B, Gupta P. Robust iris indexing scheme using geometric hashing of SIFT keypoints. Journal of Network and Computer Applications, 2010, 33(3): 300−313

[23] Wolfson H, Rigoutsos I. Geometric hashing: an overview. IEEE Computational Science Engineering, 1997, 4(4): 10−21

[24] Lowe D. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 2004, 60(2): 91−110

[25] Jayaraman U, Prakash S, Gupta P. . An efficient color and texture based iris image retrieval technique. Expert Systems with Applications, 2012, 39(5): 4915−4926

[26] Bay H, Ess A, Tuytelaars T, . Van Gool L. Speeded-up robust features (SURF). Computer Vision and Image Understanding, 2008, 110(3): 346−359

[27] Bowyer K, Hollingsworth K, Flynn P. Image understanding for iris biometrics: A survey. Computer Vision and Image Understanding, 2008, 110: 281−307

[28] Proenca H, Alexandre L. Iris recognition: An analysis of the aliasing problem in the iris normalization stage. In: Proceedings of the 2006 International Conference on Computational Intelligence and Security. 2006, 1771−1774

[29] Panda A, Mehrotra H, Majhi B. Parallel geometric hashing for robust iris indexing. Journal of Real-Time Image Processing, 2011, 1−9

[30] Bakshi S, Mehrotra H, Majhi B. Real-time iris segmentation based on image morphology. In: Proceedings of the 2011 International Conference on Communication, Computing & Security. 2011, 335−338

[31] Bentley J. Multidimensional binary search trees used for associative searching. Communications of the ACM, 1975, 18(9): 509−517

[32] Friedman J H, Bentley J L, Finkel R A. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 1977, 3: 209−226

[33] Blum M, Floyd R, Pratt V, Rivest R, Tarjan R. Time bounds for selection. Journal of Computer and System Sciences, 1973, 7(4): 448−461

[34] BATH University Database.

[35] CASIA Database.

[36] Jain A, Flynn P, Ross A A. Handbook of Biometrics. Springer-Verlag New York, Inc., 2007

[37] Wayman J L. Error rate equations for the general biometric system. IEEE Robotics and Automation Magazine, 1999, 6(1): 35−48

RIGHTS & PERMISSIONS

2013 Higher Education Press and Springer-Verlag Berlin Heidelberg