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

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

An efficient hybrid data clustering method based on K-harmonic means and Particle Swarm Optimization

Clustering is the process of grouping data objects into set of disjoint classes called clusters so that objects within a class are highly similar with one another and dissimilar with the objects in other classes. K-means (KM) algorithm is one of the most popular clustering techniques because it is easy to implement and works fast in most situations. However, it is sensitive to initialization and is easily trapped in local optima. K-harmonic means (KHM) clustering solves the problem of initialization using a built-in boosting function, but it also easily runs into local optima. Particle Swarm Optimization (PSO) algorithm is a stochastic global optimization technique. A hybrid data clustering algorithm based on PSO and KHM (PSOKHM) is proposed in this research, which makes full use of the merits of both algorithms. The PSOKHM algorithm not only helps the KHM clustering escape from local optima but also overcomes the shortcoming of the slow convergence speed of the PSO algorithm. The performance of the PSOKHM algorithm is compared with those of the PSO and the KHM clustering on seven data sets. Experimental results indicate the superiority of the PSOKHM algorithm.     

K-harmonic means clustering algorithm using feature weighting for color image segmentation

This paper mainly proposes K-harmonic means (KHM) clustering algorithms using feature weighting for color image segmentation. In view of the contribution of features to clustering, feature weights which can be updated automatically during the clustering procedure are introduced to calculate the distance between each pair of data points, hence the improved versions of KHM and fuzzy KHM are proposed. Furthermore, the Lab color space, local homogeneity and texture are utilized to establish the feature vector to be more applicable for color image segmentation. The feature group weighting strategy is introduced to identify the importance of different types of features. Experimental results demonstrate the proposed feature group weighted KHM-type algorithms can achieve better segmentation performances, and they can effectively distinguish the importance of different features to clustering.

     

基于二维直方图的图像模糊聚类分割新方法

基于二维直方图的模糊聚类分割算法可以有效地抑制噪声的干扰。但是,FCM算法用于图像数据聚类时的最大缺陷是运算的开销太大,这就限制了这种方法在图像分割中的应用。该文根据FCM算法和灰度图像的特点,提出了一种适用于灰度图像分割的抑制式模糊C-均值聚类算法(S-FCM)。通过调节抑制因子α来提高分割速度和分类的正确率。实验结果表明,新算法对小目标灰度图像的分割效果优于FCM算法。     

一种基于约束关系的电子病历图像分割核聚类算法

针对电子病历中图像分割问题，提出了基于约束关系的改进核聚类算法，该算法通过引入约束关系在图像分割前进行修正，从而提高图像分割效果。该核聚类算法在MRI中电子病历图像分割实验的结果表明，施加约束关系的核聚类算法能有效地解决电子病历图像中含噪声以及灰度不均匀等问题，具有一定的鲁棒性和较好的图像分割效果。     

A Comparative Study of Classical Clustering Method and Cuckoo Search Approach for Satellite Image Clustering: Application to Water Body Extraction

Image clustering is a critical and essential component of image analysis to several fields and could be considered as an optimization problem. Cuckoo Search (CS) algorithm is an optimization algorithm that simulates the aggressive reproduction strategy of some cuckoo species.

In this paper, a combination of CS and classical algorithms (KM, FCM, and KHM) is proposed for unsupervised satellite image classification. Comparisons with classical algorithms and also with CS are performed using three cluster validity indices namely DB, XB, and WB on synthetic and real data sets. Experimental results confirm the effectiveness of the proposed approach.     

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

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

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

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

Adaptive spatial information-theoretic clustering for image segmentation

