Shamsi, Mahboubeh and Saad, Puteh and Ibrahim, Subariah and Kenari, Abdolreza Rasouli (2009) Fast algorithm for iris localizarion using daugman integro differential operator. In: International Conference on Soft Computing and Pattern Recognition (SoCPaR 2009), 2009, Melaka.
Full text not available from this repository.
Official URL: http://dx.doi.org/ 10.1109/SoCPaR.2009.83
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | iris-recognition, pupil regions |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Computer Science and Information System |
| ID Code: | 15180 |
| Deposited By: | Narimah Nawil |
| Deposited On: | 21 Sep 2011 09:40 |
| Last Modified: | 28 Jul 2020 02:45 |
Repository Staff Only: item control page
