FCM Clustering Research Articles

Brain Tumor Segmentation and identification based on Image Processing FCM Clustering Algorithm

Brain Tumor Segmentation and identification based on Image Processing FCM Clustering Algorithm

Enhanced Forecasting Accuracy of Fuzzy Time Series Model Based on Combined Fuzzy C-Mean Clustering with Particle Swam Optimization

Over the past 25 years, numerous fuzzy time series forecasting models have been proposed to deal the complex and uncertain problems. The main factors that affect the forecasting results of these models are partition universe of discourse, creation of fuzzy relationship groups and defuzzification of forecasting output values. So, this study presents a hybrid fuzzy time series forecasting model combined particle swarm optimization (PSO) and fuzzy C-means clustering (FCM) for solving issues above. The FCM clustering is used to divide the historical data into initial intervals with unequal size. After generating interval, the historical data is fuzzified into fuzzy sets with the aim to serve for establishing fuzzy relationship groups according to chronological order. Then the information obtained from the fuzzy relationship groups can be used to calculate forecasted value based on a new defuzzification technique. In addition, in order to enhance forecasting accuracy, the PSO algorithm is used for finding optimum interval lengths in the universe of discourse. The proposed model is applied to forecast three well-known numerical datasets (enrolments data of the University of Alabama, the Taiwan futures exchange —TAIFEX data and yearly deaths in car road accidents in Belgium). These datasets are also examined by using some other forecasting models available in the literature. The forecasting results obtained from the proposed model are compared to those produced by the other models. It is observed that the proposed model achieves higher forecasting accuracy than its counterparts for both first—order and high—order fuzzy logical relationship.

MapReduce FCM clustering set algorithm

Fuzzy C-means clustering integration algorithm is a method to improve clustering quality by using integration ideas, but as the amount of data increases, its time complexity increases. A parallel FCM clustering integration algorithm based on MapReduce is proposed. The algorithm uses a random initial clustering centre to obtain differentiated cluster members. By establishing an overlapping matrix between clusters, the clustering labels are unified to find logical equivalence clusters. The cluster members share the classification information of the data objects by voting to obtain the final clustering result. The experimental results show that the parallel FCM clustering integration algorithm has good performance, and has high speedup and good scalability.

A Novel Segmentation Method for Brain MRI Using a Block-Based Integrated Fuzzy C-Means Clustering Algorithm

Accurate segmentation of brain tissue has important guiding significance and practical application value for the diagnosis of brain diseases. Brain magnetic resonance imaging (MRI) has the characteristics of high dimensionality and large sample size. Such datasets create considerable computational complexity in image processing. To efficiently process large sample data, this article integrates the proposed block clustering strategy with the classic fuzzy C-means clustering (FCM) algorithm and proposes a block-based integrated FCM clustering algorithm (BI-FCM). The algorithm first performs block processing on each image and then clusters each subimage using the FCM algorithm. The cluster centers for all subimages are again clustered using FCM to obtain the final cluster center. Finally, the distance from each pixel to the final cluster center is obtained, and the corresponding division is performed according to the distance. The dataset used in this experiment is the Simulated Brain Database (SBD). The results show that the BI-FCM algorithm addresses the large sample processing problem well, and the theory is simple and effective.

Failure recognition method of rolling bearings based on the characteristic parameters of compressed data and FCM clustering

Failure recognition method of rolling bearings based on the characteristic parameters of compressed data and FCM clustering

Intelligent Fault Diagnosis of Rolling Bearing Using FCM Clustering of EMD-PWVD Vibration Images

Rolling bearing is key component of rotating machinery and its fault diagnosis is of great significance for reliable operation of machine. In this paper, an intelligent fault diagnosis method of rolling bearing based on FCM clustering of vibration images obtained by EMD-PWVD is presented. Firstly, vibration signals with different fault degrees are transformed into contour time-frequency images by EMD-PWVD. Secondly, vibration images are divided into sections and their energy distribution values are used as image feature. Then, feature vectors are constructed for known signals, which are standardized as inputs of FCM clustering to obtain classification matrix and clustering center. Finally, proximity between tested samples and clustering centers of known samples are calculated to realize identification of bearing faults. Experimental results show that identification accuracy of this proposed method is high. When adding noise, the proposed method is more stable than other vibration images such as grayscale and symmetrical polar coordinate image, and when the added noise with SNR of 5, the reduction rate of identification accuracy is obviously smaller than those of other two methods.

Toward Group Applications of Zinc-Silver Battery: A Classification Strategy Based on PSO-LSSVM

