Fast algorithm for iris localizarion using daugman 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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/15180/ http://dx.doi.org/ 10.1109/SoCPaR.2009.83 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|