FCM与马氏空间约束条件下的快速图像分割技术研究*

提出了一种FCM与马氏空间约束的快速图像分割技术.在FCM图像分割算法的基础上,引入了Markov 随机场用以描述图像分割中的空间约束信息,并通过多级级联的方式获得最后的图像分割结果.这样既克服了传统模糊C均值聚类算法只考虑图像中的数值特征信息,忽略像素间的空间约束关系的缺点,又最大限度地保证了分割算法计算的简单有效性.实验证明,与其他模糊C均值聚类算法相比,本文方法有更好的可靠性与有效性.     

一种嵌入局部信息的快速KFCM聚类分割算法

针对核空间模糊局部C-均值聚类分割算法时间复杂性过大而不适合实时场合图像分割需要的问题,提出了一种核空间局部模糊C-均值聚类分割的快速算法。利用像素与其邻域像素之间的空间距离信息和灰度方差信息构造一种加权共生矩阵;将图像像素的一维直方图以及像素与邻域像素之间的二维共生直方图相结合构造了一种新的核空间模糊C-均值聚类分割目标函数,并对其推导获得隶属度和聚类中心迭代表达式;将图像像素采用该算法聚类所得隶属度进行邻域滤波处理,以便改善该算法的抗噪性能。实验结果表明,该分割算法相比核空间局部模糊C-均值聚类分割更有利于实时场合和大幅面图像分割的需要。     

基于改进模糊C均值聚类的光伏面板红外图像分割

红外图像具有对比度低和信噪比低等特点,这对红外光伏面板图像的分割始终是一个巨大的挑战.为了解决传统的模糊C均值（FCM）聚类算法易受到初始聚类中心不确定的影响和不考虑空间信息的问题,提出了一种基于模糊C均值改进的聚类分割算法,该算法利用直方图的特点确定初始聚类中心,同时在传统的模糊C均值（FCM）和模糊核C均值算法（KFCM）的基础上,利用像素之间的空间信息和邻域像素之间的关系改进传统FCM聚类目标函数,从而推导出新的目标函数.实验结果表明,该算法在分割质量和效果上与Otsu算法、文献[20]的自适应k-means算法及模糊核C均值算法（KFCM）相比,过分割和错分割率明显降低,且分割效果非常接近手动分割图.     

马尔可夫随机场约束下的PCM图像分割算法

与模糊c均值（FCM）算法相比较,可能性C均值（PCM）聚类算法具有更好的抗干扰能力。但PCM聚类算法对初始化条件很敏感,在聚类的过程中很容易导致聚类结果一致性,并且没有考虑到像素的空间信息,用在图像分割尤其是多目标图像分割上效果极不稳定。在PCM算法的基础上,利用Markov随机场中的邻域关系属性,引入先验空间约束信息,建立包含灰度信息与空间信息的新聚类目标函数,提出马尔可夫随机场与PCM聚类算法相融合的图像分割新算法（MP．CM算法）。实验结果表明,在多目标图像分割上利用MPCM算法可以取得比PCM更好的分割效果。     

结合空间邻域信息的核FCM图像分割算法

针对传统FCM聚类算法在图像分割时对噪声敏感的问题,提出一种结合空间邻域信息的核FCM图像分割算法。该算法在FCM算法目标函数中增加了空间约束函数,并引入考虑邻域信息的局部隶属度函数,同时引入核函数,用内核诱导距离替换原来的欧式距离,优化分割图像的特征。最后通过将全局模糊隶属度函数与局部隶属度函数结合在一起,得到新的加权隶属度函数,实现图像的分割。通过对人工合成图像和自然图像进行分割实验,结果表明,在分割质量和效果上该算法明显优于标准FCM算法及KFCM等改进算法,同时对噪声更具鲁棒性。     

自适应灰度加权的鲁棒模糊C均值图像分割

针对传统模糊C均值(fuzzy C-means,FCM)算法以及结合空间信息的相关改进算法分割精度较低、对噪声敏感的问题,提出一种自适应灰度加权的鲁棒模糊C均值图像分割算法。首先,通过定义像素间的局部灰度相似性测度来反映各像素对局部邻域的影响程度,并根据邻域窗口中各像素的灰度差异,利用指数函数进一步控制邻域像素的影响权重,实现像素灰度的自适应加权,从而提高像素灰度计算的准确性。其次,构造出一种改进的距离测度代替传统的欧氏距离,用于计算各像素与聚类中心之间的相似距离,增强算法对噪声和异常值的鲁棒性。最后,将提出的自适应灰度加权方法与改进的距离测度应用到FCM算法中,实现图像分割。实验结果表明,该算法需根据图像噪声的强度适当地选取邻域窗口大小,在此条件下算法能够取得较优的分割效果和运行效率,且对噪声具有较强的鲁棒性。     

利用空间信息的核模糊C均值聚类算法

