Abstract

This paper presents an efficient Iris recognition system based on Fast Fourier Transform. The system is comprised of several algorithms which are employed to provide effective identification of an individual based on the individual's Iris pattern. The proposed combines canny edge detector and circular Hough transform model algorithms which yield more rapid and accurate Iris boundaries localization. The eyelid and eyelashes occlusion is also dealt with by applying non maxima radial suppression technique. The segmented Iris area is then normalized with all iris templates converted from circular to rectangular shape of standard dimensions thus enabling comparison between them. Fast Fourier Transform function is then applied to normalized Iris image. The resulting matrix consists of real and imaginary part represented by complex numbers. The matrix is encoded by assigning a sequence of binary numbers to each possible combination of complex numbers thus producing Iris code. In the matching phase the degree of dissimilarity between the two Iris codes is determined. The experimental results show that the obtained high recognition accuracy is competitive with other existing methods.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.