An Efficient Technique for Online Iris Image Compression and Personal Identification

In this research article, an iris image compression and identification algorithm called Iris Image Compressor and Identifier is proposed which will convert the iris image of eye in the form of Laplace–Beltrami Spectra. Further, this Laplace–Beltrami Spectra will be converted into the form of Strakos matrix, and for these matrices the Eigen values are calculated which will be enough to identify a person. These Eigen values will be stored in the smart card memory for further identification and compression. Therefore, for checking whether two iris images are isometric or not, it is required to compare the first “n” Eigen values of the iris image spectra. If two iris images have the same Eigen values or same Riemannian Metrics values then it shows that both the irises are belonging to the same person. If two iris images have different Eigen values or different Riemannian Metrics values then it means that both the irises are belonging to different persons. We conducted the experiments for one hundred iris images of CASIA database. The robustness testing was conducted by modifying few pixels in specific regions and few pixels in overall image. But still the proposed method was able to identify individuals on the basis of their iris image patterns. The results of iris implementation reveal that the proposed method is an efficient and economically feasible.

[1]  D. Calvetti,et al.  AN IMPLICITLY RESTARTED LANCZOS METHOD FOR LARGE SYMMETRIC EIGENVALUE PROBLEMS , 1994 .

[2]  Okhwan Byeon,et al.  Efficient Iris Recognition through Improvement of Feature Vector and Classifier , 2001 .

[3]  Niklas Peinecke,et al.  Laplace-spectra as fingerprints for shape matching , 2005, SPM '05.

[4]  R. P. Wildes Iris recognition : An emerging biometric technology : Automated biometrics , 1997 .

[5]  Z. Strakos,et al.  On the real convergence rate of the conjugate gradient method , 1991 .

[6]  Darko Kirovski,et al.  Iris compression for cryptographically secure person identification , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[7]  J. Cullum,et al.  Lanczos Algorithms for Large Symmetric Eigenvalue Computations Vol. I Theory , 1984 .

[8]  Niklas Peinecke,et al.  Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids , 2006, Comput. Aided Des..

[9]  Kamta Nath Mishra An efficient Laplace-Beltrami Spectra based technique for online iris image compression and identification , 2016, 2016 International Conference on Control, Computing, Communication and Materials (ICCCCM).

[10]  Lionel Torres,et al.  Person Identification Technique Using Human Iris Recognition , 2002 .

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

[12]  Tieniu Tan,et al.  Iris recognition using circular symmetric filters , 2002, Object recognition supported by user interaction for service robots.

[13]  Craig Gotsman,et al.  Spectral compression of mesh geometry , 2000, EuroCG.

[14]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[15]  Vivek Tiwari,et al.  Energy-based active contour method for image segmentation , 2017, Int. J. Electron. Heal..

[16]  Richard P. Wildes,et al.  Iris recognition: an emerging biometric technology , 1997, Proc. IEEE.

[17]  Jack J. Dongarra,et al.  A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures , 1999, SIAM J. Sci. Comput..

[18]  C. Paige Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem , 1980 .