模糊聚类,特别是模糊C均值聚类算法（FCM）广泛地运用到图像的分割中。但是传统的算法未对数据对特征进行优化,亦未考虑图像的空间信息,对噪声图像分割不理想。在FCM目标函数中引入核函数,用内核引导距离代替传统的欧式距离,同时考虑到邻近象素的影响,增加了空间约束项,提出了利用空间信息的核FCM算法。通过对模拟图和仿真脑部MR图像的分割实验证明,该算法可以有效的分割含有噪声图像。     

结合隶属度与像素交替引导滤波的鲁棒模糊聚类算法

模糊局部信息C-均值（FLICM）聚类算法是目前应用较广泛的图像分割算法,然而仅适用于处理低噪声图像。FLICM算法与像素引导隶属度滤波的结合在一定程度上提高了噪声抑制能力,但仍无法满足强噪声图像的分割需求。联合引导滤波与基于核度量的加权模糊局部信息C-均值（KWFLICM）聚类算法,提出一种隶属度与像素值交替引导的核模糊聚类算法。将像素引导隶属度滤波模块和隶属度引导像素滤波模块引入KWFLICM算法,构造一种引导滤波约束的多目标核模糊聚类优化模型,采用最小二乘法对该模型进行迭代求解。在迭代过程中,通过像素引导隶属度滤波和隶属度引导像素滤波,分别修正输入图像的隶属度和像素值,进一步提高核模糊聚类算法对含噪图像的鲁棒性。实验结果表明,与同类核模糊聚类算法相比,该算法在莱斯噪声干扰下的误分率、精确度、峰值信噪比、Jaccard相似系数等评价指标上表现突出,具有更好的分割性能和更强的鲁棒性。     

一种快速鲁棒核空间图形模糊聚类分割算法

针对现有鲁棒图形模糊聚类算法难以满足强噪声干扰下大幅面图像快速分割的需要，提出一种快速鲁棒核空间图形模糊聚类分割算法。该算法将欧氏空间样本通过核函数映射至高维空间；采用待分割图像中像素邻域的灰度和空间等信息构建线性加权滤波图像，对其进行鲁棒核空间图形模糊聚类；并引入当前聚类像素与其邻域像素均值所对应的二维直方图信息，获得鲁棒核空间图形模糊聚类快速迭代表达式。对大幅面图像添加高斯和椒盐噪声进行分割测试，实验结果表明:本文算法相比基于图形模糊聚类等分割算法的分割性能、抗噪鲁棒性和实时性有了显著提高。     

一种融入局部信息的直觉模糊C-均值聚类图像分割算法

模糊C-均值(FCM)算法对图像噪声敏感,聚类过程中只考虑图像的数值特征信息而忽略像素间空间约束关系,同时单一隶属度并不能充分描述图像的不确定性,这使得基于FCM的图像分割不够准确.融入局部信息的改进FCM算法虽然对图像噪声有一定鲁棒性,但对图像细节保持不够,难以分割微小区域.针对上述问题,提出一种基于直觉模糊集的改进模糊C-均值(IFS_FCM)图像分割算法.该方法将直觉模糊集理论融入到FCM中,充分考虑图像的不确定性,同时在目标函数中引入空间邻域信息,使得该分割算法对噪声鲁棒性增强的同时还能保持图像细节信息.实验结果表明,IFS_FCM能获得更加理想的图像分割效果.     

Fuzzy c-means clustering with weighted image patch for image segmentation

Fuzzy c-means (FCM) clustering has been widely used in image segmentation. However, in spite of its computational efficiency and wide-spread prevalence, the FCM algorithm does not take the spatial information of pixels into consideration, and hence may result in low robustness to noise and less accurate segmentation. In this paper, we propose the weighted image patch-based FCM (WIPFCM) algorithm for image segmentation. In this algorithm, we use image patches to replace pixels in the fuzzy clustering, and construct a weighting scheme to able the pixels in each image patch to have anisotropic weights. Thus, the proposed algorithm incorporates local spatial information embedded in the image into the segmentation process, and hence improve its robustness to noise. We compared the novel algorithm to several state-of-the-art segmentation approaches in synthetic images and clinical brain MR studies. Our results show that the proposed WIPFCM algorithm can effectively overcome the impact of noise and substantially improve the accuracy of image segmentations.     

自适应非局部空间约束与K-L信息的模糊C-均值噪声图像分割算法

针对传统模糊C-均值聚类(FCM)算法对噪声鲁棒性差的问题, 提出一种自适应非局部空间约束与K-L信息 的模糊C-均值噪声图像分割算法. 首先, 通过定义平滑度, 设计自适应匹配函数, 实现非局部空间信息项搜索窗口和 邻域窗口的自适应计算, 克服非局部空间信息窗口大小固定的问题. 其次, 将K-L信息引入目标函数, 利用隐马尔可 夫模型计算图像像素的上下文信息, 减少分割的模糊性. 最后, 利用原始图像和非局部空间信息项局部方差的绝对 差和其倒数自适应约束原始图像和非局部空间信息项, 实现约束项参数的自适应选择, 提高算法的灵活性. 含噪合 成图像和彩色图像分割实验表明, 该算法在分割精准度、平均交互比、归一化互信息、模糊分割系数和模糊划分熵 等性能方面均优于其他几种FCM算法. 例如, 在混合噪声密度为15%的条件下, 算法的模糊分割系数和模糊划分熵 分别达到99.92%和0.14%.     

