摘要
流域变换是数字形态学中用于图像分割的一种经典方法,其并行化问题成为近年来研究的重点。首先给出了流域变换的数学模型,并归纳列举了几种离散情况下的形式化定义;其次分类总结了近年来流域变换串行算法研究的新进展,从而在此基础上重点讨论了相应的并行化策略。详细分析了设计并行流域算法需要考虑的几个问题;并比较评价了现有并行算法的性能特点,得出了一些结论;最后提出了有待进一步研究的问题。
Watershed transform is a classical method of image segmentation in mathematical morphology, and its parallelism is an important problem-This paper starts with a mathematical model of watershed transform in topography, followed by its several formal definitions for digital case. Then some new serial watershed algorithms proposed in recent years are classified and analyzed, based on which their related parallel strategies are discussed in detail. Then we analyze some issues, which should be considered when designing parallel watershed algorithm, and give an evaluation of existing parallel algorithms, and draw some conclusions. Finally we point out the problems and challenges of future research.
出处
《国防科技大学学报》
EI
CAS
CSCD
北大核心
2002年第6期71-76,90,共7页
Journal of National University of Defense Technology
基金
国家杰出青年科学基金项目资助(69825104)
关键词
流域变换
图像分割
分水岭变换
并行算法
分布存储
域分解
加速比
数字形态学
串行算法
watershed
transform
image segmentation
catchment basins
watershed line
parallel algorithms
distributed memory
domain decomposition
speedup
