| 一种快速高效的Hough变换并行算法 |
| |
| 引用本文： | 陈崚,陈宏建,徐晓华,秦玲. 一种快速高效的Hough变换并行算法[J]. 电子学报, 2004, 32(5): 759-762 |
| |
| 作者姓名： | 陈崚 陈宏建 徐晓华 秦玲 |
| |
| 作者单位： | 1. 扬州大学信息工程学院计算机系,江苏扬州 225009;2. 南京大学软件新技术国家重点实验室,江苏南京 210093 |
| |
| 基金项目： | 国家自然科学基金，国家高性能计算基金，江苏省教育厅自然科学基金，国家重点实验室基金 |
| |
| 摘 要： | 本文提出了一种基于流水光总线可重构线性阵列(LARPBS)模型的快速高效Hough变换算法.该算法利用LARPBS有力的通讯功能和计算能力,对直线上的黑色象素进行抽取和统计.对于大小为n×n的二值数字图象、m个θ参数值,本算法可以使用mn2个处理机在O(1)时间完成,从而使速度和效率都达到最优.文中还给出当LARPBS中处理机个数少于mn2时的算法分解执行方法,说明算法具有很好的可扩放性.
|
| 关 键 词： | LARPBS模型 Hough变换 并行算法 |
| 文章编号： | 0372-2112(2004)05-0759-04 |
| 收稿时间： | 2003-05-06 |
A Fast Efficient Parallel Algorithm for Hough Transform |
| |
| CHEN Ling ,,CHEN Hong-jian,XU Xiao-hua,QIN Ling. A Fast Efficient Parallel Algorithm for Hough Transform[J]. Acta Electronica Sinica, 2004, 32(5): 759-762 |
| |
| Authors: | CHEN Ling CHEN Hong-jian XU Xiao-hua QIN Ling |
| |
| Affiliation: | 1. Department of Computer Science,Yangzhou University,Yangzhou,Jiangsu 225009,China;2. National Key Lab of Novel Software Tech,Nanjing Univ.Nanjing,Jiangsu 210093,China |
| |
| Abstract: | 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. |
| |
| Keywords: | LARPBS model Hough transform parallel algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载免费的PDF全文 |
|