Novel segmentation algorithm in segmenting medical images

The aim of this paper is to develop an effective fuzzy c-means (FCM) technique for segmentation of Magnetic Resonance Images (MRI) which is seriously affected by intensity inhomogeneities that are created by radio-frequency coils. The weighted bias field information is employed in this work to deal the intensity inhomogeneities during the segmentation of MRI. In order to segment the general shaped MRI dataset which is corrupted by intensity inhomogeneities and other artifacts, the effective objective function of fuzzy c-means is constructed by replacing the Euclidean distance with kernel-induced distance. In this paper, the initial cluster centers are assigned using the proposed center initialization algorithm for executing the effective FCM iteratively. To assess the performance of proposed method in comparison with other existed methods, experiments are performed on synthetic image, real breast and brain MRIs. The clustering results are validated using Silhouette accuracy index. The experimental results demonstrate that our proposed method is a promising technique for effective segmentation of medical images.     

基于改进马尔可夫随机场的钢轨缺陷分割

为提高钢轨缺陷分割对噪声的鲁棒性,提出一种基于改进马尔可夫随机场(MRF)的钢轨缺陷分割方法。利用背景差分法对灰度进行预处理,消除灰度分布不均的干扰。对模糊if-then规则的前提部分采用马尔可夫随机场来利用图像中的空间约束,结果部分指定像素距离图算法,通过使用马尔可夫随机场(MRF)在相邻像素图像之间并入局部空间信息,推导出新的自适应模糊集和MRF相结合的钢轨表面缺陷自动分割方法。建立标准的FCM、GMM和该方法的钢轨缺陷分割对比实验,验证了算法的有效性和优越性。     

An adaptive spatial information-theoretic fuzzy clustering algorithm for image segmentation

This paper presents an adaptive spatial information-theoretic fuzzy clustering algorithm to improve the robustness of the conventional fuzzy c-means (FCM) clustering algorithms for image segmentation. This is achieved through the incorporation of information-theoretic framework into the FCM-type algorithms. By combining these two concepts and modifying the objective function of the FCM algorithm, we are able to solve the problems of sensitivity to noisy data and the lack of spatial information, and improve the image segmentation results. The experimental results have shown that this robust clustering algorithm is useful for MRI brain image segmentation and it yields better segmentation results when compared to the conventional FCM approach.     

Fuzzy c-means clustering with non local spatial information for noisy image segmentation

As an effective image segmentation method, the standard fuzzy c-means (FCM) clustering algorithm is very sensitive to noise in images. Several modified FCM algorithms, using local spatial information, can overcome this problem to some degree. However, when the noise level in the image is high, these algorithms still cannot obtain satisfactory segmentation performance. In this paper, we introduce a non local spatial constraint term into the objective function of FCM and propose a fuzzy cmeans clustering algorithm with non local spatial information (FCM_NLS). FCM_NLS can deal more effectively with the image noise and preserve geometrical edges in the image. Performance evaluation experiments on synthetic and real images, especially magnetic resonance (MR) images, show that FCM_NLS is more robust than both the standard FCM and the modified FCM algorithms using local spatial information for noisy image segmentation.     

基于核特征距离的局部活动轮廓模型

提出了一种基于核特征距离局部活动轮廓分割模型。在模型中使用核特征距离来构造局部拟合能量,从而可以获取精确的局部图像特征,可以分割存在灰度不均匀的图像。并通过引入水平集规范项以避免水平集演化的重新初始化,提高了分割的效率。实验结果表明,本模型可以很好地克服灰度不均匀性,同时在分割精度上有了较大的提升,特别是分割速度比LBF模型快1.3～1.5倍。     

Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure

Fuzzy c-means clustering (FCM) with spatial constraints (FCM_S) is an effective algorithm suitable for image segmentation. Its effectiveness contributes not only to the introduction of fuzziness for belongingness of each pixel but also to exploitation of spatial contextual information. Although the contextual information can raise its insensitivity to noise to some extent, FCM_S still lacks enough robustness to noise and outliers and is not suitable for revealing non-Euclidean structure of the input data due to the use of Euclidean distance (L2 norm). In this paper, to overcome the above problems, we first propose two variants, FCM_S1 and FCM_S2, of FCM_S to aim at simplifying its computation and then extend them, including FCM_S, to corresponding robust kernelized versions KFCM_S, KFCM_S1 and KFCM_S2 by the kernel methods. Our main motives of using the kernel methods consist in: inducing a class of robust non-Euclidean distance measures for the original data space to derive new objective functions and thus clustering the non-Euclidean structures in data; enhancing robustness of the original clustering algorithms to noise and outliers, and still retaining computational simplicity. The experiments on the artificial and real-world datasets show that our proposed algorithms, especially with spatial constraints, are more effective.