Study on circle detection algorithm based on data dispersion

To reduce time-consuming,a new algorithm is proposed for circle detection based on the theory of data dispersion. The center coordinates and radius can be detected with the following steps in this algorithm precisely and quickly. Firstly,image processing is needed to extract the boundary of the prim...

Full description

Saved in:
Bibliographic Details
Published in高技术通讯(英文版) Vol. 23; no. 4; pp. 399 - 403
Main Author 帅立国;Wei Youying;Chen Huiling
Format Journal Article
LanguageEnglish
Published School of Mechanical and Electrical Engineering, Henan Institute of Science and Technology, Xinxiang 453003, P.R.China%School of Mechanical Engineering, Southeast University, Nanjing 211189, P.R.China 01.12.2017
Subjects
Online AccessGet full text
ISSN1006-6748
DOI10.3772/j.issn.1006-6748.2017.04.008

Cover

Loading…
More Information
Summary:To reduce time-consuming,a new algorithm is proposed for circle detection based on the theory of data dispersion. The center coordinates and radius can be detected with the following steps in this algorithm precisely and quickly. Firstly,image processing is needed to extract the boundary of the primary image,which is almost like a circle in shape,and after that,the original circle is reduced to a single-pixel width circle by image processing. Secondly,the center coordinates are calculated by three selected points on the circle. There might be a deviation between the calculated center and real center. Thirdly,a square area is determined for the center coordinates computing with an experimental range and each pixel inside the square is a potential center. Fourthly,the center is computed with distance criterion and the center coordinate is determined when the variance reaches the minimum. Lastly,the radius is equal to the means of the distance vector with minimum variance.Experiments are conducted and the results show that the proposed algorithm gets the same accuracy and better real-time performance in comparison with traditional Hough transform.
Bibliography:Shuai Liguo * , Wei Youying* , Chen Huiling**( *School of Mechanical and Electrical Engineering, Henan Institute of Science and Technology, Xinxiang 453003, P. R. China) ( ** School of Mechanical Engineering, Southeast University, Nanjing 211189, P. R. China)
circle detection center coordinates dispersion
To reduce time-consuming,a new algorithm is proposed for circle detection based on the theory of data dispersion. The center coordinates and radius can be detected with the following steps in this algorithm precisely and quickly. Firstly,image processing is needed to extract the boundary of the primary image,which is almost like a circle in shape,and after that,the original circle is reduced to a single-pixel width circle by image processing. Secondly,the center coordinates are calculated by three selected points on the circle. There might be a deviation between the calculated center and real center. Thirdly,a square area is determined for the center coordinates computing with an experimental range and each pixel inside the square is a potential center. Fourthly,the center is computed with distance criterion and the center coordinate is determined when the variance reaches the minimum. Lastly,the radius is equal to the means of the distance vector with minimum variance.Experiments are conducted and the results show that the proposed algorithm gets the same accuracy and better real-time performance in comparison with traditional Hough transform.
11-3683/N
ISSN:1006-6748
DOI:10.3772/j.issn.1006-6748.2017.04.008