摘要
本文提出了一种基于流水光总线可重构线性阵列 (LARPBS)模型的快速高效Hough变换算法 .该算法利用LARPBS有力的通讯功能和计算能力 ,对直线上的黑色象素进行抽取和统计 .对于大小为n×n的二值数字图象、m个θ参数值 ,本算法可以使用mn2 个处理机在O(1)时间完成 ,从而使速度和效率都达到最优 .文中还给出当LARPBS中处理机个数少于mn2 时的算法分解执行方法 ,说明算法具有很好的可扩放性 .
A parallel Hough transform algorithm on linear array with reconfigurable pipeline bus system (LARPBS) is presented.Utilizing the strong communication and computation ability of LARPBS,the algorithm can contract and count the foreground pixels on each line.Suppose the number of θ values considered is m,the algorithm can complete Hough transform for an image with n×n pixels in O(1) time using mn2 processors and get optimal speed and efficiency.We also illustrate how to partition and perform the algorithm on a LARPBS with less than mn2 processors,thus show the algorithm is highly scalable.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2004年第5期759-762,共4页
Acta Electronica Sinica
基金
国家自然科学基金(No.60074013)
国家高性能计算基金(No.00219)
江苏省教育厅自然科学基金(No.02KJB520009)
南京大学软件新技术国家重点实验室开放基金(No.200110)
