A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Efficient algorithms to compute the Hough transform on MI1\lD and SI1\1D hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, P 5 N 1 in O(p + log N) time on both~1I~'1D and SIlv1D hypercubes. These algorithms require O(N2) processors. \Ve also consider the computation of the Hough transform on MIMD hypercubes ,vith a fixed number of processors. Experimental results on an NCUBE/7 hypercube are presented. Keywords and Phrases Houghdoi:10.1007/bf00127879 fatcat:bdz3kl653zb5vjdeyohbhtnmna