ALLIED FUZZY c-MEANS CLUSTERING MODEL

A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive to initializations and often generates coincident clusters. AFCM overcomes this shortcoming and it is an ex tension of PCM. Membership and typicality values can be simultaneously produced in AFCM. Experimental re- suits show that noise data can be well processed, coincident clusters are avoided and clustering accuracy is better.

A New Method of Wind Turbine Bearing Fault Diagnosis Based on Multi-Masking Empirical Mode Decomposition and Fuzzy C-Means Clustering

Based on Multi-Masking Empirical Mode Decomposition (MMEMD) and fuzzy c-means (FCM) clustering, a new method of wind turbine bearing fault diagnosis FCM-MMEMD is proposed, which can determine the fault accurately and timely. First, FCM clustering is employed to classify the data into different clusters, which helps to estimate whether there is a fault and how many fault types there are. If fault signals exist, the fault vibration signals are then demodulated and decomposed into different frequency bands by MMEMD in order to be analyzed further. In order to overcome the mode mixing defect of empirical mode decomposition (EMD), a novel method called MMEMD is proposed. It is an improvement to masking empirical mode decomposition (MEMD). By adding multi-masking signals to the signals to be decomposed in different levels, it can restrain low-frequency components from mixing in highfrequency components effectively in the sifting process and then suppress the mode mixing. It has the advantages of easy implementation and strong ability of suppressing modal mixing. The fault type is determined by Hilbert envelope finally. The results of simulation signal decomposition showed the high performance of MMEMD. Experiments of bearing fault diagnosis in wind turbine bearing fault diagnosis proved the validity and high accuracy of the new method.

A Fixed Suppressed Rate Selection Method for Suppressed Fuzzy C-Means Clustering Algorithm

Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.

Paraspinal Muscle Segmentation in CT Images Using GSM-Based Fuzzy C-Means Clustering

Minimally Invasive Spine surgery (MISS) was developed to treat disorders of the spine with less disruption to the muscles. Surgeons use CT images to monitor the volume of muscles after operation in order to evaluate the progress of patient recovery. The first step in the task is to segment the muscle regions from other tissues/organs in CT images. However, manual segmentation of muscle regions is not only inaccurate, but also time consuming. In this work, Gray Space Map (GSM) is used in fuzzy c-means clustering algorithm to segment muscle regions in CT images. GSM com- bines both spatial and intensity information of pixels. Experiments show that the proposed GSM- based fuzzy c-means clustering muscle CT image segmentation yields very good results.

Automated Colorization of Grayscale Images Using Texture Descriptors and a Modified Fuzzy C-Means Clustering

A novel example-based process for Automated Colorization of grayscale images using Texture Descriptors (ACTD) without any human intervention is proposed. By analyzing a set of sample color images, coherent regions of homogeneous textures are extracted. A multi-channel filtering technique is used for texture-based image segmentation, combined with a modified Fuzzy C-means (FCM) clustering algorithm. This modified FCM clustering algorithm includes both the local spatial information from neighboring pixels, and the spatial Euclidian distance to the cluster’s center of gravity. For each area of interest, state-of-the-art texture descriptors are then computed and stored, along with corresponding color information. These texture descriptors and the color information are used for colorization of a grayscale image with similar textures. Given a grayscale image to be colorized, the segmentation and feature extraction processes are repeated. The texture descriptors are used to perform Content-Based Image Retrieval (CBIR). The colorization process is performed by Chroma replacement. This research finds numerous applications, ranging from classic film restoration and enhancement, to adding valuable information into medical and satellite imaging. Also, this can be used to enhance the detection of objects from x-ray images at the airports.

