Abstract
A parallel algorithm for Hough transform on a linear array with reconfigurable pipeline bus system (LARPBS) is presented. Suppose the number of θ-values to be considered is m, for an image with n × n pixels, the algorithm can complete Hough transform in O(1) time using mn2 processors and achieve optimal speed and efficiency. We also illustrate how to partition data and perform the algorithm on a LARPBS with fewer than mn 2 processors, and hence show that the algorithm is highly scalable.
| Original language | English |
|---|---|
| Pages (from-to) | 185-195 |
| Number of pages | 11 |
| Journal | Journal of Supercomputing |
| Volume | 29 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 2004 |
Keywords
- Hough transform
- LARPBS model
- Parallel algorithm
Fingerprint
Dive into the research topics of 'A fast efficient parallel Hough transform algorithm on LARPBS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver