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.
[1]
Saburo Tsuji,et al.
Detection of Ellipses by a Modified Hough Transformation
,
1978,
IEEE Transactions on Computers.
[2]
Tieniu Tan,et al.
Iris recognition using circular symmetric filters
,
2002,
Object recognition supported by user interaction for service robots.
[3]
Jack Sklansky,et al.
Finding circles by an array of accumulators
,
1975,
Commun. ACM.
[4]
Kuo-Liang Chung,et al.
An Efficient Randomized Algorithm for Detecting Circles
,
2001,
Comput. Vis. Image Underst..
[5]
Richard O. Duda,et al.
Use of the Hough transformation to detect lines and curves in pictures
,
1972,
CACM.
[6]
Ling-Hwei Chen,et al.
A fast ellipse/circle detector using geometric symmetry
,
1995,
Pattern Recognit..
[7]
Peihua Li,et al.
Robust and accurate iris segmentation in very noisy iris images
,
2010,
Image Vis. Comput..
[8]
Peter Kwong-Shun Tam,et al.
Modification of hough transform for circles and ellipses detection using a 2-dimensional array
,
1992,
Pattern Recognit..
[9]
Mariusz Zubert,et al.
Reliable algorithm for iris segmentation in eye image
,
2010,
Image Vis. Comput..
[10]
Erkki Oja,et al.
A new curve detection method: Randomized Hough transform (RHT)
,
1990,
Pattern Recognit. Lett..
[11]
Carmen Sánchez Ávila,et al.
Two different approaches for iris recognition using Gabor filters and multiscale zero-crossing representation
,
2005,
Pattern Recognit..
[12]
Haniza Yazid,et al.
Circular discontinuities detection in welded joints using Circular Hough Transform
,
2007
.