Hybrid Clustering Using Firefly Optimization and Fuzzy C-Means Algorithm

Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis of the increasing data. The Firefly Algorithm (FA) is one of the bio-inspired algorithms and it is recently used to solve the clustering problems. In this paper, Hybrid F-Firefly algorithm is developed by combining the Fuzzy C-Means (FCM) with FA to improve the clustering accuracy with global optimum solution. The Hybrid F-Firefly algorithm is developed by incorporating FCM operator at the end of each iteration in FA algorithm. This proposed algorithm is designed to utilize the goodness of existing algorithm and to enhance the original FA algorithm by solving the shortcomings in the FCM algorithm like the trapping in local optima and sensitive to initial seed points. In this research work, the Hybrid F-Firefly algorithm is implemented and experimentally tested for various performance measures under six different benchmark datasets. From the experimental results, it is observed that the Hybrid F-Firefly algorithm significantly improves the intra-cluster distance when compared with the existing algorithms like K-means, FCM and FA algorithm.

一种改进的 Fuzzy c-means 聚类算法

该文提出了一种改进的ｆｕｚｚｙｃ－ｍｅａｎｓ算法（ＭＦＣＭ）。此算法是将传统算法（ＦＣＭ）直接对样本集聚类变为对特征集聚类，从而极大提高了ｆｕｚｚｙｃ－ｍｅａｎｓ的速度。证明了ＭＦＣＭ与ＦＣＭ在分类效果上的等价性，且ＭＦＣＭ较ＦＣＭ有较低的时间复杂性，讨论了ＭＦＣＭ与ＦＣＭ空间复杂性的关系。最后数值实验证实了结论。

基于空间加权距离的自适应Fuzzy C-Means算法研究

空间聚类不仅应考虑GIS对象属性特征的相似性,还应考虑对象的空间邻近性。不同属性、位置特征在聚类中起到的作用不同。采用信息熵方法计算空间距离中各属性距离、位置距离的权重,权值大小用于度量相应特征在fuzzy c-means隶属度计算时的作用大小,并引入相似性指标,当两个聚类之间的相似度高于某个合并阈值时,则对应的一对聚类进行合并,从而克服需预先设置聚类类数的问题。通过应用实例的聚类有效性分析,与普通空间距离相比,基于空间加权距离的FCM算法具有稳定性和有效性。

Soil pore identification with the adaptive fuzzy C-means method based on computed tomography images

The complex geometry and topology of soil is widely recognised as the key driver in many ecological processes. X-ray computed tomography (CT) provides insight into the internal structure of soil pores automatically and accurately. Until recently, there have not been methods to identify soil pore structures. This has restricted the development of soil science, particularly regarding pore geometry and spatial distribution. Through the adoption of the fuzzy clustering theory and the establishment of pore identification rules, a novel pore identification method is described to extract pore structures from CT soil images. The robustness of the adaptive fuzzy C-means method (AFCM), the adaptive threshold method, and Image-Pro Plus tools were compared on soil specimens under different conditions, such as frozen, saturated, and dry situations. The results demonstrate that the AFCM method is suitable for identifying pore clusters, especially tiny pores, under various soil conditions. The method would provide an optional technique for the study of soil micromorphology.

Kernel method-based fuzzy clustering algorithm

The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.

基于FCM和EO-SVM水轮机尾水管压力脉动特征识别

为有效识别水轮机尾水管压力脉动特征,提出了一种基于模糊C均值聚类、平衡优化器算法与支持向量机的识别方法。该方法首先采用平衡优化器算法优化SVM的惩罚因子和核函数以获得更好的SVM参数组合,构建EO-SVM识别模型以实现其在水轮机尾水管压力脉动特征识别中的应用。然后采用模糊C均值聚类算法将待分类的压力脉动特征进行初始聚类,将其分为四类,并依据聚类结果选择最靠近每类中心的样本作为EO-SVM模型的训练样本。将SVM和EO-SVM两种模型的识别分类结果进行比较,验证了所提EO-SVM模型的有效性。

