Abstract
Iris localization is an important step in iris recognition systems; all the subsequent steps, iris normalization, feature extraction and matching, depend on its accuracy. Traditional iris localization methods often involve an exhaustive search of a three-dimensional parameter space, which is a time consuming process. This paper presents a coarse-to-fine algorithm to address the computational cost problem, while achieving an acceptable accuracy. The iris gray image is transformed to a binary image using an adaptive threshold obtained from analyzing the image intensity histogram. Morphological processing is then used to extract an initial center point, which is considered as the initial center for both pupil and iris boundaries. Finally, a refinement step is made using an integro-differential operator to get the final iris and pupil centers and radii. This system proves to be robust against occlusions and intensity variations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
