二维类内最小交叉熵的图像分割快速方法  

Fast image segmentation method based on two-dimensional within-class minimum cross entropy

作　　者：陈琪[1] 熊博莅[1] 陆军[1] 匡纲要[1] 

机构地区：[1]国防科学技术大学电子科学与工程学院,长沙410073

出　　处：《计算机工程与应用》2011年第9期149-151,203,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60772045)~~

摘　　要：熵是基于图像的一维灰度直方图得到的,仅利用了像素的灰度信息。最小交叉熵就是要寻找最优阈值使原始图像和分割图像之间的信息量的差异最小,在交叉熵的基础上,通过引入图像的空间信息,定义了二维类内交叉熵,并提出了基于二维类内最小交叉熵的图像分割方法。实验结果表明,充分利用图像的灰度信息和空间信息后,二维类内交叉熵取得了比交叉熵更好的分割效果。为了提高运算效率,提出了相应的快速递推算法,计算时间由从多于3小时减少到只要几秒。Entropy is acquired by calculating image’s histogram,which only uses gray information of pixels.Minimum cross entropy is to search optimal threshold that can make minimum difference of information between original image and segmented image.On the basis of minimum cross entropy,this paper defines two-dimensional within-class minimum cross entropy by introducing spatial information of image.Moreover,this paper proposes an image segmentation method based on 2D within-class minimum cross entropy.Experimental results show that proposed method can obtain better segmentation effect than minimum cross entropy.In order to promote the speed of segmentation,corresponding recursive algorithm is proposed.Analysis shows that the computation time of 2D within-class minimum cross entropy method is reduced from more than 3 hours to several seconds.

关 键 词：图像分割 阈值 最小交叉熵 二维直方图 

分 类 号：TN911.73[电子电信—通信与信息系统]