图象处理中边界转换的并行算法及其实现

A Parallel Algorithm and Implementation of Boundary Conversion in Image Processing

本文提出了一种把图象中边界转换成区域四分树的并行方法．该方法基于ＭＩＭＤ模型，并在曙光１０００上实际运行．整个算法用Ｐ个处理器可以在时间Ｏ（（Ｂ×ｌｏｇＢ）／Ｐ）内完成其中Ｂ是循环代码长度．该算法可应用于图象处理、计算机图形学、模式识别等领域．

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× log B)/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.