一种基于图的分水岭区域合并算法  

A Graph-based Area Merge Algorithm Which Can Be Applied to Watershed Segmentation Method

作　　者：李健宏[1] 付淇[1] 

机构地区：[1]江西科技师范学院,江西南昌330013

出　　处：《南昌大学学报（理科版）》2009年第2期200-204,共5页Journal of Nanchang University(Natural Science)

摘　　要：介绍了一种对分水岭算法的初始分割结果进行区域合并的方法。该方法计算每一待合并区域与所有邻居之间的"不相似度"函数值,以此为依据进行区域合并;算法使用了图(Graph)数据结构来存储区域间的相邻信息。实验结果表明,此方法能够较好地从大量的区域中找出那些相似的区域并将其合并,最终达到图像分割的目的。An area -merge algorithm which can be applied to the initial segmentation result of WaterShed method has been introduced in this article. And in this algorithm, a so - called ＂Dissimilar Function＂ value of every area between its neighbour is computed. The algorithm uses this ＂Dissimilar Function＂ value to perform mergence opera- tion which is implemented on a Graph Data Structure. The experiments show that this algorithm can search out the similar areas from a great amount Of areas and merge them. The result of the area - merge algorithm is a well - seg- mentated image.

关 键 词：图像处理 分水岭算法 区域合并 不相似性函数 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]