基于区域的图切割算法求解Mumford-Shah图像分割模型  

Region-based Graph Cut Algorithm for Mumford-Shah Image Segmentation Model

作　　者：张文娟[1,2] 冯象初[1] 

机构地区：[1]西安电子科技大学理学院,西安710071 [2]西安工业大学数理系,西安710032

出　　处：《计算机科学》2012年第2期297-301,共5页Computer Science

基　　金：国家自然科学基金(NSFC 60872138);西安工业大学校长基金(XAGDXJJ-0931)资助

摘　　要：在Egil Bae和Tai Xue-Cheng提出的图切割算法基础上,给出了一种改进算法用于求解Mumford-Shah图像分割模型。首先利用Mean Shift算法对原始图像进行过分割,基于过分割产生的小区域构造恰当的图,使得分割问题转化为求特定图的最小切割问题。数值实验结果显示,直接利用Mean Shift算法分割的效果不理想,本方法保持了与Egil Bae和Tai Xue-Cheng方法相类似的分割效果,而运算效率却有了很大提高。An improved graph cut algorithm was proposed based on the method presented by Egil Bae and Xue-Cheng Tai for solving the Mumford-Shah image segmentation model.Firstly the original image was over-segmented using Mean Shift method.An appropriate graph was constructed on the basis of the produced small regions.Thus by finding the minimum cut over the special graph,we obtained the solution for the segmentation problem.Numerical experiments show that the segmentation results of Mean Shift algorithm are not desirable.Our method has similar results with that presented by Egil Bae and Xue-Cheng Tai.However,the computation efficiency is greatly improved.

关 键 词：图像分割 图切割 区域 MUMFORD-SHAH模型 分片常数水平集方法 Mean SHIFT算法 

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