An efficient Hough transform algorithm on SIMD hypercube

This paper presents a fast algorithm for computing the Hough transform on SIMD hypercube architectures. For an image with N×N pixels and n quantized θ values, our algorithm computes the Hough transform in O(logN) time on a hypercube of size N×N×n. An efficient algorithm for large Hough transform problems on a smaller fixed-size hypercube is also given. On a hypercube of size M×M×m, the time complexity is O(L²l)=O(N² n/M²m) where L=N/M and l=n/m. Thus, the algorithm for large problems produces linear speed-up and optimal efficiency