LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Hu, Yang; Sirlantzis, Konstantinos; Howells, Gareth (2016)
Languages: English
Types: Article
Subjects: T

Classified by OpenAIRE into

ACM Ref: ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, ComputingMethodologies_PATTERNRECOGNITION
The calculation of binary iris codes from feature values (e.g. the result of Gabor transform) is a key step in iris recognition systems. Traditional binarization method based on the sign of feature values has achieved very promising performance. However, currently, little research focuses on a deeper insight into this binarization method to produce iris codes. In this paper, we illustrate the iris code calculation from the perspective of optimization. We demonstrate that the traditional iris code is the solution of an optimization problem which minimizes the distance between the feature values and iris codes. Furthermore, we show that more effective iris codes can be obtained by adding terms to the objective function of this optimization problem. We investigate two additional objective terms. The first objective term exploits the spatial relationships of the bits in different positions of an iris code. The second objective term mitigates the influence of less reliable bits in iris codes. The two objective terms can be applied to the optimization problem individually, or in a combined scheme. We conduct experiments on four benchmark datasets with varying image quality. The experimental results demonstrate that the iris code produced by solving the optimization problem with the two additional objective terms achieves a generally improved performance in comparison to the traditional iris code calculated by binarizing feature values based on their signs.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] J. Daugman, “High confidence visual recognition of persons by a test of statistical independence,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, pp. 1148-1161, 1993.
    • [2] --, “How iris recognition works,” IEEE Trans. Circuits Syst. Video Technol., vol. 14, pp. 21-30, 2004.
    • [3] R. Wildes, “Iris recognition: an emerging biometric technology,” Proc. IEEE, vol. 85, pp. 1348-1363, 1997.
    • [4] K. Bowyer, K. Hollingsworth, and P. Flynn, “Image understanding for iris biometrics: A survey,” Image Vision Comput., vol. 110, pp. 281-307, 2008.
    • [5] Z. Sun and T. Tan, “Ordinal measures for iris recognition,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, pp. 2211-2226, 2009.
    • [6] A. Kumar and A. Passi, “Comparison and combination of iris matchers for reliable personal authentication,” Pattern Recognit., vol. 43, pp. 1016-1026, 2010.
    • [7] J. Daugman and I. Malhas, “Iris recognition border-crossing system in the uae,” International Airport Review, vol. 8, pp. 49-53, 2004.
    • [8] J. Daugman, “600 million citizens of India are now enrolled with biometric id,” SPIE Newsroom, 2014.
    • [9] C. Belcher and Y. Du, “Region-based SIFT approach to iris recognition,” Opt. Laser Eng., vol. 47, pp. 139-147, 2009.
    • [10] Y. Du, C. Belcher, and Z. Zhou, “Scale invariant gabor descriptor-based noncooperative iris recognition,” EURASIP J. Adv. Signal Process., vol. 2010, pp. 1-13, 2010.
    • [11] K. Yang and Y. Du, “A multi-stage approach for non-cooperative iris recognition,” IEEE Int. Conf. Systems, Man and Cybernetics, pp. 3386- 3391, 2011.
    • [12] H. Mehrotra, B. Majhi, and P. Sa, “Unconstrained iris recognition using F-SHIFT,” Int. Conf. Information, Communications and Signal Processing, pp. 1-5, 2011.
    • [13] Y. Chen, Y. Liu, X. Zhu, F. He, H. Wang, and N. Deng, “Efficient iris recognition based on optimal subfeature selection and weighted subregion fusion,” Scientific World J., vol. 2014, pp. 1-19, 2014.
    • [14] T. Yang, J. Stahl, S. Schuckers, and F. Hua, “Subregion mosaicking applied to nonideal iris recognition,” Int. Symp. Computational Intelligence in Biometrics and Identity Management, pp. 139-145, 2014.
    • [15] Y. Alvarez-Betancourt and M. Garcia-Silvente, “A keypoints-based feature extraction method for iris recognition under variable image quality conditions,” Knowl.-Based Syst., vol. 92, pp. 169-182, 2016.
    • [16] Z. He, T. Tan, Z. Sun, and X. Qiu, “Toward accurate and fast iris segmentation for iris biometrics,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, pp. 1670-1684, 2009.
    • [17] T. Tan, Z. He, and Z. Sun, “Efficient and robust segmentation of noisy iris images for non-cooperative iris recognition,” Image Vision Comput., vol. 28, pp. 223-230, 2010.
    • [18] C. Tan and A. Kumar, “Unified framework for automated iris segmentation using distantly acquired face images,” IEEE Trans. Image Process., vol. 21, pp. 4068-4079, 2012.
    • [19] Y. Hu, K. Sirlantzis, and G. Howells, “Improving colour iris segmentation using a model selection technique,” Pattern Recogn. Lett., vol. 57, pp. 24-32, 2015.
    • [20] L. Ma, T. Tan, Y. Wang, and D. Zhang, “Efficient iris recognition by characterizing key local variations,” IEEE Trans. Image Process., vol. 13, pp. 739-750, 2004.
    • [21] C. Tan and A. Kumar, “Efficient and accurate at-a-distance iris recognition using geometric key-based iris encoding,” IEEE Trans. Inf. Forensics Security, vol. 9, pp. 1518-1526, 2014.
    • [22] --, “Accurate iris recognition at a distance using stabilized iris encoding and zernike moments phase features,” IEEE Trans. Image Process., vol. 23, pp. 3962-3974, 2014.
    • [23] K. Hollingsworth, K. Bowyer, and P.Flynn, “The best bits in an iris code,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, pp. 964-973, 2008.
    • [24] W. Dong, Z. Sun, and T. Tan, “Iris matching based on personalized weight map,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, pp. 1744- 1757, 2010.
    • [25] C. Tan and A. Kumar, “Adaptive and localized iris weight map for accurate iris recognition under less constrained environment,” IEEE Int. Conf. Biometrics: Theory, Applications and Systems, pp. 1-7, 2013.
    • [26] Y. Hu, K. Sirlantzis, and G. Howells, “Exploiting stable and discriminability iris weight map for iris recognition under less constrained environment,” Accepted by IEEE Int. Conf. Biometrics: Theory, Applications and Systems, 2015.
    • [27] P. Li and G. Wu, “Iris recognition using ordinal encoding of logeuclidean covariance matrices,” IEEE Int. Conf. Pattern Recongnition, vol. 31, pp. 964-973, 2008.
    • [28] K. Roy and P. Bhattacharya, “Optimal features subset selection and classification for iris recognition,” J. Image and Video Processing, vol. 2008, 2008.
    • [29] M. Pereira and A. Veiga, “Application of genetic algorithms to improve the reliabilit of an iris recognition system,” IEEE Workshop Machine Learning for Signal Processing, 2005.
    • [30] K. Chen, C. Chou, S. Shih, W. Chen, and D. Chen, “Feature selection for iris recognition with adaboost,” Int. Conf. Intelligent Information Hiding and Multimedia Signal Processing, 2007.
    • [31] Z. He, Z. Sun, T. Tan, X. Qiu, C. Zhong, and W. Dong, “Boosting ordinal features for accurate and fast iris recognition,” Int. Conf. Computer Vision and Pattern Recognition, 2008.
    • [32] L. Wang, Z. Sun, and T. Tan, “Robust regularized feature selection from iris recognition via linear programming,” Int. Conf. Pattern Recognition, 2012.
    • [33] Z. Sun, L. Wang, and T. Tan, “Ordinal feature selection for iris and palmprint recognition,” IEEE Trans. Image Process., vol. 23, pp. 3922- 3934, 2014.
    • [34] J. Liu, Z. Sun, and T. Tan, “Code-level information fusion of lowresolution iris image sequences for personal identification at a distance,” IEEE Int. Conf. Biometrics: Theory, Applications and Systems, pp. 1-6, 2013.
    • [35] Y. Boykov, O. Veksler, and R. Zabih, “Markov random fields with efficient approximations,” IEEE Conference on Computer Vision and Pattern Recognition, 1998.
    • [36] --, “Fast approximation energy minimization via graph cuts,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, 2001.
    • [37] Biometrics ideal test. [Online]. Available: http://biometrics.idealtest.org/ dbDetailForUser.do?id=4
    • [38] K. Bowyer and P. Flynn, “The ND-IRIS-0405 iris image dataset,” Notre Dame CVRL Technical Report, 2009.
    • [39] H. Proenca, S. Filipe, R. Santos, J. Oliveira, and L. Alexandre, “The ubiris.v2: a database of visible wavelength images captured on-the-move and at-a-distance,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, pp. 1529-1535, 2010.
    • [40] P. Viola and M. Jones, “Rapid object detection using a boosted cascade of simple features,” IEEE Conf. Computer Vision and Pattern Recognition, 2001.
    • [41] H. Proenca and L. Alexandre, “Toward convert iris biometric recognition: experimental results from the nice contests,” IEEE Trans. Inf. Forensics Security, vol. 7, pp. 798-808, 2012.
    • [42] Y. Hu, K. Sirlantzis, and G. Howells, “A robust algorithm for color iris segmentation based on 1-norm regression,” IEEE Int. Joint Conf. Biometrics, 2014.
    • [43] L. Masek and P. Kovesi, “Matlab source code for a biometric identification system based on iris patterns,” The School of Computer Science and Software Engineering, The University of Western Australia, 2003.
    • [44] K. Nguyen, C. Fookes, S. Sridharan, and S. Denman, “Quality-driven super-resolution for less constrained iris recognition at a distance and on the move,” IEEE Trans. Inf. Forensics Security, vol. 6, pp. 1248-1258, 2011.
    • [45] H. Proenca, “Quaity assessment of degraded iris images acquired in the visible wavelength,” IEEE Trans. Inf. Forensics Security, vol. 6, pp. 82-95, 2011.
    • [46] --, “Iris recognition: What's beyond bit fragility,” IEEE Trans. Inf. Forensics Security, vol. 10, no. 2, pp. 321-332, 2014.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article