Real-time Robust Algorithm for Circle Object Detection

This paper presents a real-time robust algorithm to detect and accurately locate the circular objects in digital images. The algorithm consists of four steps.First the edge pixels are extracted using Canny edge detection algorithm followed by a noise removal process to remove the non-circle edge points.Afterwards, a direct least square fitting algorithm is developed to calculate radius and circle center information for each edge pixel cluster (a potential arc or a segment of a circle). In third step, a robust criterion is developed to distinguish the valid arcs from invalid arcs. Finally, those valid arcs belonging to the same circle are reassembled and fitting algorithm is run again to obtain the accurate information of that circle. The algorithm is implemented in Visual C++and tested on a laptop powered by an Intel Centrino Duo CPU at 1.66GHz. The experiment shows the algorithmpsilas three advantages. Its speed is fast, about 7 images/second for image size of 640X480. It is able toreliably detect full as well as partially-occluded circle objects even in a noisy environment, specifically 92%correct detection among 174 circles; the achievedaccuracy for radius and center location has reachedsub-pixel level on average.

[1]  O DudaRichard,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972 .

[2]  Iuri Frosio,et al.  Real-time accurate circle fitting with occlusions , 2008, Pattern Recognit..

[3]  E. R. Davies,et al.  A modified Hough scheme for general circle location , 1988, Pattern Recognit. Lett..

[4]  Andrew W. Fitzgibbon,et al.  Direct Least Square Fitting of Ellipses , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Raúl Enrique Sánchez-Yáñez,et al.  Circle detection on images using genetic algorithms , 2006, Pattern Recognit. Lett..

[6]  Erkki Oja,et al.  A new curve detection method: Randomized Hough transform (RHT) , 1990, Pattern Recognit. Lett..

[7]  Kuo-Liang Chung,et al.  An Efficient Randomized Algorithm for Detecting Circles , 2001, Comput. Vis. Image Underst..

[8]  D. Kerbyson,et al.  Using phase to represent radius in the coherent circle Hough transform , 1993 .

[9]  Jack Sklansky,et al.  The Detection and Segmentation of Blobs in Infrared Images , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  D. Kerbyson,et al.  Circle detection using Hough transform filters , 1995 .

[11]  W. Gander,et al.  Least-squares fitting of circles and ellipses , 1994 .

[12]  Jack Sklansky,et al.  Finding circles by an array of accumulators , 1975, Commun. ACM.

[13]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Jie Yao,et al.  Fast robust GA-based ellipse detection , 2004, ICPR 2004.

[15]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[16]  Andrew W. Fitzgibbon,et al.  Direct least squares fitting of ellipses , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[17]  Alfredo Petrosino,et al.  Circle detection based on orientation matching , 2001, Proceedings 11th International Conference on Image Analysis and Processing.

[18]  Aggelos K. Katsaggelos,et al.  Robust circle detection using a weighted MSE estimator , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[19]  Pär Kierkegaard,et al.  A method for detection of circular arcs based on the Hough transform , 1992, Machine Vision and Applications.

[20]  Darren J. Kerbyson,et al.  Size invariant circle detection , 1999, Image Vis. Comput..

[21]  Yong-Huai Huang,et al.  Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform , 2007, Appl. Math. Comput..