Real-time CAM-based Hough transform algorithm and its performance evaluation

Abstract. This paper proposes a highly parallel Hough transform algorithm for real-time straight-line extraction and its hardware implementation on a content-addressable memory (CAM). To achieve high-speed processing, incrementation for voting, which composes the Hough transform, and calculations for coordinate updating are carried out for the every scan line, not every edge pixel, and extracting maxima in Hough space is executed by parallel comparing. Moreover, variously weighted voting achieves more accurate line extraction in spite of the quantization error and noise in the image space. In the implementation, the CAM acts as a PE (processing-element) array that effectively performs highly parallel processing for the Hough transform and also as a memory for two-dimensional Hough space, and both voting and peak extraction are directly executed by the CAM. Evaluations of CAM hardware size, processing time and the accuracy of line extraction show that a real-time and high-resolution Hough transform for a 256 $\times$256 picture can be achieved using a single CAM chip with current VLSI technology. This CAM-based Hough transform algorithm promises to be an important step towards the realization of a real-time and compact image-understanding system.

[1]  Qiang Ji,et al.  An optimal Bayesian Hough transform for line detection , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[2]  Hiroyasu Koshimizu,et al.  Realization of an efficient line detection by askant glance camera vision system using extended Hough transform , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[3]  Susanne E. Hambrusch,et al.  Parallel algorithms for line detection on a mesh , 1989 .

[4]  Jiri Matas,et al.  Progressive probabilistic Hough transform for line detection , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[5]  Robert Cypher,et al.  The Hough Transform has O(N) Complexity on SIMD N x N Mesh Array Architectures. , 1987 .

[6]  T. Ogura,et al.  A 20 kbit associative memory LSI for artificial intelligence machines , 1989 .

[7]  Yasuhito Suenaga,et al.  A high-resolution Hough transform using variable filter , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[8]  Susanne E. Hambrusch,et al.  Parallel Algorithms for Line Detection on a Mesh , 1989, J. Parallel Distributed Comput..

[9]  T. Ogura,et al.  A 336-kbit content addressable memory for highly parallel image processing , 1996, Proceedings of Custom Integrated Circuits Conference.

[10]  Azriel Rosenfeld,et al.  Hough transform algorithms for mesh-connected SIMD parallel processors , 1988, Comput. Vis. Graph. Image Process..

[11]  Erkki Oja,et al.  Probabilistic and non-probabilistic Hough transforms: overview and comparisons , 1995, Image Vis. Comput..

[12]  Bertil Schmidt,et al.  Morphological Hough Transform on the Instruction Systolic Array , 1997, Euro-Par.

[13]  Allan L. Fisher,et al.  Computing the Hough Transform on a Scan Line Array Processor (Image Processing) , 1989, IEEE Trans. Pattern Anal. Mach. Intell..