Title: Optimized Daugman’s algorithm for iris localization
Authors: Hebaishy, Mohamed A.
Citation: WSCG ’2008: Poster Proceedings: The 16-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic, February 4-7, 2008, p. 5-8.
Issue Date: 2008
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2008/Papers_2008/poster/!_WSCG2008_Poster_final.zip
ISBN: 978-80-86943-17-6
Keywords: biometrika;lidská identifikace;lokalizace oční duhovky;Daugmanův algoritmus
Keywords in different language: biometrics;human identification;iris localization;Daugman’s algorithm
Abstract: Iris localization is considered the most difficult part in iris identification algorithms because it defines the inner and outer boundaries of iris region used for feature analysis. Several researches were made in the subject of iris finding and segmentation. The main objective here is to remove any non-useful information, namely the pupil segment and the part outside the iris (sclera, eyelids, skin). R. Wildes used Hough transforms to detect the iris contour. Daugman proposed an integro-differential operator to find both the pupil and the iris contour. Daugman’s method is claimed to be the most efficient one. This paper proposes an implementation for Daugman's algorithm, which was found incompatible with visible light illuminated images. Then this paper proposes new algorithm for solving this problem.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG ’2008: Poster Proceedings

Files in This Item:
File Description SizeFormat 
Hebaishy.pdf319,66 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/793

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.