Fast Algorithm for Iris Localization Using Daugman Circular Integro Differential Operator

The iris localization is a very important step for iris-recognition. In this step concentric circular outer boundaries of the iris and the pupil in eye's image identify. We enhanced Daugman method to locate the iris by using an Average Square Shrinking Approach. The algorithm is tested using ir...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference of Soft Computing and Pattern Recognition pp. 393 - 398
Main Authors Shamsi, M., Saad, P.B., Ibrahim, S.B., Kenari, A.R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2009
Subjects
Algorithm Speed ability
Average Square Shrinking
Circle Contour Sampling
Daugman's Method
Iris
Iris Segmentation
Online AccessGet full text
ISBN1424453305
9781424453306
DOI10.1109/SoCPaR.2009.83

Cover

More Information
Summary:The iris localization is a very important step for iris-recognition. In this step concentric circular outer boundaries of the iris and the pupil in eye's image identify. We enhanced Daugman method to locate the iris by using an Average Square Shrinking Approach. The algorithm is tested using iris images from CASIA database and MMU database. The circle contour sampling parameter has been investigated to find a tradeoff between speed and accuracy of algorithm for different number of points on a circle. The experiments show proposed algorithm can localize the iris faster than other similar methods. Our approach is feasible for online authentication application that need more speed in detection.
ISBN:1424453305
9781424453306
DOI:10.1109/SoCPaR.2009.83