To solve problem of the reliability and consistency of silver-zinc batteries after being sorted into groups, a proposed classification strategy of zinc-silver battery based on least squares support vector machine with PSO (PSO-LSSVM) was proposed in this paper. Sample data was extracted from the charging curve of silver-zinc batteries to pre-sort training samples using FCM clustering. The least squares support vector machine model parameters were optimized and improved using particle swarm optimization algorithm. The method breaks the limitation of building battery classification model based on prior knowledge, reduces the dependence on parameter selection, and enhances model training speed and accuracy. In the end, experimental data was used for battery classification model training and testing. Test results show that the battery pack obtained by the group strategy has good dynamic consistency, the rate of capacity decay is significantly reduced. The rate of capacity decay is no more than 10% after 30 cycles of life test. The silver-zinc battery group classification strategy proposed to this paper improves the consistency and reliability of the battery and the life of battery packs.

A Wind Farm Equivalent Method Based on Multi-View Transfer Clustering and Stack Sparse Auto Encoder

Large-scale wind farm (WF) constitutes dozens or even hundreds of wind turbines (WTs), making it complex and even impractical to develop each individual WT in detail when building WF model. Thus, the equivalent model of WF, with a reasonable reduction of the detailed model, is essential to be developed. In this paper, we propose a multi-view transfer clustering and stack sparse auto encoder (SSAE) based WF equivalent method, which can be used in the low voltage ride through (LVRT) analysis of WF. First, to obtain distinguishable deep-level and multi-view representation of wind turbine (WT), stack sparse auto encoder (SSAE) is used to extract features from the time series of several WT physical quantities, and these features are used as the clustering indicator (CI). Then, a multi-view transfer FCM (MVT-FCM) clustering algorithm, which combines transfer learning with multi-view FCM (MV-FCM), is put forward for WTs clustering. Two transfer rules are designed in this algorithm, and the clustering center and membership degree in the source domain are transferred to guide the clustering process of target domain samples. Finally, the calculation method of equivalent parameters is presented. To verify the effectiveness of the proposed method, a modified actual system in East Inner Mongolia of China is utilized for case study, and the performance of the proposed model is compared with several state-of-the-art models. Simulation results show that the equivalent errors of the proposed model decrease at least 3% when comparing with other models. Also, the error fluctuations are within 6% under different simulation conditions, which illustrates the well-performed robustness of the proposed model.

Infrared image-based detection method of electrical equipment overheating area in substation

For the detection of overheated areas of electrical equipment, in order to accurately segment out the overheated areas and reduce the fault detection range, this paper proposes a new overheated area detection algorithm. Firstly, the Ostu algorithm is used to remove the background and segment the general area of the electrical equipment area; secondly, the active contour model is used to refine the edge of the target area to remove the redundant edge points; finally, FCM clustering algorithm is used to suppress over segmentation and accurately divide the overheated area. The experiment proves that the algorithm can accurately divide the overheated area, and has certain practical value.

Change Detection Algorithm for Multi-Temporal Remote Sensing Images Based on Adaptive Parameter Estimation

This paper proposes a multi-temporal image change detection algorithm based on adaptive parameter estimation, which is used to solve the problems of severe interference of coherent speckle noise and the retention of detailed information about changing regions in synthetic aperture radar remote sensing images. The change area in the initial differential image has local consistency and global prominence. By detecting the significant area to locate similar change areas, the coherent speckle noise outside the area can be eliminated. The use of hierarchical FCM clustering to automatically generate training samples can improve the reliability of training samples. In addition, in order to increase the distinction between the changed area and the non-changed area, a sparse automatic encoder is used to extract the changed features and generate a change detection map. Experiments using 4 sets of SAR images show that the algorithm can effectively reduce the effect of speckle noise on detection accuracy, the extraction of changing areas is more complete and meticulous, and the false detection rate is greatly reduced. Since the images in different time phases will be disturbed by weather, clouds, sea water, etc., the target segmentation algorithm can be used to extract the target of interest and highlight the changing area. Principal component analysis and k-means clustering method are used to reduce the influence of isolated pixels, and change information is extracted to obtain different images. The experiment uses four sets of image data of islands and reefs. The experiment proves that the algorithm can well eliminate external interference, improve the accuracy of change detection, and have a good detection effect on the area of islands and reefs. The adaptive parameter estimation plays a good role in the detection of changing areas, and the visual effect is better, which can improve the accuracy of the detection results.

Automatic measurement of traditional Chinese costume from its silhouette through Fuzzy c-means clustering method

As the precious cultural heritage of the Chinese nation, traditional costumes are in urgent need of scientific research and protection. In particular, there are scanty studies on costume silhouettes, due to the reasons of the need for cultural relic protection, and the strong subjectivity of manual measurement, which limit the accuracy of quantitative research. This paper presents an automatic measurement method for traditional Chinese costume dimensions based on fuzzy C-means clustering and silhouette feature point location. The method is consisted of six steps: (1) costume image acquisition; (2) costume image preprocessing; (3) color space transformation; (4) object clustering segmentation; (5) costume silhouette feature point location; and (6) costume measurement. First, the relative total variation model was used to obtain the environmental robustness and costume color adaptability. Second, the FCM clustering algorithm was used to implement image segmentation to extract the outer silhouette of the costume. Finally, automatic measurement of costume silhouette was achieved by locating its feature points. The experimental results demonstrated that the proposed method could effectively segment the outer silhouette of a costume image and locate the feature points of the silhouette. The measurement accuracy could meet the requirements of industrial application, thus providing the dual value of costume culture research and industrial application.

