Iris Localization with an Improved Least Squares Fitting Algorithm
- 10.2991/isca-13.2013.28How to use a DOI?
- Iris Recognition, Iris Localization, Least Squares Fitting, Circular Arc Segment
According to the disadvantages that calculation speed of traditional iris localization algorithm is slow and takes up much space. In this paper, we propose a new iris localization algorithm with an improved least squares fitting. Making use of the characteristics that gray value of iris image is difference from peripheral image around the iris, it uses Canny edge detector to detect iris image boundary and looks for a proper threshold to binarize image, and then uses least squares fitting to locate inner boundary and makes up circular arc segment of outer boundary. Finally, the center coordinate and radius of iris boundary can be easy to compute. The experimental results basing on over 150 images from CASIA iris image database have shown that accuracy of our localization method can be achieved as high as 99% and is over 150ms faster than the references mentioned in the paper. Our algorithm also reduces calculation complexity and saves memory space.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Tao Wei AU - Shuxiang Song AU - Haiying Xia PY - 2013/10 DA - 2013/10 TI - Iris Localization with an Improved Least Squares Fitting Algorithm BT - Proceedings of 2013 International Conference on Information Science and Computer Applications PB - Atlantis Press SP - 161 EP - 166 SN - 1951-6851 UR - https://doi.org/10.2991/isca-13.2013.28 DO - 10.2991/isca-13.2013.28 ID - Wei2013/10 ER -