University of Louisville Electrical and Computer Engineering ECE523: Introduction to Biometrics

Instructor: Dr. Aly A. Farag Fall 2009

Project # 3

EC E 52 3
Project Guidelines

Iris Recognition (Issued 10/20/09 – Due 11/10/09)

Contents

Project Guidelines ............................................................................................................................ 1 Part 0 – Iris Database ....................................................................................................................... 2 Part I – Iris Segmentation ................................................................................................................ 3 Part II – Iris Normalization .............................................................................................................. 3 Part III – Feature Encoding ............................................................................................................. 3 Part IV – Iris Comparisons .............................................................................................................. 3 Part V – Noisy comparisons............................................................................................................. 4 References........................................................................................................................................ 4

The project can be done as an individual effort or in groups of 2 people. The topic of this project is Iris Recognition. Each group will develop and implement their algorithms to build an iris recognition system using a standard iris database. Competition based on recognition accuracy in a limited time will be held. Submission of the project include submitting zip-file containinmg your implementation with a readme file, a project report written in a paper format (preferred standard IEEE format, be sure to label each figure in your report) and brief class-room presentation. Students are encouraged to refer to whatever resources they use in their project, including papers, books, lecture notes, websites … etc. Independent implementation of the algorithm(s) is necessary. The idea of using iris patterns for personal identification was originally proposed in 1936 by ophthalmologist Frank Burch. In the 1980's the idea appeared in James Bond movies, but it remained science fiction. It was not until 1987, two American ophthalmologists, Leonard Flom and Aran Safir patented Burch's concept but they were unable to develop such a process. So Instead they turned to John Daugman, who was teaching at Harvard University and now at Cambridge University, to develop actual algorithms for iris recognition[1-3]. These algorithms, which Daugman developed in 1994, are the basis for all current iris recognition systems. Figure (1) illustrates Daugman’s model for iris recognition.

l0 al -F

9;

Pr
Page 1 of 4

e oj

ct

#

;D

r.

r Fa

ag

