Fast generalized Hough transform

Abstract A fast algorithm for the generalized Hough transform (GHT) based on the use of a hierarchical processing scheme and the inverse generalized Hough operation is proposed. By reducing the size of the image portion which need be processed in the proposed fast GHT, not only the computation time but also the number of processing elements for parallel processing can be reduced. The way to apply the proposed fast recursive GHT on pyramid machines is discussed. Some experimental results are also included to demonstrate the applicability of the approach.

[1]  Dana H. Ballard,et al.  Viewer Independent Shape Recognition , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Tsugito Maruyama,et al.  A Real-Time Processor for the Hough Transform , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

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

[4]  Theodosios Pavlidis,et al.  A hierarchical data structure for picture processing , 1975 .

[5]  David J. Farber,et al.  A Parallel Mechanism for Detecting Curves in Pictures , 1975, IEEE Transactions on Computers.

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

[7]  Glenn H. Chapman,et al.  A Monolithic Hough Transform Processor Based on Restructurable VLSI , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

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

[9]  Larry S. Davis,et al.  Hierarchical generalized Hough transforms and line-segment based generalized H ugh transforms , 1982, Pattern Recognit..

[10]  Virginio Cantoni,et al.  Structural shape recognition in a multiresolution environment , 1987 .