Use of geometric features of principal components for indexing a biometric database

Abstract Financial inclusion is the delivery of financial services at affordable cost to sections of disadvantaged and low income segments of society. It has several leakages such as security threats and transaction frauds in the available system. The use of biometrics in the financial inclusion is a near perfect solution to such security threats. Such a biometric system should be fast enough to recognise/identify a subject from a large database. This paper proposes an indexing technique for a biometric database consisting of variable number of features with high dimensions. The technique makes use of geometric properties of principal components of features. Unlike existing indexing techniques, it inserts fewer features into a hash table. It reduces both computational and memory costs significantly. The geometric properties of principal components of features are found to be robust to handle translation and rotation effects. The proposed technique has been tested on palmprint biometric databases viz. PolyU  [25] , CASIA  [26] and IITK which have 7752, 5239 and 549 images respectively. It is found to be more efficient than any other existing indexing techniques.

[1]  Karl Pearson F.R.S. LIII. On lines and planes of closest fit to systems of points in space , 1901 .

[2]  Narendra Ahuja,et al.  Dot Pattern Processing Using Voronoi Neighborhoods , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Haim J. Wolfson,et al.  Model-Based Object Recognition by Geometric Hashing , 1990, ECCV.

[4]  Phalguni Gupta,et al.  Verification system robust to occlusion using low-order Zernike moments of palmprint sub-images , 2011, Telecommun. Syst..

[5]  Anil K. Jain,et al.  On-line fingerprint verification , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[6]  Rafael C. González,et al.  Digital image processing using MATLAB , 2006 .

[7]  Phalguni Gupta,et al.  Robust iris indexing scheme using geometric hashing of SIFT keypoints , 2010, J. Netw. Comput. Appl..

[8]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[9]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[10]  Günter Rote,et al.  Upper and Lower Bounds on the Quality of the PCA Bounding Boxes , 2006 .

[11]  I. Rigoutsos,et al.  Implementation of geometric hashing on the Connection Machine , 1991, [1991 Proceedings] Workshop on Directions in Automated CAD-Based Vision.

[12]  Paul A. Viola,et al.  Rapid object detection using a boosted cascade of simple features , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[13]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[14]  Michael Lindenbaum,et al.  Some trade-offs and a new algorithm for geometric hashing , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[15]  Bir Bhanu,et al.  Fingerprint Indexing Based on Novel Features of Minutiae Triplets , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Ana Cristina Murillo,et al.  SURF features for efficient robot localization with omnidirectional images , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[17]  I. Jolliffe Principal Component Analysis , 2002 .

[18]  Phalguni Gupta,et al.  An Enhanced Geometric Hashing , 2011, 2011 IEEE International Conference on Communications (ICC).

[19]  Alex Pentland,et al.  Face recognition using eigenfaces , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[20]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[21]  Robert S. Germain,et al.  Fingerprint matching using transformation parameter clustering , 1997 .

[22]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..

[23]  C. Schmid,et al.  Scale-invariant shape features for recognition of object categories , 2004, CVPR 2004.

[24]  Sumantra Dutta Roy,et al.  Fast and Robust Projective Matching for Fingerprints Using Geometric Hashing , 2004, ICVGIP.

[25]  Pierre Baldi,et al.  Neural Networks for Fingerprint Recognition , 1993, Neural Computation.