Daugman and Sun papers will be posted on the blackboard. There are 5 left eye iris images which are excluded from the database due to cataract disease. Africa and Europe. It is required to divid your database into training and testing images. you can put in your database 70% of them and use 30% for testing your recognition system. This camera is semi-automated and it operates at the range of 7-25 cm. In the following we will discuss the basic building blocks of a generic iris recognition system. if you have N iris images for each subject. there will be group who will be assigned to implement Daugman’s approach and the other groups will implement Sun’s approach. They come from Asia. Aly A. 3 l0 al -F Figure 1 – Daugman’s model for iris recognition 9. On the other hand. in this lab. Each of them contributes 5 iris images for each eye. MMU2 iris database consists of 995 iris images.7] has published two papers for iris segementation and recognition. MMU1 iris database contributes a total number of 450 iris images which were taken using LG IrisAccess®2200. r Fa ag . Middle East.University of Louisville Electrical and Computer Engineering ECE523: Introduction to Biometrics Instructor: Dr.D r. Farag Fall 2009 EC E 52 Recently Zhenan Sun [6. which is supposed to be the most up-to-date approaches in literature.edu.my/~ccteo/. Pr Page 2 of 4 e oj ct # . These iris images are contributed by 100 volunteers with different age and nationality.mmu. Part 0 – Iris Database You can download iris images from http://pesona. The iris images are collected using Panasonic BM-ET100US Authenticam and its operating range is even farther with a distance of 47-53 cm away from the user.

image smoothing can be applied to have a clear edge map where the iris boundary is clearly visible. then display the output for each of the iris images. Farag Fall 2009 Part I – Iris Segmentation The first part of identifying irises is to segment the iris region. Refer to lecture notes for more details. median filtration can then be applied to remove noisy regions as a result of eyelashes. EC E 52 Part II – Iris Normalization For Daugman group: Implement Daugman’s rubber sheet model to extract fixed number of feature points in the segmented iris region. r Fa ag . Remove eyelids and eyelashes. Associate to each rubber sheet a noise mask to exclude eyelids and eyelashes from the iris region. Extract the pupil boun dary. Based on the score. Extract the iris boundary. you can use linear hough transform to approximate eyelids with lines. Based on the score. which images are matches? Report your findings in a tabular format. the following guidelines might help you: however you need to refer to your assigned paper (Daugman’s or Sun’s) for more details [1-3. Refer to lecture notes for more details. 2. Part III – Feature Encoding For Daugman group: The next step is to implement Daugman’s algorithm to create an iris code [1-3] for each of the normalized iris region and display the output. apply this model to all irises in the database. Segment each iris image.5]. Report the Hamming Distance Score for each comparison.D r. which images are matches? Report your findings in a tabular format. For Sun group: Implement Sun’s feature matching algorithm to compare each of the testing iris images to the iris images in your database (training part). then connected component labeling can be applied to extract the pupil region to compute the centroid and radius of the pupil region. 3 l0 al -F 9. For Sun group: Implement Sun’s approach to mimic Daugman’s rubber sheet model to extract fixed number of feature points from the segmented iris region[6]. Part IV – Iris Comparisons For Daugman group: Now use the normalized Hamming Distance formula [5] to compare each of the testing iris images to the iris images in your database (training part). 3. you can use the pupil boudary as the initial contour. Aly A. you might apply circular hough transform to extract the parameters of the circle which best fits the iris boundary.University of Louisville Electrical and Computer Engineering ECE523: Introduction to Biometrics Instructor: Dr. 1. you may use image histogram to extract the threshold automatically that will extract the pupil region. Report the distance score for each comparison. For Sun group: Implement Sun’s algorithm (Cardinal measures) to create an iris code[7] for each of the normalized iris region and display the output. EXTRA CREDIT: Implement the “snakes” algorithm instead of circular hough transfrom for image segmentation. Pr Page 3 of 4 e oj ct # .

take one of each of the testing images corresponding to a database image.uk/~jgd1000/ProcIEEEnov2006Daugman. EC E 52 References [0] Lecture notes.ac.ac.D r. J.mathworks. 31.” http://www. Zhenan Sun.” IEEE Trans.” http://www.. Aly A. vol. Tieniu Tan.. pp. “Iris Recognition Source Code.cl. 21-30. Available at: http://www.University of Louisville Electrical and Computer Engineering ECE523: Introduction to Biometrics Instructor: Dr. no.cl.” http://www. Computer Lab.cam. 9.cam.uk/users/jgd1000/irisrecog.com/matlabcentral/fileexchange/loadFile. “Active Contour Toolbox. "Toward Accurate and Fast Iris Segmentation for Iris Biometrics. Then perform Parts I-IV and report on the matching score. “How iris recognition works. Pr Page 4 of 4 e oj ct # . To simulate the iris being out of focus.cam.edu. [1] Daugman. then add salt-and-pepper noise to each of the testing images.uk/~jgd1000/ [3] Masek.” http://www.pdf [6] Zhaofeng He. Then perform Parts IIV and report on the matching score. 2004. pp. Xianchao Qiu.html [4] MATLAB Cental.do?objectId=11643 [5] Daugman. L. 1670-1684. To simulate the iris being out occluded. Cambridge Univ. IEEE Transactions on Pattern Analysis and Machine Intelligence. Farag Fall 2009 Part V – Noisy comparisons An iris recognition system is supposed to perform well when the comparison images are out-offocus or with some occluded areas of the iris (such as eyelashes or a partially open eyelid).cl.uwa." IEEE Transactions on Pattern Analysis and Machine Intelligence.pdf [2] “John Daugman’s webpage. and implement a 9x9 ordinary blur filter (may be average filter) on each of the testing images. take one of each of the testing images corresponding to a database image. July 2009 [7] Zhenan Sun. “Cardinal Measures for Iris Recognition”. CSVT 14(1).csse. Tieniu. September 2009 3 l0 al -F 9.ac.au/~pk/studentprojects/libor/sourcecode. J. “Probing the Uniqueness and Randomness of IrisCodes. r Fa ag .