Segmentation of Multi-Tumor from PET/CT Images

The aim of the project is to develop a methodology for automatic segmentation of multiple tumor from PET/CT images. Image pre-processing methods such as Contrast Limited Adaptive Histogram Equalization (CLAHE), image sharpening and Wiener filtering were performed to remove the artifacts due to contrast variations and noise. The image was segmented using K-means, Threshold segmentation, watershed segmentation, FCM clustering Segmentation, Mean shift Clustering Segmentation, Graph Cut Segmentation. Evaluation was made for the segmentation against the Ground Truth. Various Features was selected and extracted. Classification was made using SVM classifier and KNN classifier to classify the tumor as benign or malignant. The proposed method was carried out using PET/CT images of lung cancer patients and implemented using MATLAB.

Identification of Blood Vessel Clot Region using Fuzzy C Means Clustering Based Artificial Bee Colony Algorithm

Medical image segmentation results in the multiple fractioning of an input image for a deeper analysis/insight. Localization of objects and detection of boundaries are the core-theme of using segmentation for medical images. It elucidates the process of finding the anatomic structures in medical images. In this paper, we put forth a technique that has Fuzzy C-Means clustering and Artificial Bee Colony (ABC) Optimization has delivered the segmentation of MRA brain image. Artificial Bee Colony (ABC) has been used by many researchers as it is a population-based stochastic approach that has better search-in-space abilities for various optimization problems. The unsupervised clustering FCM has produced candidate outcomes in medical image processing. FCM is mostly preferable for segmenting the soft tissues in brain model, and it provides better output when compared to some of the competitive clustering techniques like KM, EM and KNN. The output of the suggested techniques is verified by using real MRA brain images. The results of Statistical parameters show that our method is notably better compared to other algorithms.

Magnetotelluric Signal-Noise Separation Using IE-LZC and MP

Eliminating noise signals of the magnetotelluric (MT) method is bound to improve the quality of MT data. However, existing de-noising methods are designed for use in whole MT data sets, causing the loss of low-frequency information and severe mutation of the apparent resistivity-phase curve in low-frequency bands. In this paper, we used information entropy (IE), the Lempel–Ziv complexity (LZC), and matching pursuit (MP) to distinguish and suppress MT noise signals. Firstly, we extracted IE and LZC characteristic parameters from each segment of the MT signal in the time-series. Then, the characteristic parameters were input into the FCM clustering to automatically distinguish between the signal and noise. Next, the MP de-noising algorithm was used independently to eliminate MT signal segments that were identified as interference. Finally, the identified useful signal segments were combined with the denoised data segments to reconstruct the signal. The proposed method was validated through clustering analysis based on the signal samples collected at the Qinghai test site and the measured sites, where the results were compared to those obtained using the remote reference method and independent use of the MP method. The findings show that strong interference is purposefully removed, and the apparent resistivity-phase curve is continuous and stable. Moreover, the processed data can accurately reflect the geoelectrical information and improve the level of geological interpretation.

Project Scheduling using Event Based Scheduler with ABC

Scheduling is the first and foremost step for every project implementation. Project scheduling could be a mechanism to communicate what tasks has to be compelled to get done and which resources are going to be allotted to finish those tasks in what timeframe. Project scheduling occurs during the planning phase of the project. The problem comprises the correct assignment of employees to the various tasks that frame a software project, casing in time and cost limitations. To accomplish this objective, this paper presents and discusses the EBS with ACO, FCM clustering and EBS with ABC and the conclusions are drawn from it. First, to schedule human resources to tasks we implement Event based scheduler with the Ant colony optimization algorithm (ACO) for probabilistic optimization, second, for fast scheduling we implemented Fuzzy c means clustering to assign similar data points of employees to clusters so that the searching space will be reduced. Third, for optimum scheduling we apply Artificial Bee Colony algorithm with Event Based Scheduler. Artificial bee colony (ABC) is an optimization algorithm based on stochastic calculation which has demonstrated good search capacities on numerous advancement issues. Based on these findings we briefly describe the scheduling with FCM-EBS with ABC prompt optimum values.

Generating of Fuzzy Rule Bases with Gaussian Parameters Optimized via Fuzzy C-Mean and Ordinary Least Square

