基于模糊C均值聚类的多分量彩色图像分割算法

以模糊C均值(FCM)聚类理论为基础,选用符合人眼视觉特性的HSI颜色空间,提出了一种新的多分量彩色图像分割算法。该算法首先结合数据分布特点确定出H分量与I分量的初始聚类中心;然后利用FCM聚类技术对H分量、I分量进行分类处理,以得到不同分量的像素点隶属度;最后,将所得到的不同分量像素点隶属度组织成2维特征,并以此进行模糊聚类图像分割。实验结果表明,该算法可有效提高图像分割效果,其分割结果优于传统FCM聚类图像分割方案。     

基于均值漂移和小波变换的彩色图像分割方法

提出一种新的彩色图像分割算法,该算法利用均值漂移算法进行初始分割,利用其分割结果确定模糊C均值聚类(FCM)算法的初始聚类中心和聚类数目,以提高FCM算法的收敛速度;利用小波变换的多分辨率特性,实现图像由粗到细的图像分割。     

空间模糊C均值聚类的神经切片图像分割方法

周围神经切片显微图像具有背景复杂、区域不连续和光照不均匀等特点,应用经典的图像分割算法难以取得有效的分割结果。通过结合初始隶属度概率函数和空间距离来设计空间函数而得到的SFCM聚类算法,并提出SFCM彩色图像分割方法。把图像从RGB颜色空间转换到HIS颜色空间。采用聚类有效性分析指标在直方图快速FCM算法中为HSI各分量确定分类数目和获取SFCM初始化参数。对HIS各分量分别进行SFCM聚类,合并各分量并转换回RGB彩色空间以显示结果。实验结果表明,与标准FCM聚类分割算法相比,新方法能更有效地分割区域不连续的神经切片显微图像。     

结合爬山法的模糊C均值彩色图像分割方法

采用传统的模糊C均值聚类(FCM)算法进行彩色图像分割存在聚类数的选取、初始聚类中心的确定、迭代过程中的大计算量及后处理等问题。在对上述问题进行研究的基础上,针对传统FCM聚类分割时初始值选取方法的盲目性和随机性,为了更准确地自动获取待分割图像聚类的初始参数,提出了一种结合爬山法的模糊C均值彩色图像分割方法(HFCM),该方法可根据待分割图像的三维颜色直方图自适应地获取FCM算法的初始聚类中心及聚类数目,同时提出一种最频滤波与区域合并相结合的新的后处理策略,有效消除了小的空间区域。实验表明,相对于传统FCM,该图像分割方法的速度较快,并且分割结果更接近人类分割效果。     

基于分量直方图的移动机器人视觉图像自适应分割

提出一种基于分量直方图的自适应分割方法．首先对图像的3个分量统计直方图进行自适应分割，确定出各分量的分类数目及类的取值范围；然后，对分割类进行分量间组合，获得原图像中主要的几种颜色；最后以这些颜色作为聚类中心，按照颜色相似性准则对图像进行聚类分割．在移动机器人CASIA 1上进行的实验证明：该算法实现了图像主要区域的自适应分割与提取，并且能够满足移动机器人对视觉处理过程的实时性要求．     

自适应模糊C均值聚类彩色图像分割方法

模糊C均值聚类用于彩色图像分割具有简单直观,易于实现的特点,但存在聚类性能受中心点初始化影响且计算量大等问题,为此,提出一种自适应模糊C均值分割方法.算法根据人类的视觉特性,参照NBS距离与人类视觉对颜色差别的定量关系,结合具体图像的色彩分布,自动确定初始聚类中心及聚类数目,继而进行模糊C均值聚类.实验表明,该方法无需人为的干预,分割速度快,分割效果跟人的主观视觉感知保持了良好的一致性.     

自适应快速FCM彩色图像分割研究

模糊C均值聚类算法（FCM）广泛用于彩色图像分割,但该算法存在需要预先指定聚类数目、计算量大、耗时长且易陷入局部最优等缺点。提出一种自适应快速模糊C均值彩色图像分割方法,该方法首先运用蚁群算法,自动获取初始聚类中心和聚类数目,然后使用基于梯度的分水岭算法对原始彩色图像进行预分割,得到一系列由色彩特征空间具有一致性的点构成的子集,最后对这些子集的中心进行模糊聚类。实验结果表明：由于子集数量远小于原始图像像素数目,使聚类样本数量显著减少,大大提高了聚类速度,同时在聚类中以特征距离代替欧式距离,增强了算法的鲁棒性。     

