Daugman’s Algorithm Enhancement for Iris Localization
- 1 November 2011
- journal article
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 403-408, 3959-3964
- https://doi.org/10.4028/www.scientific.net/amr.403-408.3959
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 taken 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. Duda and Hart used Hough transforms to detect the contours and curves. 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 algorithm enhancement for solving this problem.This publication has 7 references indexed in Scilit:
- Improvement on Pupil Positioning Algorithm in Eye Tracking TechniquePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Eyes Tracking in a Video Sequence Based-On Haar-like Features and Skin ColorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- How Iris Recognition WorksIEEE Transactions on Circuits and Systems for Video Technology, 2004
- The importance of being random: statistical principles of iris recognitionPattern Recognition, 2003
- Biometric personal identification based on iris patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- High confidence visual recognition of persons by a test of statistical independenceIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- Use of the Hough transformation to detect lines and curves in picturesCommunications of the ACM, 1972