区间模糊谱聚类图像分割方法

近年来谱聚类算法在模式识别和计算机视觉领域被广泛应用,而相似性矩阵的构造是谱聚类算法的关键步骤。针对传统谱聚类算法计算复杂度高难以应用到大规模图像分割处理的问题,提出了区间模糊谱聚类图像分割方法。该方法首先利用灰度直方图和区间模糊理论得到图像灰度间的区间模糊隶属度,然后利用该隶属度构造基于灰度的区间模糊相似性测度,最后利用该相似性测度构造相似性矩阵并通过规范切图谱划分准则对图像进行划分,得到最终的图像分割结果。由于区间模糊理论的引入,提高了传统谱聚类的分割性能,对比实验也表明该方法在分割效果和计算复杂度上都有较大的改善。     

Fuzzy spectral clustering with robust spatial information for image segmentation

In recent years, spectral clustering has become one of the most popular clustering algorithms in areas of pattern analysis and recognition. This algorithm uses the eigenvalues and eigenvectors of a normalized similarity matrix to partition the data, and is simple to implement. However, when the image is corrupted by noise, spectral clustering cannot obtain satisfying segmentation performance. In order to overcome the noise sensitivity of the standard spectral clustering algorithm, a novel fuzzy spectral clustering algorithm with robust spatial information for image segmentation (FSC_RS) is proposed in this paper. Firstly, a non-local-weighted sum image of the original image is generated by utilizing the pixels with a similar configuration of each pixel. Then a robust gray-based fuzzy similarity measure is defined by using the fuzzy membership values among gray values in the new generated image. Thus, the similarity matrix obtained by this measure is only dependent on the number of the gray-levels and can be easily stored. Finally, the spectral graph partitioning method can be applied to this similarity matrix to group the gray values of the new generated image and then the corresponding pixels in the image are reclassified to obtain the final segmentation result. Some segmentation experiments on synthetic and real images show that the proposed method outperforms traditional spectral clustering methods and spatial fuzzy clustering in efficiency and robustness.     

基于改进谱聚类的图像分割算法

针对传统谱聚类算法应用于图像分割时仅采用特征相似性信息构造相似性矩阵,而忽略了像素分布的空间临近信息的缺陷,提出一种新的相似性度量公式--加权欧氏距离的高斯核函数,充分利用图像特征相似性信息和空间临近信息构造相似性矩阵。在谱映射过程中,采用Nystrom逼近策略近似估计相似性矩阵及其特征向量,大大减少了求解相似性矩阵的运算复杂度,降低了内存消耗。对得到的低维向量子空间采用一种新型的聚类算法--近邻传播聚类算法进行聚类,避免了传统谱聚类采用K-means算法对初始值敏感,易陷入局部最优的缺陷。实验表明该算法获得了比传统谱聚类算法更好的分割效果。     

Local density adaptive similarity measurement for spectral clustering

Similarity measurement is crucial to the performance of spectral clustering. The Gaussian kernel function is usually adopted as the similarity measure. However, with a fixed kernel parameter, the similarity between two data points is only determined by their Euclidean distance, and is not adaptive to their surroundings. In this paper, a local density adaptive similarity measure is proposed, which uses the local density between two data points to scale the Gaussian kernel function. The proposed similarity measure satisfies the clustering assumption and has an effect of amplifying intra-cluster similarity, thus making the affinity matrix clearly block diagonal. Experimental results on both synthetic and real world data sets show that the spectral clustering algorithm with our local density adaptive similarity measure outperforms the traditional spectral clustering algorithm, the path-based spectral clustering algorithm and the self-tuning spectral clustering algorithm.     

基于改进的直觉模糊核聚类的图像分割方法

针对噪声图像模糊性的本质，提出了基于改进的直觉模糊核聚类的图像分割方法。采用直觉模糊集描述噪声图像包含的不确定性信息，将图像的灰度信息转换到直觉模糊域进行处理；将模糊核聚类拓展为直觉模糊核聚类，在图像的直觉模糊域进行聚类；通过高斯核函数和欧氏距离分别对像素8-邻域的灰度和空间信息进行建模，综合平衡灰度和空间信息对聚类的作用，并将其作为惩罚项加入到直觉模糊核聚类的目标函数中；通过梯度下降法，推导了迭代求解算法；通过典型的合成图像和自然图像分割实例，验证了所提算法的有效性和鲁棒性。     