The incorporation of spatial context into clustering algorithms for image segmentation has recently received a significant amount of attention. Many modified clustering algorithms have been proposed and proven to be effective for image segmentation. In this paper, we propose a different framework for incorporating spatial information with the aim of achieving robust and accurate segmentation in case of mixed noise without using experimentally set parameters based on the original robust information clustering (RIC) algorithm, called adaptive spatial information-theoretic clustering (ASIC) algorithm. The proposed objective function has a new dissimilarity measure, and the weighting factor for neighborhood effect is fully adaptive to the image content. It enhances the smoothness towards piecewise-homogeneous segmentation and reduces the edge blurring effect. Furthermore, a unique characteristic of the new information segmentation algorithm is that it has the capabilities to eliminate outliers at different stages of the ASIC algorithm. These result in improved segmentation result by identifying and relabeling the outliers in a relatively stronger noisy environment. Comprehensive experiments and a new information-theoretic proof are carried out to illustrate that our new algorithm can consistently improve the segmentation result while effectively handles the edge blurring effect. The experimental results with both synthetic and real images demonstrate that the proposed method is effective and robust to mixed noise and the algorithm outperforms other popular spatial clustering variants.     

Maneuvering target oriented digital camouflage image generation method

Since the digital camouflage generation method based on fixed single background image cannot fully meet the hidden need of maneuvering targets. In this paper, a method of generating digital camouflage image based on several background images is proposed. Firstly, according to the active range of the maneuvering target, several background images are collected. Secondly, in order to resolve the problem that the clustering algorithm is sensitive to the initial clustering center and easy to fall into local optimum, K-harmonic means (KHM) clustering algorithm is introduced and initial clustering center is determined based on color histogram. Again, KHM clustering is used to extract color features from several background images, the first clustering is extracted from a single background image, and the second clustering is extracted with several color features sets extracted from the first clustering of background images as input. Finally, the regular hexagon is used as the basic unit of the digital camouflage image to construct the spot template, and the digital camouflage image is generated by the lowest horizontal line algorithm. Example verification and camouflage effect detection show that the digital camouflage image generated by this method can effectively realize the concealment of maneuvering targets and has good camouflage effect.     

基于二维直方图和改进蚁群聚类的图像分割

图像分割是图像处理和图像分析的重要基础。基本蚁群算法蚂蚁的搜索是随机的,计算量大,不利于算法的收敛。因此,文中提出了一种基于二维直方图和改进的蚁群聚类算法的图像分割方法,改进了应用传统分割方法分割图像效果不佳的问题。蚁群聚类算法是一种具有离散性、并行性、鲁棒性和模糊聚类能力的进化方法。文中基于此传统算法,通过二维直方图设置初始聚类中心来减少蚁群算法循环次数,定义了一种新的引导函数,并通过改进信息素更新机制提高蚁群聚类的速度。实验证明,该算法是一种比较准确、快速的图像分割方法。     

基于混沌粒子群和模糊聚类的图像分割算法*

模糊C-均值聚类算法(FCM)是一种结合模糊集合概念和无监督聚类的图像分割技术,适合灰度图像中存在着模糊和不确定的特点;但该算法受初始聚类中心和隶属度矩阵的影响,易陷入局部极小.利用混沌非线性动力学具有遍历性、随机性等特点,结合粒子群的寻优特性,提出了一种基于混沌粒子群模糊C-均值聚类(CPSO-FCM)的图像分割算法.实验证明,该方法不仅具有防止粒子因停顿而收敛到局部极值的能力,而且具有更快的收敛速度和更高的分割精度.     

Skin cancer extraction with optimum fuzzy thresholding technique

This paper discusses a new approach to segment different types of skin cancers using fuzzy logic approach. The traditional skin cancer segmentation involves the analysis of image features to delineate the cancerous region from the normal skin. Using low level features such as colour and intensity, segmentation can be done by obtaining a threshold level to separate the two regions. Methods like Otsu optimisation provide a quick and simple process to optimise such threshold level; however this process is prone to the lighting and skin tone variations. Fuzzy clustering algorithm has also been widely used in image processing due to its ability to model the fuzziness of human visual perception. Classical fuzzy C means (FCM) clustering algorithm has been applied to image segmentation with good results; however, the classical FCM is based on type-1 fuzzy sets and is unable to handle uncertainties in the images. In this paper, we proposed an optimum threshold segmentation algorithm based on type-2 fuzzy sets algorithms to delineate the cancerous area from the skin images. By using the 3D colour constancy algorithm, the effect of colour changes and shadows due to skin tone variation in the image can be significantly reduced in the preprocessing stage. We applied the optimum thresholding technique to the preprocessed image over the RGB channels, and combined individual results to achieve the overall skin cancer segmentation. Compared to the Otsu algorithm, the proposed method is less affected by the shadows and skin tone variations. The results also showed more tolerance at the boundary of the cancerous area. Compared with the type-1 FCM algorithm, the proposed method significantly reduced the segmentation error at the normal skin regions.     

