Accurate and Robust Iris Recognition Using Modified Classical Hough Transform

  • Megha Chhabra
  • Ayush Goyal
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 10)


Circle Hough Transform (CHT) is a robust variant of the Hough Transform (HT) for the detection of circular features. Accurate iris recognition is one of the application areas of this technique. Robustness and accuracy are of utter significance but at the expense of high-computational time and space complexity as the method processes the entire image provided as an input. The present work formulates a computationally more efficient suggested solution as a modified Circle Hough Transform (MCHT) by fixating time–space complexity in terms of reducing the area of the image to cover (the number of pixels to process), and hence significantly decreasing computational time without compromising the accuracy of the method. The modified method is tested on a sample set of collected iris images. Each image is divided into three different sized skeleton grids of size 3\(\,\times \,\)3, 5\(\,\times \,\)5 and 7\(\,\times \,\)7 (pixels). The center of each grid type applied on the image gives the Region of Interest (ROI) of the image sufficient to detect circular parameters as center and radius of the iris using CHT. The experiment shows the comparison of computational time required to detect the iris from CHT applied to the whole image versus the computational time required to detect the iris from just the ROI of the image using the grids. Additionally, the results of the comparison of the expected time and observed time of detection of the iris over a large number of images is presented. There is a substantial reduction in computational time complexity up to 89% using the 3\(\,\times \,\)3 sized grids, and up to 96% using 5\(\,\times \,\)5 sized grids and up to 98% in 7\(\,\times \,\)7 sized grids with equally fair amount of reduction in space utilization. The experiment was performed to observe which grid size gave the most accurate center and radius values along with the most efficient performance. The results showed that the 3\(\,\times \,\)3 and 5\(\,\times \,\)5 sized grids provided better results as compared to the 7\(\,\times \,\)7 sized grids, the results of which lacked accuracy for some images. From the results of the experiments with varying grid sizes, the conclusion obtained is that the accuracy is compromised by grid sizes 7\(\,\times \,\)7 and higher, and grid sizes of 3\(\,\times \,\)3 or 5\(\,\times \,\)5 provide the most accurate and efficient iris detection.


Hough transform Iris Circular hough transform 


  1. 1.
    H. Yazid et al., Circular discontinuities detection in welded joints using Circular Hough Transform, NDT & E International 40 (2007) 594–601.Google Scholar
  2. 2.
    C. Sanchez-Avila and R. Sanchez-Reillo, Two different approaches for iris recognition using Gabor fillters and multiscale zero-crossing representation, Pattern Recognition, vol. 38, issue 2, pp: 231–240, (2005).Google Scholar
  3. 3.
    R. Duda and P. Hart, Use of Hough transform to detect lines and curves in pictures, Communications of the ACM 15, pp: 11–15, (1975).Google Scholar
  4. 4.
    Wojciech et al., Reliable algorithm for iris segmentation in eye image, Image and Vision computing, vol. 28, issue 2, pp: 231–237, (2010).Google Scholar
  5. 5.
    Peihua Li et al., Robust and accurate iris segmentation in very noisy images, Image and vision computing, vol. 28, issue 2, pp: 246–253, (2010).Google Scholar
  6. 6.
    WL. Hwang, JL. Lin, CL. Huang and WG. Che, Iris Recognition Method, US Patent No. US 2008/0095411 A1.Google Scholar
  7. 7.
    L. Ma, Y. Wang and T. Tanm, Iris Recognition Based on Multichannel Gabor Filtering, Proceedings of ACCV, (2002).Google Scholar
  8. 8.
    L. Ma, Y. Wang and T. Tanm, Iris Recognition Using Circular Symmetric Filters, 16th International Conference on Pattern Recognition (ICPR’02) - Volume 2.Google Scholar
  9. 9.
    SJK Pedersen, Circular Hough Transform, Aalborg University, Novembre, (2007).Google Scholar
  10. 10.
    Kimme C., Ballard, D., and Sklansky, J., Finding circles by an array of accumulators, Proc. ACM 18, pp: 120–122, (1975).Google Scholar
  11. 11.
    Xu L., Oja, E., and Kultanan, P., A new curve detection method: randomized Hough transform (RHT), Pattern Recognition Letter, vol. 11, no. 5, pp: 331–338, (1990).Google Scholar
  12. 12.
    Chen T., and Chung, K., An efficient randomized algorithm, Computer Vision and Image Understanding, vol. 63, no. 83, pp: 172–191, (2001).Google Scholar
  13. 13.
    Yip R., Tam, P., and Leung, D., Modification of Hough transform for circles and ellipse detection using a 2-dimensional array, Pattern Recognition, vol. 25, no. 9, pp: 1007–1022, (1992).Google Scholar
  14. 14.
    Ho C., and Chen, L., A fast ellipse/circle detector using geometric symmetry, Pattern Recognition, vol. 28, no. 1, pp: 117 (1995).Google Scholar
  15. 15.
    Tsuji, S., and Matsumoto, F., Detection of ellipses by a modified Hough Transformation, IEEE Transactions on Computers, vol. C-27, no. 8, pp: 777–781, (1978).Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Amity University Uttar PradeshNoidaIndia

Personalised recommendations