面向内容检索的彩色图像分割

稳健有效的图像自动分割是面向内容图像检索中的一个重要问题，适应内容检索的需要，提出了一种融合颜色，纹理特征，采用特征聚类的彩色图像分割新算法，该算法采用线性加权方式融合颜色，纹理特征，并依据图像功率谱分布自适应确定融合权值，它采用提出的基于编码代价的自淬火（self annealing)方法对特征空间聚类，该聚类算法具有可自动确定类别数目，对初始聚类中心选择不敏感的优点，将新算法有于分割多幅自然图像，实验结果证明了算法的有效性。     

混合聚类彩色图像分割方法研究

提出了一种基于K-均值算法和EM算法混合聚类的彩色图像分割方法。首先将待分割的RGB彩色图像转化成YUV空间模型,然后将该图像分割成n小块,对每个块的颜色分量用改进的K-均值聚类算法进行聚类分析,最后用EM聚类算法对每个块进行聚类,分割源图像。对K-均值算法和EM算法的初始聚类中心引进了改进算法,加快了算法的收敛速度。并与相似的分割方法进行了比较实验,给出了详细的实验结果与分析。实验表明该方法分割速度快,效果好,具有较高的实用价值。     

基于特征加权的自适应FCM彩色图像分割算法

图像分割是模式识别、图像理解、计算机视觉等领域的重要研究内容.基于模糊C均值聚类(FCM)的图像分割是应用较为广泛的方法之一,但其存在需预先给出初始聚类数目,且要考虑各个特征对分类的不同影响等问题.通过引入ReliefF技术进行特征加权,结合聚类有效性指数自适应确定初始聚类数目、根据Laws纹理测度提取图像特征等措施,提出了一种新的FCM彩色图像分割算法.实验结果表明,该算法可以有效地提高图像分割效果,分割结果优于现有FCM图像分割方案.     

Multispectral remote sensing image segmentation using rival penalized controlled competitive learning and fuzzy entropy

This paper proposes an image segmentation approach for multispectral remote sensing imagery based on rival penalized controlled competitive learning (RPCCL) and fuzzy entropy. In this approach, the clustering center component for each band of the image is first chosen based on the fuzzy entropy histogram of the corresponding band of the image. The initial clustering centers are then formed by combining the obtained clustering center components. The number of clusters and the real clustering centers are then determined by the use of the RPCCL method. The advantages of the proposed approach are the appropriate initial cluster centers and the fact that the number of clusters is determined automatically. The results of the experiments showed that without providing the number of clustering centers before the clustering operation, the proposed method can effectively perform an unsupervised segmentation of remote sensing images.     

快速模糊C均值聚类彩色图像分割方法

模糊C均值(FCM)聚类用于彩色图像分割具有简单直观、易于实现的特点，但存在聚类性能受中心点初始化影响且计算量大等问题，为此，提出了一种快速模糊聚类方法(FFCM)。这种方法利用分层减法聚类把图像数据分成一定数量的色彩相近的子集，一方面，子集中心用于初始化聚类中心点；另一方面，利用子集中心点和分布密度进行模糊聚类，由于聚类样本数量显著减少以及分层减法聚类计算量小，故可以大幅提高模糊C均值算法的计算速度，进而可以利用聚类有效性分析指标快速确定聚类数目。实验表明，这种方法不需事先确定聚类数目并且在优化聚类性能不变的前提下，可以使模糊聚类的速度得到明显提高，实现彩色图像的快速分割。     

A cost-function approach to rival penalized competitive learning (RPCL).