Novel modified fuzzy c-means algorithm with applications

Fuzzy c-means (FCM) clustering algorithm has been widely used in many medical image segmentations. However, the conventionally standard FCM algorithm is noise sensitive because of not taking into account the spatial information. To overcome the above problem, a novel modified FCM algorithm (called FCM–AWA later) for image segmentation is presented in this paper. The algorithm is realized by modifying the objective function in the conventional FCM algorithm, i.e., by incorporating the spatial neighborhood information into the standard FCM algorithm. An adaptive weighted averaging (AWA) filter is given to indicate the spatial influence of the neighboring pixels on the central pixel. The parameters (weighting coefficients) of control template (neighboring widow) are automatically determined in the implementation of the weighted averaging image by a predefined nonlinear function. The presented algorithm is applied to both artificial synthesized image and real image. Furthermore, the quantifications of dental plaque using proposed algorithm-based segmentation were conducted. Experimental results show that the presented algorithm performs more robust to noise than the standard FCM algorithm and another FCM algorithm (proposed by Ahmed) do. Furthermore, the results of dental plaque quantification using proposed method indicate the FCM–AWA provides a quantitative, objective and efficient analysis of dental plaque, and possesses great promise.     

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.     

基于Canopy聚类的噪声自适应模糊C-均值算法

针对局部空间信息的模糊C-均值算法（WFLICM）中空间影响因子容易受到噪声影响出现错误标识的问题,提出一种融合局部和非局部空间信息的模糊C-均值聚类图像分割算法(NLWFLICM),在WFLICM算法的模糊影响因子中引入非局部空间信息,根据噪声程度自适应地设置局部和非局部信息权重,并重新标记中心点的模糊影响因子。实验结果表明,NLWFLICM算法具有比WFLICM算法更强的鲁棒性和自适应性,并在一定程度上提高了WFLICM算法对含有大量噪声图像进行分割的鲁棒性,同时保留了图像的纹理。为了提高算法的聚类性能和收敛速度,结合Canopy算法能够快速对数据进行粗聚类的优点,提出基于Canopy聚类与非局部空间信息的FCM图像分割改进算法（Canopy-NLWFLICM）,可以在NLWFLICM算法聚类前,对聚类中心进行预处理,从而提高收敛速度和图像分割精度。     

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

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

A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering

Clustering is used to group data objects into sets of disjoint classes called clusters so that objects within the same class are highly similar to each other and dissimilar from the objects in other classes. K-harmonic means (KHM) is one of the most popular clustering techniques, and has been applied widely and works well in many fields. But this method usually runs into local optima easily. A hybrid data clustering algorithm based on an improved version of Gravitational Search Algorithm and KHM, called IGSAKHM, is proposed in this research. With merits of both algorithms, IGSAKHM not only helps the KHM clustering to escape from local optima but also overcomes the slow convergence speed of the IGSA. The proposed method is compared with some existing algorithms on seven data sets, and the obtained results indicate that IGSAKHM is superior to KHM and PSOKHM in most cases.     

Image clustering segmentation based on SLIC superpixel and transfer learning

Traditional fuzzy C-means clustering algorithm has poor noise immunity and clustering results in image segmentation. To overcome this problem, a novel image clustering algorithm based on SLIC superpixel and transfer learning is proposed in this paper. In the proposed algorithm, SLIC superpixel method is used to improve the edge matching degree of image segmentation and enhances the robustness to noise. Transfer learning is adopted to correct the image segmentation result and further improve the accuracy of image segmentation. In addition, the proposed algorithm improves the original SLIC superpixel algorithm and makes the edge of the superpixel more accurate. Experimental results show that the proposed algorithm can obtain better segmentation results.