| 摘要: |
| 本文提出了一种把图象中边界转换成区域四分树的并行方法.该方法基于MIMD模型,并在曙光1000上实际运行.整个算法用P个处理器可以在时间O((B×logB)/P)内完成其中B是循环代码长度.该算法可应用于图象处理、计算机图形学、模式识别等领域. |
| 关键词: 四分树,Morton序列,Jordan曲线,循环代码,快速排序. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家教委博士点基金资助. |
|
| A Parallel Algorithm and Implementation of Boundary Conversion in Image Processing |
|
YANG Bo,CHEN Hu,CHEN Guo-liang
|
| 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. |
| Key words: Quadtree, Morton code, Jordan curve, chaincode, quick sort. |