基于半监督的超像素谱聚类彩色图像分割算法

近年来谱聚类算法被广泛应用于图像分割领域,而相似性矩阵的构造是谱聚类算法的关键步骤。 针对传统谱聚类算法计算复杂度高难以应用到大规模图像分割处理的问题,提出了基于半监督的超像素谱聚类彩色图像分割算法。该算法利用超像素将彩色图像进行预分割,利用用户提供的少量标记信息构造预分割区域的基于半监督的模糊相似性测度,利用该相似性测度构造预分隔区域的相似性矩阵并通过规范切图谱划分准则对预分割区域进行划分得到最终的图像分割结果。由于少量标记信息和模糊理论的引入,提高了传统谱聚类的分割性能,对比实验也表明该算法在分割效果和计算复杂度上都有较大的改善。     

A clustering algorithm with optimized multiscale spatial texture information: application to SAR image segmentation

An image segmentation method based on optimized spatial texture information is proposed in this article. Spatial information, including the relative position of neighbouring pixels and texture features of the multiscale neighbourhood, is incorporated into the similarity measure of the fuzzy c-means (FCM) clustering algorithm, in which the Gaussian kernel is adopted to diminish the local incorrect segmentation. The FCM clustering is spatially adjusted and optimized by the particle swarm optimization (PSO) algorithm. The purpose of optimization is to obtain the appropriate control parameters influencing spatial information, which can improve segmentation results. Experimental results demonstrate that the proposed method achieves better segmentation performance and is capable of effectively segmenting synthetic images and synthetic aperture radar (SAR) images.     

公理化模糊共享近邻自适应谱聚类算法

针对传统的谱聚类算法通常利用高斯核函数作为相似性度量,且单纯以距离决定相似性不能充分表现原始数据中固有的模糊性、不确定性和复杂性,导致聚类性能降低的问题。提出了一种公理化模糊共享近邻自适应谱聚类算法,首先结合公理化模糊集理论提出了一种模糊相似性度量方法,利用识别特征来衡量更合适的数据成对相似性,然后采用共享近邻的方法发现密集区域样本点分布的结构和密度信息,并且根据每个点所处领域的稠密程度自动调节参数σ,从而生成更强大的亲和矩阵,进一步提高聚类准确率。实验表明,相较于距离谱聚类、自适应谱聚类、模糊聚类方法和地标点谱聚类,所提算法有着更好的聚类性能。     

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

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

基于改进的相似度度量的谱聚类图像分割方法

针对传统谱聚类图像分割方法存在分割准确度不够高的缺点,提出一种基于改进的相似度度量的谱聚类图像分割方法。该方法首先使用超像素分割算法将图像预分割为一定数目的超像素集合,并构建以超像素为节点的图;然后融合超像素的协方差描述子、颜色信息、纹理信息、梯度信息以及边缘信息作为超像素的特征来度量超像素间的相似性,进而得到超像素的相似度矩阵;最后使用NJW算法对超像素图进行分割。大量的实验结果验证表明,改进的分割方法在分割精度上优于目前存在的无监督分割方法,并且在交互式分割的模式下,该方法可以准确分割出用户指定的目标。     

核空间中智模糊聚类及图像分割应用

目的 为了更有效地提高中智模糊C-均值聚类对非凸不规则数据的聚类性能和噪声污染图像的分割效果,提出了核空间中智模糊均值聚类算法。方法 引入核函数概念。利用满足Mercer条件的非线性问题,用非线性变换把低维空间线性不可分的输入模式空间映射到一个先行可分的高维特征空间进行中智模糊聚类分割。结果 通过对大量图像添加不同的加性和乘性噪声进行分割测试获得的核空间中智模糊聚类算法提高了现有算法的对含噪声聚类的鲁棒性和分类性能。峰值信噪比至少提高0.8 dB。结论 本文算法具有显著的分割效果和良好的鲁棒性,并适应于医学,遥感图像处理需要。     

基于免疫谱聚类的图像分割

