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 ...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.展开更多
基金Supported by the National Natural Science Foundation of China(No.61175069)the Prospective Project of Jiangsu Province for Joint Research(No.SBY201320601)
文摘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.
