1 / 17

Improved Daugman’s Method

Team Beta Bryan Chamberlain Kyle Barkes Daniel Lohmer Patrick Braga-Henebry CSE30332 Programming Paradigms Professor Patrick Flynn. Improved Daugman’s Method. Outline. Problem statement Literature Review Improved Daugman’s Algorithm Implementation Details Experimental Results

christopher-travis
Télécharger la présentation

Improved Daugman’s Method

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Team Beta Bryan Chamberlain Kyle Barkes Daniel Lohmer Patrick Braga-Henebry CSE30332 Programming Paradigms Professor Patrick Flynn Improved Daugman’s Method

  2. Outline • Problem statement • Literature Review • Improved Daugman’s Algorithm • Implementation Details • Experimental Results • Conclusions and Comments

  3. Problem Statement • Our team sought to create an efficient iris localization algorithm through both research and self-testing.

  4. Literature Review • How Iris Recognition Works (John Daugman)‏ • Image understanding for iris biometrics: A survey (Kevin W. Bowyer, Karen Hollingsworth, Patrick J. Flynn)‏ • An Improved Method for Daugman's Iris Localization Algorithm(Xinying Ren, Zhiyong Peng, Qinging Zeng, Chaonan Peng, Jianhua Zhang, Shuicai Wu, Yanjun Zeng)‏ • Efficient Iris Recognition through Improvement of Feature Vector and Classifier(Shinyoung Lim, Kwanyong Lee, Okhwan Byeon, and Taiyun Kim)‏ • Iris recognition: An emerging biometric technology(Richard P. Wildes)‏ • Iris segmentation methodology for non-cooperative recognition(Hugo Proença, Luís A, Alexandre)‏

  5. Iris segmentation methodology for non-cooperative recognition • Extension of Wilde’s method • Fuzzy k-means clustering

  6. An Improved Method for Daugman's Iris Localization Algorithm • Localization of pupillary boundary • Coarse, then fine • Localization of limbus boundary • Coarse, then fine, based on right and left canthus • Localization of upper and lower eyelid boundaries • excludes area most likely to be noise

  7. Concerns • With pupil boundary detection: • Ability to set accurate threshold value • With limbus boundary detection: • Noise getting in the way of edge detection on either side of the eye • With eyelid exclusion: • Loss of valid data • Inability to detect extremerotation

  8. Implementation • Utilized: Python, OpenCV, Google Code, SVN • Pupil • Coarse and Fine combined • Limbus • Coarse • Fine • Main • Combines all functions • A variety of output options

  9. Pupilic Localization • Threshold as defined in paper: • 128 proved to be a bad value • Solved for new values x and y: • With a high average gray value(DC): • With a low average gray value(DC): • Solved for new threshold equation:x = -8 y = 257

  10. Pupilic Localization Cont'd • Compare each pixel, to threshold value • If I(x,y) < L, then it is considered to be in the pupil • Radius is determined using the number of pixels found and the area of a circle • Center coordinates are found by calculating the average x and y values of every pixel • The integro-differential operator is then used for fine-localization

  11. Pupilic Localization Cont'd • f (I ) = |I (x, y) − I (x − 1, y − 1)| + |I (x, y) − I (x, y − 1)|+ |I (x, y) − I (x + 1, y − 1)|+ |I (x, y) − I (x − 1, y)|+ |I (x, y) − I (x + 1, y)|+ |I (x, y) − I (x − 1, y + 1)|+ |I (x, y) − I (x, y + 1)|+ |I (x, y) − I (x + 1, y + 1)| • If f(I) < , it is still in the pixel

  12. Integro-differential operator dr

  13. Coarse Limbic • Uses pupilic (x,y,r) to find limbic for L/R arcs • Increments radius, keeps max(IDO)‏ • Averages L/R (x,y,r)‏

  14. Fine Limbic • Searches around coarse (x±9,y±8,r±9) for better fit Fine Coarse Result Search Space

  15. Experiments • 51 Images, provided by Dr. P.J. Flynn • Center: Euclidean Distance • Radii: Absolute Difference

  16. Experiment Data

  17. Conclusions and comments • OO • C++ vs. Python • What worked well? • Integro-differential operator • Threshold evaluator • What didn’t work well? • Delta(intensity) check on coarse pupil

More Related