| 图象处理中边界转换的并行算法及其实现 |
| |
| 引用本文： | 杨 勃,陈 虎,陈国良. 图象处理中边界转换的并行算法及其实现[J]. 软件学报, 1998, 9(2): 115-120 |
| |
| 作者姓名： | 杨 勃 陈 虎 陈国良 |
| |
| 作者单位： | 中国科学技术大学计算机系,合肥,230027;中国科学技术大学计算机系,合肥,230027;中国科学技术大学计算机系,合肥,230027 |
| |
| 基金项目： | 本文研究得到国家教委博士点基金资助. |
| |
| 摘 要： | 本文提出了一种把图象中边界转换成区域四分树的并行方法.该方法基于MIMD模型,并在曙光1000上实际运行.整个算法用P个处理器可以在时间O((B×logB)/P)内完成其中B是循环代码长度.该算法可应用于图象处理、计算机图形学、模式识别等领域.
|
| 关 键 词： | 四分树 Morton序列 Jordan曲线 循环代码 快速排序. |
| 收稿时间： | 1996-01-03 |
| 修稿时间： | 1997-06-09 |
A Parallel Algorithm and Implementation of Boundary Conversion in Image Processing |
| |
| YANG Bo,CHEN Hu and CHEN Guo-liang. A Parallel Algorithm and Implementation of Boundary Conversion in Image Processing[J]. Journal of Software, 1998, 9(2): 115-120 |
| |
| Authors: | YANG Bo CHEN Hu CHEN Guo-liang |
| |
| Affiliation: | Department of Computer Science University of Science and Technology of China Hefei 230027 |
| |
| Abstract: | This paper presents a parallel method of converting boundary to region quadtree. The method based on MIMD model has been implemented on DAWN1000 by comparing sequential results with the parallel results. The algorithm can be finished in O((B×logB)/P), where B is the number of chaincodes, and P is the number of processors. The algorithm can be applied widely in image processing, computer graphics, and pattern recognition etc. |
| |
| Keywords: | Quadtree Morton code Jordan curve chaincode quick sort. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
