Hough transform, MIMD and SIMD hypercube multicomputers, complexity
Efficient algorithms to compute the Hough transform on MIMD and SIMD hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, p ≤ N, in 0(p + log N) time on both MIMD and SIMD hypercubes. These algorithms require 0(N2) processors. We also consider the computation of the Hough transform on MIMD hypercubes with a fixed number of processors. Experimental results on an NCUBE/7 hypercube are presented.
Ranka, Sanjay and Sahni, Sartaj, "Computing Hough Transforms on Hypercube Multicomputers" (1989). Electrical Engineering and Computer Science Technical Reports. 57.