|
| |||||||||
Efficient
Iris Recognition through Improvement in Iris Segmentation
Algorithm
*.S. Uma Maheswari, P.
Anbalagan, T.Priya
Department of Electrical and
Electronics Engineering,
Coimbatore Institute of
Technology, Coimbatore-641 014, Tamil Nadu, INDIA.
Tel: +91 422 2574071-72,
Extn.331
Abstract Human recognition technology research projects promises new life to many security consulting firms and personal identification system manufacturers. Iris recognition is considered to be the most reliable biometric authentication system. This paper suggests a novel segmentation algorithm to localize the iris region from the eye image in an iris recognition system based on Daugman’s Algorithm. The localized iris image is normalized to eliminate dimensional inconsistencies between iris regions using Daugman’s rubber sheet model. Next the features of the iris region is encoded by convolving the normalized iris region with 2D Gabor filter and phase quantizing the output in order to produce a bitwise biometric template. After projecting onto Gabor filters, phase information is extracted and stored as a bit code. Hamming distance measurement is done to match the iris code and authenticate the users. The two iris codes are found to match if the hamming distance is below 0.35. The iris recognition system based on Integro-differential operator segmentation method was also developed for comparative analysis. The systems suggested in this paper are written in Matlab. Digitized grayscale eye images of Chinese Academy of Sciences – Institute of Automation (CASIA) has been used for determining the performance of the proposed system. Keywords: Biometric authentication, Iris Recognition, Segmentation, Hamming Distance.
(
Biographies:
BibTex: @ARTICLE{P1150820002, AUTHOR = {S. Uma Maheswari and P. Anbalagan and T.Priya}, TITLE = {Efficient Iris Recognition through Improvement in Iris Segmentation Algorithm}, JOURNAL ={ICGST International Journal on Graphics, Vision and Image Processing, GVIP}, YEAR = {2008},
VOLUME = {08}, ISSUE ={II}, PAGES={29--35} }
( | |||||||||
|
|