New fast algorithm of Hough transform detection of circles
一种用Hough变换检测圆的快速算法*

This paper proposed a new fast algorithm for the detection of circles, which improved the problem of huge time consuming when using the traditional Hough transform. The new algorithm had three advantages: low time consuming; hold all the advantages of the traditional Hough transform such as high detection rate, robust to noise and fragmentary boundaries; did not need any special qualification. Experimental results demonstrate that the new fast algorithm can be used for fast target recognition, which has a good performance in real time system.