By Topic

An efficient Hough transform algorithm on SIMD hypercube

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chuang, H.Y.H. ; Dept. of Comput. Sci., Pittsburgh Univ., PA, USA ; Ling Chen

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(L2l)=O(N2 n/M2m) where L=N/M and l=n/m. Thus, the algorithm for large problems produces linear speed-up and optimal efficiency

Published in:

Parallel and Distributed Systems, 1994. International Conference on

Date of Conference:

19-22 Dec 1994