Partition region-based suppressed fuzzy C-means algorithm

Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the objects, a novel partition region-based suppressed fuzzy C-means clustering algorithm with better capacity of adaptability and robustness is proposed in this paper. The model based on the real needs of different objects is built, making it clear to decide whether to proceed with further determination; in addition, the external user-defined suppressed parameter is automatically selected according to the intrinsic structural characteristic of each dataset, making the proposed method become robust to the fluctuations in the incoming dataset and initial conditions. Experimental results show that the proposed method is more robust than its counterparts and overcomes the weakness of the original suppressed clustering algorithm in most cases.

基于FCM-LSTM的光热发电出力短期预测

对光热电站的出力进行短期预测,可以有效应对太阳能随机性和波动性带来的影响,为电网调度做好准备.该文以青海某光热电站为例,首先使用模糊C均值聚类算法对预处理后的实验数据进行分类,然后通过分析不同聚类类型下出力和气象数据中各因子间的关联程度,充分挖掘出数据间的关系,确定不同类型预测模型的输入变量,进而构建出不同类别下的长短期记忆神经网络预测模型.结果表明,与传统长短期记忆神经网络模型、BP神经网络模型、支持向量机模型和随机森林模型的预测结果相比,基于模糊C均值聚类的长短期记忆神经网络预测模型效果良好,大幅减少了预测误差,验证了该预测模型的有效性.

基于模糊C-Means的改进型KNN分类算法

KNN算法是一种思想简单且容易实现的分类算法,但在训练集较大以及特征属性较多时候,其效率低、时间开销大.针对这一问题,论文提出了基于模糊C-means的改进型KNN分类算法,该算法在传统的KNN分类算法基础上引入了模糊C-means理论,通过对样本数据进行聚类处理,用形成的子簇代替该子簇所有的样本集,以减少训练集的数量,从而减少KNN分类过程的工作量、提高分类效率,使KNN算法更好地应用于数据挖掘.通过理论分析和实验结果表明,论文所提算法在面对较大数据时能有效提高算法的效率和精确性,满足处理数据的需求.

基于改进的模糊C-Means航迹聚类方法研究

为指导飞行程序的改善和发现管制员的指挥模式,在分析历史飞行航迹特征基础上,应用最小描绘长度(MDL)原理对航迹特征点进行划分,运用融合了遗传算法和模拟退火算法的改进的模糊C-Means算法对特征点进行聚类,通过最长公共子序列(LCS)算法得到航迹相似性矩阵,利用矩阵得到航迹簇,最后形成中心航迹,算例仿真验证了新算法的有效性。

基于改进模糊C-均值聚类的陆上风电场集电线路回路划分与拓扑结构优化

【目的】在“双碳”目标以及我国能源结构加速转型的双重驱动下,风电产业规模不断快速增长,亟须降本增效以应对平价上网压力。集电线路的造价在投资中占比较大,存在可观的优化空间。为了降低投资成本,提出了一种改进模糊C-均值(fuzzy C-means,FCM)聚类算法。【方法】利用改进FCM聚类算法对陆上风电场集电线路回路进行划分。该算法综合考虑了方位角与欧式距离,以保障回路间线路不交叉,并使相邻机组聚集到同一回路;引入机位到聚类中心距离的修正因子,通过调节其数值限制回路容量。在回路划分的基础上,利用动态Prim算法对各回路进行集电线路优化选线。最后,通过某陆上风电场算例验证方法的有效性。【结果】与只考虑方位角的聚类方法相比,考虑方位角和间距的改进FCM算法优化效果更好,单回、双回连接对应的集电线路总造价分别降低了2.6%和5.4%。【结论】所提算法能够有效降低集电线路的总造价,具有一定的应用价值,可为风电场集电线路设计提供参考。

基于MS-FCM算法的船体板熔池图像处理技术

