FAST HOUGH TRANSFORM FOR MULTIDIMENSIONAL SIGNAL PROCESSING.

Abstract

The fast Hough transform (FHT) algorithm has been developed that significantly alleviates the large complexity and storage requirements of the Hough transform by several orders of magnitude, thus raising the possibility of its use as a fundamental algorithm for multidimensional signal processing. The author investigates its implementation on SIMD architecture consisting of a large number of identical bit-serial processing elements. The performance of FHT algorithm is found to be within the millisecond range of the commercially available bit-serial processing element and can be considered for many real-time applications, such as multidimensional pattern detection and parameter extraction.