Abstract

AbstractAn improvement method is present in this paper for Daugman’s iris localization algorithm. It may make iris localization more rapid and more precise. It may also decrease the computational complexity of the localization algorithm by reducing the search area for the iris boundary center and the radius, In addition, a new method excluding the upper and lower eyelids is proposed. Experiments indicate that the present method have better performance.Keywordsirislocalizationinner boundaryouter boundary

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 call

Disclaimer: 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.