DocumentCode :
2940656
Title :
Fast Algorithm for Iris Localization Using Daugman Circular Integro Differential Operator
Author :
Shamsi, Mahboubeh ; Saad, Puteh Bt ; Ibrahim, Subariah Bt ; Kenari, Abdolreza Rasouli
Author_Institution :
Fac. of Comput. Sci. & Inf. Syst., Univ. Technol. Malaysia, Skudai, Malaysia
fYear :
2009
fDate :
4-7 Dec. 2009
Firstpage :
393
Lastpage :
398
Abstract :
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.
Keywords :
iris recognition; CASIA database; Daugman circular integro differential operator; MMU database; average square shrinking approach; circle contour sampling parameter; fast algorithm; iris localization; iris-recognition; online authentication; Iris; Algorithm Speed ability; Average Square Shrinking; Circle Contour Sampling; Daugman´s Method; Iris Segmentation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Soft Computing and Pattern Recognition, 2009. SOCPAR '09. International Conference of
Conference_Location :
Malacca
Print_ISBN :
978-1-4244-5330-6
Electronic_ISBN :
978-0-7695-3879-2
Type :
conf
DOI :
10.1109/SoCPaR.2009.83
Filename :
5370980
Link To Document :
بازگشت