Rival penalized competitive learning (RPCL) has been shown to be a useful tool for clustering on a set of sample data in which the number of clusters is unknown. However, the RPCL algorithm was proposed heuristically and is still in lack of a mathematical theory to describe its convergence behavior. In order to solve the convergence problem, we investigate it via a cost-function approach. By theoretical analysis, we prove that a general form of RPCL, called distance-sensitive RPCL (DSRPCL), is associated with the minimization of a cost function on the weight vectors of a competitive learning network. As a DSRPCL process decreases the cost to a local minimum, a number of weight vectors eventually fall into a hypersphere surrounding the sample data, while the other weight vectors diverge to infinity. Moreover, it is shown by the theoretical analysis and simulation experiments that if the cost reduces into the global minimum, a correct number of weight vectors is automatically selected and located around the centers of the actual clusters, respectively. Finally, we apply the DSRPCL algorithms to unsupervised color image segmentation and classification of the wine data.     

Fuzzy homogeneity and scale-space approach to color image segmentation

Image segmentation is the procedure in which the original image is partitioned into homogeneous regions, and has many applications. In this paper, a fuzzy homogeneity and scale-space approach to color image segmentation is proposed. A color image is transformed into fuzzy domain with maximum fuzzy entropy principle. The fuzzy homogeneity histogram is employed, and both global and local informations are considered when we process fuzzy homogeneity histogram. The scale-space filter is utilized for analyzing the fuzzy homogeneity histogram to find the appropriate segments of the homogeneity histogram bounded by the local extrema of the derivatives. A fuzzy region merging process is then implemented based on color difference and cluster sizes to avoid over-segmentation. The proposed method is compared with the space domain approach, and experimental results demonstrate the effectiveness of the proposed approach.     

一种快速的模糊C均值聚类彩色图像分割方法

FCM用于彩色图像分割存在聚类数目需要事先确定、计算速度慢的问题,为此,提出一种快速的模糊C均值聚类方法（FFCM）。首先,对原始彩色图像进行基于梯度图的分水岭变换,从而把原始彩色图像数据分成一些具有色彩一致性的子集;然后,利用这些子集的大小和中心点进行模糊聚类。由于FFCM聚类样本数量显著减小,因此可以大幅提高模糊C均值聚类算法的计算速度,进而可以采用聚类有效性指标确定聚类数目。实验表明,这种方法不需要事先确定聚类数目,在聚类有效性能不变的前提下,可以使模糊聚类的速度得到明显提高,实现了彩色图像的快速分割。     

On rival penalization controlled competitive learning for clustering with automatic cluster number selection

The existing rival penalized competitive learning (RPCL) algorithm and its variants have provided an attractive way to perform data clustering without knowing the exact number of clusters. However, their performance is sensitive to the preselection of the rival delearning rate. In this paper, we further investigate the RPCL and present a mechanism to control the strength of rival penalization dynamically. Consequently, we propose the rival penalization controlled competitive learning (RPCCL) algorithm and its stochastic version. In each of these algorithms, the selection of the delearning rate is circumvented using a novel technique. We compare the performance of RPCCL to RPCL in Gaussian mixture clustering and color image segmentation, respectively. The experiments have produced the promising results.     

Robust color image segmentation using fuzzy c-means with weighted hue and intensity

In this paper we propose a novel method for color image segmentation. This method uses only hue and intensity components (which are chosen rationally) of image and combines those by adaptive tuned weights in a specially defined fuzzy c-means cost function. The tuned weights indicate how informative every color component (hue and intensity) is. Obtaining tuned weights begins with finding peaks of hue and intensity's histograms and continues by obtaining the table of the frequencies of hue and intensity values and computing entropy and contrast of every color component. Also this method specifies proper initial values for cluster centers with the aim of reducing the overall number of iterations and avoiding converging of FCM to wrong centroids. Experimental results demonstrate that our algorithm achieves better segmentation performance and also runs faster than similar methods.     

基于形态学梯度的分水岭彩色图像分割

图像分割是从图像处理到图像分析的关键步骤之一。在改进了基于地形学距离的分水岭算法的基础上,提出了一种结合图像信息熵、形态学梯度与区域合并的图像分割方法。该算法首先利用信息熵在RGB颜色空间中对彩色图像求其形态学梯度,然后对彩色梯度图进行分水岭分割,最后对分水岭产生的过分割现象进行区域合并。通过Matlab对图像进行实验,结果证明该算法不仅能够减少分水岭算法的过分割现象,而且还提高了图像分割的精确性,同时在图像分割时具有很好的鲁棒性和适应性。