Abstract
An improved Daugman iris recognition algorithm is provided in this paper, which embodies in two aspects: ➀ Improvement for iris localization and ➁ The improvement for both iris encoding and matching algorithms. In Step 1, the localization and shape of the pupil are roughly determined in iris image, which is used as prior knowledge to quickly locate the inner and outer boundary of iris from rough to fine scale. Eyelids, eyelashes areas and the spot in the pupil are automatically detected and removed to improve the localization accuracy. In Step 2, the possible noise from residual eyelashes is further filtered by selecting a “pure” iris area as a reference and making a validation judgment pixel-wise. Furthermore, the validation flag for each pixel is introduced into the iris encoding and matching computation, as a result, the rejection rate of iris recognition is reduced. Compared with Daugman algorithm, iris recognition test on collected human eye images shows that our proposed algorithm has an obvious improvement both on boosting the speed and reducing the rejection rate.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
