Parallel algorithms for line detection on a 1*N array processor

@article{Li1991ParallelAF,
  title={Parallel algorithms for line detection on a 1*N array processor},
  author={Ze-Nian Li and Frank Tong and Robert G. Laughlin},
  journal={Proceedings. 1991 IEEE International Conference on Robotics and Automation},
  year={1991},
  pages={2312-2318 vol.3}
}
A description is given of two algorithms that compute the Hough transform for straight lines on N*N images using 1*N processing arrays. The algorithms are developed for 1*N array processors and have been implemented on the AIS-5000 parallel vision computer. The complexity of both algorithms is O(N/sup 2/+PN) on the 1*N array processor (P is the number of angles polled which determines the theta -resolution of the Hough space), which compares well with the known optimal O(N+P) algorithms for N*N… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Real-Time Hough Transform on 1-D SIMD Processors: Implementation and Architecture Exploration

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Real-time implementations of Hough Transform on SIMD architecture

VIEW 2 EXCERPTS
CITES METHODS