A fast efficient parallel hough transform algorithm on LARPBS

被引:8
作者
Chen, L [1 ]
Chen, HJ
Pan, Y
Chen, YX
机构
[1] Yangzhou Univ, Dept Comp Sci, Yangzhou 225009, Peoples R China
[2] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
[3] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
关键词
LARPBS model; Hough transform; parallel algorithm;
D O I
10.1023/B:SUPE.0000026850.06646.3c
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A parallel algorithm for Hough transform on a linear array with reconfigurable pipeline bus system (LARPBS) is presented. Suppose the number of theta-values to be considered is m, for an image with n x n pixels, the algorithm can complete Hough transform in O(1) time using mn(2) 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.
引用
收藏
页码:185 / 195
页数:11
相关论文
共 16 条