利用改进图割的彩色图像分割算法  

Color Image Segmentation Using Improved Graph Cuts

作　　者：李磊[1,2] 董卓莉[1] 

机构地区：[1]河南工业大学信息科学与工程学院,河南郑州450001 [2]华中科技大学计算机学院,湖北武汉430074

出　　处：《武汉大学学报（信息科学版）》2014年第12期1504-1508,共5页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(60972098);河南省教育厅自然科学研究资助项目(13A520177)~~

摘　　要：针对基于多标签图割的分割算法因标签过多造成计算量大的问题,提出一种基于多组件图割的彩色图像分割算法。首先根据彩色梯度信息融合所提取的四元数cut-off窗口特征和CIE Lab颜色特征进行特征提取;然后使用多组件图割算法结合最大似然(ML)估计自动分割图像,在迭代过程中,每一个分割内不相邻的区域将作为该分割的多个组件以减少标签数;最后去除一些弱边界得到分割结果。理论和实验结果表明,新算法不仅具有收敛性,而且分割性能优于原始算法。A novel unsupervised color image segmentation method using graph cuts with multiple components is proposed,which can overcome the problem of the higher computational complexity caused by more labels during inferring by graph cuts.First,the quaternion cut-off window feature and CIE Lab color feature of a given image are extracted and fused based on the gradient information of the image.Then the segmentation is formulated as a labeling problem and solved by an iterative process based on graph cuts and maximum likelihood（ML）estimation.At each iteration,the connected regions in a segment are handled as sub-components of the segment instead of relabeling them with unique labels.In doing so,the number of labels does not increase,and thus the computational complexity can be reduced during inference by graph cuts.Finally,the segmentation result is obtained after removing some weak edges.Experimental results and theoretical proof demonstrate the good performance of the proposed method.

关 键 词：彩色图像分割 多组件图割 cut-off窗口 最大似然估计 

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