An iris localization algorithm with the fast speed is proposed based on geometric features of the circle combing coarse localization with fine localization to avoid the problem of the slow speed of the classical iris localization algorithm. First, the row and column scanning method is employed to find four strings in the pupil. Four couples of tangency points are located by using the perpendicular bisector of strings and the threshold of the pupil boundary. The mean value of the coordinate parameters of the tangency points is regarded as the parameters for inner edge rough localization parameters. Then the calculus method is used for precise localization of the inner edge. The priori knowledge of the close distance between inner and outer edge centers of the circle is used to narrow the search range of the calculus method localizing outside edge, to significantly improving the speed of iris localization. The experimental results show that the proposed algorithm can improve the speed of iris localization with the high localizing accuracy.
목차
Abstract 1. Introduction 1.1 The Calculus Method 1.2 Hough Transform Method 1.3 The Method based on Geometric Features 2. The Rough Localization of the Iris Inner Edge 3. Accurate Localization of the Iris Edge 3.1 Accurate Localization of the Inner Edge 3.2 Accurate Localization of the Outer Edge 4. The Results and Analysis of the Experiments 5. Conclusion Acknowledgements References
보안공학연구지원센터(IJSIP) [Science & Engineering Research Support Center, Republic of Korea(IJSIP)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Signal Processing, Image Processing and Pattern Recognition
간기
격월간
pISSN
2005-4254
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.8 No.7