New fast Hough transform

This paper presents a new algorithm for the fast hough transform. Compared with others, this algorithm not only has a faster speed but also has advantages such as avoiding erroneous solutions, eliminating redundant points, detecting straight lines of different sizes, and selecting threshold automatically etc. We will discuss the performance of this algorithm and will also show its efficiency with examples.

[1]  Julio Villalba,et al.  A fast Hough transform for segment detection , 1995, IEEE Trans. Image Process..

[2]  Hungwen Li,et al.  Fast Hough transform: A hierarchical approach , 1986, Comput. Vis. Graph. Image Process..

[3]  Dana H. Ballard,et al.  Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..

[4]  Dana H. Ballard,et al.  Computer Vision , 1982 .