提出了一种基于免疫谱聚类的图像分割方法.利用谱聚类的维数缩减特性获得数据在映射空间的分布,在此基础上构造一种新的免疫克隆聚类,用于在映射空间中对样本进行聚类.该方法通过谱映射为后续的免疫克隆聚类提供低维而紧致的输入.而免疫克隆聚类算法具有快速收敛到全局最优并且对初始化不敏感的特性,从而可以获得良好的聚类结果.在将其用于图像分割时,采用了Nystr?m逼近策略来降低算法复杂度.合成纹理图像和SAR图像的分割结果验证了免疫谱聚类算法用于图像分割的有效性.     

核空间广义均衡模糊C-均值聚类算法

目的 针对现有广义均衡模糊C-均值聚类不收敛问题,提出一种改进广义均衡模糊聚类新算法,并将其推广至再生希尔伯特核空间以便提高该类算法的普适性。方法 在现有广义均衡模糊C-均值聚类目标函数的基础上,利用Schweizer T范数极限表达式的性质构造了新的广义均衡模糊C-均值聚类最优化目标函数,然后采用拉格朗日乘子法获取其迭代求解所对应的隶属度和聚类中心表达式,同时对其聚类中心迭代表达式进行修改并得到一类聚类性能显著改善的修正聚类算法;最后利用非线性函数将数据样本映射至高维特征空间获得核空间广义均衡模糊聚类算法。结果 对Iris标准文本数据聚类和灰度图像分割测试表明,提出的改进广义均衡模模糊聚类新算法及其修正算法具有良好的分类性能,核空间广义均衡模糊聚类算法对比现有融入类间距离的改进模糊C-均值聚类(FCS)算法和改进再生核空间的模糊局部C-均值聚类(KFLICM)算法能将图像分割的误分率降低10%30%。结论 本文算法克服了现有广义均衡模糊C-均值聚类算法的缺陷,同时改善了聚类性能,适合复杂数据聚类分析的需要。     

快速鲁棒核空间模糊聚类分割

目的 传统模糊C-均值聚类应用于图像分割仅考虑像素本身的聚类问题,无法克服噪声干扰对图像分割结果的影响,不利于受到噪声干扰的工业图像、医学影像和高分遥感影像等进行目标提取、识别和解译。嵌入像素空间邻域信息或局部信息的鲁棒模糊C-均值聚类分割算法是近年来图像分割理论研究中的热点课题。为此,针对现有的鲁棒核空间模糊聚类算法非常耗时且抑制噪声能力弱、不适合强噪声干扰下大幅面图像快速分割等问题,提出一种快速鲁棒核空间模糊聚类分割算法。方法 利用待分割图像中像素邻域的灰度信息和空间位置等信息构建线性加权滤波图像,对其进行鲁棒核空间模糊聚类。为了进一步提高算法实时性,引入当前聚类像素与其邻域像素均值所对应的2维直方图信息,构造一种基于2维直方图的鲁棒核空间模糊聚类快速分割最优化数学模型,采用拉格朗日乘子法获得图像分割的像素聚类迭代表达式。结果 对大幅面图像添加一定强度的高斯、椒盐以及混合噪声,以及未加噪标准图像的分割测试结果表明,本文算法比基于邻域空间约束的核模糊C-均值聚类等算法的峰值信噪比至少提高1.5 dB,误分率降低约5%,聚类性能评价的划分系数提高约10%,运行速度比核模糊C-均值聚类和基于邻域空间约束的鲁棒核模糊C-均值聚类算法至少提高30%,与1维直方图核空间模糊C-均值聚类算法具有相当的时间开销,所得分割结果具有较好的主观视觉效果。结论 通过理论分析和实验验证,本文算法相比现有空间邻域信息约束的鲁棒核空间模糊聚类等算法具有更强的抗噪鲁棒性、更优的分割性能和实时性,对大幅面遥感、医学等影像快速解译具有积极的促进作用,能更好地满足实时性要求较高场合的图像分割需要。     

改进FCM和LFP相结合的白细胞图像分类