熔池的图像处理与特征提取技术是船舶熔化极气体保护焊(gas metal arc welding, GMAW)智能化焊接质量监控的重要内容,针对船体板GMAW焊接过程中的烟雾大、飞溅多等不稳定特性导致熔池图像采集模糊、边缘提取困难等问题,提出一种基于均值漂移(mean shift, MS)优化模糊C均值聚类(fuzzy c-means, FCM)的图像处理算法.在优化设计焊接动态视觉传感系统中,以最大化保证图像信息采集清晰度的基础上,利用MS算法获取超像素图像以解决FCM算法对噪声的敏感性,同时在FCM算法上引入加权邻域窗口,以增强MS-FCM算法的鲁棒性,来克服烟雾、飞溅、弧光等噪声影响,进而完成图像分割与边缘提取.最后,设计出关于FCM、空间约束模糊C均值聚类(fuzzy c-means with spatial constraints, FCM_S)、加强型模糊聚类(enhanced fuzzy c-means, ENFCM)和模糊局部信息C均值聚类(fuzzy local information c-means clustering, FLICM)算法的4种不同图像处理方法,并与MSFCM优化模型进行边缘分割效果对比,获取几种方法所提取的熔宽,验证熔池几何特征的提取精度.结果表明,MS-FCM算法在船舶焊接熔池图像处理方面能有效抑制噪声干扰,平滑信息,达到较高的提取精度.

A New Integrated Fuzzifier Evaluation and Selection (NIFEs) Algorithm for Fuzzy Clustering

Fuzzy C-means (FCM) is simple and widely used for complex data pattern recognition and image analyses. However, selecting an appropriate fuzzifier (m) is crucial in identifying an optimal number of patterns and achieving higher clustering accuracy, which few studies have investigated. Built upon two existing methods on selecting fuzzifier, we developed an integrated fuzzifier evaluation and selection algorithm and tested it using real datasets. Our findings indicate that the consistent optimal number of clusters can be learnt from testing different fuzzifiers for each dataset and the fuzzifier with the lowest value for this consistency should be selected for clustering. Our evaluation also shows that the fuzzifier impacts the clustering accuracy. For longitudinal data with missing values, m = 2 could be an empirical rule to start fuzzy clustering, and the best clustering accuracy was achieved for tested data, especially using our multiple-imputation based fuzzy clustering.

基于粗糙集理论的模糊C-means高维数据聚类算法

模糊C-means算法是一种重要的聚类分析算法,但是在数据维数较高的情况下,该算法计算量急剧上升从而导致其效率较低.针对这一问题,提出了一种基于粗糙集理论的模糊C-means高维数据聚类算法,该算法在传统模糊C-means算法的基础上引入了粗糙集属性约简的理念,通过对数据集属性的约简,提取出对分类影响较大的属性集而摒弃与分类无关的属性,进而在聚类过程中只计算属性约简结果集中的属性,从而减少聚类过程的工作量、提高聚类效率.理论分析和实验结果表明,该算法在处理高维数据时较高效.

An Adaptive Fuzzy C-Means Algorithm for Improving MRI Segmentation

In this paper, we propose new fuzzy c-means method for improving the magnetic resonance imaging (MRI) segmenta- tion. The proposed method called “possiblistic fuzzy c-means (PFCM)” which hybrids the fuzzy c-means (FCM) and possiblistic c-means (PCM) functions. It is realized by modifying the objective function of the conventional PCM algorithm with Gaussian exponent weights to produce memberships and possibilities simultaneously, along with the usual point prototypes or cluster centers for each cluster. The membership values can be interpreted as degrees of possibility of the points belonging to the classes, i.e., the compatibilities of the points with the class prototypes. For that, the proposed algorithm is capable to avoid various problems of existing fuzzy clustering methods that solve the defect of noise sensitivity and overcomes the coincident clusters problem of PCM. The efficiency of the proposed algorithm is demonstrated by extensive segmentation experiments by applying them to the challenging applications: gray matter/white matter segmentation in magnetic resonance image (MRI) datasets and by comparison with other state of the art algorithms. The experimental results show that the proposed method produces accurate and stable results.