Occluded iris classification and segmentation using self-customized artificial intelligence models and iterative randomized Hough transform

18Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

A fast and accurate iris recognition system is presented for noisy iris images, mainly the noises due to eye occlusion and from specular reflection. The proposed recognition system will adopt a self-customized support vector machine (SVM) and convolution neural network (CNN) classification models, where the models are built according to the iris texture GLCM and automated deep features datasets that are extracted exclusively from each subject individually. The image processing techniques used were optimized, whether the processing of iris region segmentation using iterative randomized Hough transform (IRHT), or the processing of the classification, where few significant features are considered, based on singular value decomposition (SVD) analysis, for testing the moving window matrix class if it is iris or non-iris. The iris segments matching techniques are optimized by extracting, first, the largest parallel-axis rectangle inscribed in the classified occluded-iris binary image, where its corresponding iris region is cross-correlated with the same subject's iris reference image for obtaining the most correlated iris segments in the two eye images. Finally, calculating the iris-code Hamming distance of the two most correlated segments to identify the subject's unique iris pattern with high accuracy, security, and reliability.

Cite

CITATION STYLE

APA

Qasmieh, I. A., Alquran, H., & Alqudah, A. M. (2021). Occluded iris classification and segmentation using self-customized artificial intelligence models and iterative randomized Hough transform. International Journal of Electrical and Computer Engineering, 11(5), 4037–4049. https://doi.org/10.11591/ijece.v11i5.pp4037-4049

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free