研究白细胞图像分类识别中有效的图像分割与特征提取方法,以提高白细胞图像的正确识别率.由于某些白细胞(粒细胞)中颗粒的存在,严重影响细胞核与细胞质区域的正确分割,通过将空间信息与核函数融入模糊C-均值聚类(FCM)算法,提出一种改进的FCM算法.应用该算法对白细胞图像进行分割,并采用数学形态学方法对分割后的图像进行处理,获得了很好的分割效果,解决了粒细胞的质核分割难题.对于细胞的纹理特征提取,通过对局部二值模式(LBP)中阈值参数的模糊化,建立了基于局部模糊模式(LFP)的纹理特征提取算法.运用本文方法进行图像分割和纹理提取,以支持向量机作为分类器,对CellAtlas的100幅白细胞图像进行了分类识别的实验,结果表明白细胞的正确识别率达到93％.     

A local-spectral fuzzy segmentation for MSG multispectral images

In this article, a segmentation approach for cloud detection in Meteosat Second Generation (MSG) multispectral images is proposed. The proposed algorithm uses recursive segmentation that dynamically reduces the number of classes. This algorithm consists of two steps. First, an initial segmentation of the image is obtained using local fuzzy clustering. The clustering algorithm is formulated by modifying the similarity measure of the standard fuzzy c-means (FCM) algorithm. The new similarity function includes the spectral information as well as the homogeneity and spatial clustering information of each considered pixel. In the second step, a hierarchical region-merging process is used to reduce the number of image clusters. At each iteration, the segmentation algorithm proceeds with a new partition until the final result of the segmentation is obtained. The proposed method has been tested using synthetic and MSG images. It yields a compact and coherent segmentation map, with a satisfactory reproduction of the image contours. Moreover, the different types of clouds are well detected and separated with appropriate accuracy.     

基于半监督的多目标进化模糊聚类算法

为了解决传统聚类由于缺少有效指导而导致图像分割结果不理想的问题,将半监督方法引入到多目标进化模糊聚类算法中,提出了一种基于半监督的多目标进化模糊聚类。图像分割算法通过构造基于半监督的类内紧致性函数和类间分离度函数,利用监督信息指导聚类过程获得非支配解集。为了从非支配解集中选择一个最优解,利用监督信息构造了基于相似性度量的有效性指标。实验结果表明,提出的方法在分割准确率和视觉效果上明显优于无监督的聚类方法。     

A mutual information based face clustering algorithm for movie content analysis

This paper investigates facial image clustering, primarily for movie video content analysis with respect to actor appearance. Our aim is to use novel formulation of the mutual information as a facial image similarity criterion and, by using spectral graph analysis, to cluster a similarity matrix containing the mutual information of facial images. To this end, we use the HSV color space of a facial image (more precisely, only the hue and saturation channels) in order to calculate the mutual information similarity matrix of a set of facial images. We make full use of the similarity matrix symmetries, so as to lower the computational complexity of the new mutual information calculation. We assign each row of this matrix as feature vector describing a facial image for producing a global similarity criterion for face clustering. In order to test our proposed method, we conducted two sets of experiments that have produced clustering accuracy of more than 80%. We also compared our algorithm with other clustering approaches, such as the k-means and fuzzy c-means (FCM) algorithms. Finally, in order to provide a baseline comparison for our approach, we compared the proposed global similarity measure with another one recently reported in the literature.     

统计聚类模型研究综述

聚类分析在工程领域如生物序列分析、图像分割、文本分析等广泛应用。聚类方法涉及广泛,而基于概率统计理论的方法是其中的一大类。从最基本的FCM模型出发,阐述了势函数(Potential)、山脉(Mountain)函数聚类方法、信息熵方法,分析比较了这些方法的适用范围和优缺点,介绍了当今流行的核聚类、谱聚类和高斯混合模型聚类方法及其求解过程,并分析了它们的优缺点、计算复杂性等指标。最后,介绍了一些崭新的聚类模型的研究方向。     

Robust path-based spectral clustering

Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough against noise and outliers in the data. In this paper, based on M-estimation from robust statistics, we develop a robust path-based spectral clustering method by defining a robust path-based similarity measure for spectral clustering under both unsupervised and semi-supervised settings. Our proposed method is significantly more robust than spectral clustering and path-based clustering. We have performed experiments based on both synthetic and real-world data, comparing our method with some other methods. In particular, color images from the Berkeley segmentation data set and benchmark are used in the image segmentation experiments. Experimental results show that our method consistently outperforms other methods due to its higher robustness.