The fuzzy rule bases has a central role in the fuzzy inference system. Generating of rule bases based on input-output data pairs by using Fuzzy C-Mean clustering (FCM) requires parameters setting of the membership function (mf). In the Gaussian mf, the mean and spread parameters must be determined. The outputs of FCM clustering include the cluster center and the partition matrix of each object. The value of cluster center can be used as the center parameter, but the spread parameter is usually determined as a constant value. The research proposes a method to determine spread parameter of Gaussian mf by using Ordinary Least Square (OLS) approach with using the partition matrix as the membership degree of each object in the cluster. The magnitude of cluster centers (n) of 3, 5, and 7 are considered as FCM input to cluster the weekly price of soybeans in East Java, Indonesia on the period of January 2014 to December 2017. Based on each cluster center, the optimal spread value of a Gaussian mf is obtained via OLS. This research succeeded in getting a spread values that could approach almost perfectly each element of the partition matrix.

Generating of Fuzzy Rule Bases with Gaussian Parameters Optimized via Fuzzy C-Mean and Ordinary Least Square

The fuzzy rule bases has a central role in the fuzzy inference system. Generating of rule bases based on input-output data pairs by using Fuzzy C-Mean clustering (FCM) requires parameters setting of the membership function (mf). In the Gaussian mf, the mean and spread parameters must be determined. The outputs of FCM clustering include the cluster center and the partition matrix of each object. The value of cluster center can be used as the center parameter, but the spread parameter is usually determined as a constant value. The research proposes a method to determine spread parameter of Gaussian mf by using Ordinary Least Square (OLS) approach with using the partition matrix as the membership degree of each object in the cluster. The magnitude of cluster centers (n) of 3, 5, and 7 are considered as FCM input to cluster the weekly price of soybeans in East Java, Indonesia on the period of January 2014 to December 2017. Based on each cluster center, the optimal spread value of a Gaussian mf is obtained via OLS. This research succeeded in getting a spread values that could approach almost perfectly each element of the partition matrix

Robust and Accurate Automated Methods for Detection and Segmentation of Brain Tumor in MRI

In this proposed study, a novel Multimodal brain MR image segmentation method is presented to overcome the unattractive and undesirable over segmentation characteristics of conventional Watershed method. The proposed work, presents Optimal Region Amalgamation Technique (RAT) that merge the Watershed method (spatial domain) and Fuzzy C-means clustering (feature spaces) to reduce the unattractive and undesirable over segmentation in brain MR images. In the proposed work, to improve the quality of segmentation results of Watershed method, initially it construct a RAG(Region Merging Graph) for optimal RAT by applying the most popular MRF(Markov Random Field) method . Consequently, the inter-region comparison is presented by applying the watershed method in Spatial Domain and Fuzzy C-Means clustering method in Feature Space for image mapping to compute the Optimal Region Amalgamation. Further, to determine the Feature space and domain space illustration of the brain MR image segmentation, the SGD (Spatial Graph Depiction) is presented that is computed with FSD (Feature Space Depiction) which is obtained by watershed partitioning and FCM clustering method. The experimental results on multimodal brain MR image datasets presents that the proposed novel Optimal Region Amalgamation Technique (RAT) exhibits more promising MR images segmentation results with compared to the traditional watershed method. Finally, an assessment and evaluation of the state-of-the-art brain tumor segmentation methods are presented and future directions to improve and standardize the detection and segmentation of brain tumor into daily clinical treatment are addressed.

3D SOM Initialization Pattern Dictionary Algorithm Based on FCM Clustering

Aiming at the problem that the three-dimensional SOM reconstruction effect of the traditional pattern dictionary initialization algorithm is sensitive to the input order of the pattern, a three-dimensional SOM initialization mode dictionary algorithm based on FCM clustering is proposed. Calculate the mean square error of the training vector set and use the FCM algorithm to aggregate the resulting mean square differences into three categories. The average values are arranged in ascending order, and a certain pattern is extracted in the training vector at the same interval to form an initial pattern dictionary. The experimental results show that the 3D SOM initialization mode dictionary algorithm based on FCM clustering reduces the search time, increases the source matching degree, and improves the overall performance of the 3D SOM algorithm.

Segmentation of Relevant Region in Breast Histopathology Images using FCM with Guided Initialization

This study proposes a modified initialization approach for the conventional FCM, namely FCM with guided initialization. The FCM with guided initialization was implemented to segment the relevant regions in the breast histopathology images. The initialization method to select initial centers is based on the Cyan (C) channel histogram. Area Overlap Measure (AOM) and Combined Equal Importance (CEI) were used to evaluate the performance of the proposed FCM with guided initialization. The obtained AOM and CEI for the overall dataset achieved promising results: 0.89 in AOM and 0.88 in CEI. When comparing the number of iterations required to complete the proposed FCM clustering algorithm, the FCM with guided initialization is found to be effective in reducing the search space by showing a lower number of iterations.