欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了克服边缘流各向异性扩散（EAD，edgeflow-dfiven anistropic diffusion）过分割和最小生成树（MST，minimum spanning tree）方法计算复杂度高的缺点，提出了结合边缘流与区域归并的彩色图像分割方法。首先利用EAD方法对图像进行预分割，然后利用MST方法依据全局最优化准则对EAD的过分割区域进行归并，最后进行相应的后处理，得到最终的分割结果。这里，由于MST方法是基于EAD的过分割区域而非像素点，因此算法效率得到了很大的提高。另外，EAD方法可以有效利用图像的局部信息，而MST方法则考虑到了图像的全局特征，因此本文方法综合了两者的优点。实验结果表明，本文方法不但能够取得很好的分割效果，而且运行时间较短。
英文摘要：
In order to overcome the over segmentation phenomenon of edgeflow-driven anistropic diffusion （EAD） and the high computational complexity of （MST） minimum spanning tree, a color image segmentation algorithm based on edgeflow and region merging is presented. First of all, the EAD is applied to the image to get a preliminary result. Then the MST is used to perform the globally optimized region merging. Finally,segmentation results are achieved after proper post-process. Because the MST is based on segmented regions instead of image pixels, this algorithm requires much lower computational complexity. In addition,the GAD focuses on local details while the MST captures global property, so the proposed algorithm combines both advantages. Experimental results clearly indicate that the approach we propose can not only get satisfactory segmentation results, but also decrease the runtime of the process.
同期刊论文项目
同项目期刊论文
期刊信息
位置：