Particle swarm optimization and fuzzy C-means clustering algorithm for the adhesive layer defect detection

Image segmentation plays an important role in machine vision, image recognition, and imaging applications. Based on the fuzzy c-means clustering algorithm, a kernel-distance-based intuitionistic fuzzy c-means clustering (KIFCM) algorithm is proposed. First, a fuzzy complement operator is used to generate the membership degree whereby the hesitation degree of intuitionistic fuzzy set is generated; second, a kernel-induced function is used to calculate the distance from each point to the cluster center instead of the Euclidean distance; third, a new objective function that includes the hesitation degree is established, and the optimization of the objective function results in new iterative expressions for the membership degree and the cluster center. The proposed KIFCM algorithm is compared with the fuzzy c-means clustering (FCM) algorithm, the kernel fuzzy c-means clustering (KFCM) algorithm, and the intuitionistic fuzzy c-means clustering (IFCM) algorithm in segmenting five images. The experimental results verify the effectiveness and superiority of our proposed KIFCM algorithm.

An image segmentation method based on a modified local-information weighted intuitionistic Fuzzy C-means clustering and Gold-panning Algorithm

In this study, the concepts of competitive agglomeration clustering algorithm is incorporated into fuzzy c-means (FCM) clustering algorithm for symbolic interval-values data. In the proposed approach, called as IFCMwUNC clustering algorithm, the problems of the unknown clusters number and the initialization of prototypes in the FCM clustering algorithm for symbolic interval-values data are overcome and discussed. Due to the competitive agglomeration clustering algorithm possess the advantages of the hierarchical clustering algorithm and the partitional clustering algorithm, IFCMwUNC clustering algorithm can be fast converges in a few iterations regardless of the initial number of clusters. Moreover, it is also converges to the same optimal partition regardless of its initialization. Experiments results show the merits and usefulness of IFCMwUNC clustering algorithm for the symbolic interval-values data.

Parameter optimization of improved fuzzy c-means clustering algorithm for brain MR 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.

Traditional library systems are gradually being replaced by digital libraries. Digital libraries are developing from simple database-based storage and retrieval to knowledge-based implementation. The fuzzy C-means (FCM) clustering algorithm is an example of data collection and data processing technology. It evaluates and draws conclusions based on mathematics, large data, and other technologies. In order to better improve the digital library management system, this paper applied FCM clustering algorithm to the digital library management system. Based on the in-depth study of the FCM clustering algorithm, this paper built a digital library management system. The clustering algorithm was used to cluster library borrowing records and reader information. It provided technical support and suggestions on library collection construction and book purchase and promoted book management to form a good spitting cycle. The experimental results extracted during the evaluation phase demonstrated that the overall error rate of the suggested FCM clustering algorithm for information clustering is 3.66%, which is better than the existing comparative models. This shows that applying the FCM clustering algorithm to a digital library management system has some practical significance.

There is always much difficult in the MR image segmentation. Although fuzzy c-means(FCM) clustering algorithm has been widely used in the field of image segmentation study, some inherent deficiencies of this algorithm especially the high cost of computation made the algorithm to be difficult widely used in practice. A novel algorithm, based on kernel fuzzy c-means (KFCM) clustering algorithm and the k-nearest neighbor (KNN) algorithm, is proposed to improve the performance of MR image segmentation. In this algorithm, the statistical gray level histogram of image is used in KFCM algorithm to speed up the algorithm. Furthermore, the spatial information of image is also considered by k-nearest neighbor algorithm based on kernel methods. With kernel methods each pixel of image is mapped into a high-dimensional feature space where FCM algorithm and KNN algorithm are carried out. Experiments show that the proposed algorithm is effective and efficient in image segmentation.

Fuzzy C-means (FCM) clustering algorithm is an important and popular clustering algorithm which is utilized in various application domains such as pattern recognition, machine learning, and data mining. Although this algorithm has shown acceptable performance in diverse problems, the current literature does not have studies about how they can improve the clustering quality of partitions with overlapping classes. The better the clustering quality of a partition, the better is the interpretation of the data, which is essential to understand real problems. This work proposes two robust FCM algorithms to prevent ambiguous membership into clusters. For this, we compute two types of weights: an weight to avoid the problem of overlapping clusters; and other weight to enable the algorithm to identify clusters of different shapes. We perform a study with synthetic datasets, where each one contains classes of different shapes and different degrees of overlapping. Moreover, the study considered real application datasets. Our results indicate such weights are effective to reduce the ambiguity of membership assignments thus generating a better data interpretation.

Possibilistic fuzzy c-means clustering (PFCM) algorithm improves the noise sensitivity of the fuzzy c-means clustering (FCM) algorithm and the serious coincident clustering phenomenon of the possibilistic c-means clustering (PCM) algorithm. However, the Euclidean distance of the PFCM treats all features equally in the clustering process and doesn't consider the imbalance between sample features, resulting in low clustering accuracy. Furthermore, as the number of clusters increases, the PFCM still has a partially coincident clustering problem due to the lack of between-class relationships of possibilistic memberships. Therefore, a feature weighted cutset-type possibilistic fuzzy c-means clustering (FW-C-PFCM) algorithm is proposed by introducing the cutset theory and feature weights into the PFCM in this paper. Firstly, the proposed FW-C-PFCM introduces a feature weighted parameter in the objective function, and different features should take different weight values according to the distribution of samples. Secondly, the cutset theory is utilized to divide the data into inner core and outer core regions, and some possibilistic memberships inside each cluster core are modified in the iterative process. Finally, the experiments on synthetic multi-class datasets and the Iris dataset show that the FW-C-PFCM improves the partially coincident clustering phenomenon and overcomes the imbalance between sample features. The comparative experiments on a color image also indicate that the FW-C-PFCM enhances the segmentation accuracy and generates better clustering results than PFCM.

Many components of intelligent transportation systems require different levels of the traffic flow forecasting. This paper presents a novel short-term traffic flow forecasting model using a distributed radial basis function neural network (RBFNN) based on adaptive fuzzy c-means (FCM) clustering algorithm. FCM clustering algorithm is used to classify training objects into a couple of clusters, each cluster is trained by a sub RBFNN, and membership values are used for combining several RBFNN outputs to obtain the final result. In the online stage, the membership values are computed using an adaptive fuzzy clustering algorithm for the new object. The real traffic data are used to demonstrate the effectiveness of the method.

Aiming at the problem that traditional fuzzy C-means (FCM) clustering algorithm is susceptible to noise in processing noisy images, a noisy image segmentation method based on FCM wavelet domain feature enhancement is proposed. Firstly, the noise image is decomposed by two-dimensional wavelet. Secondly, the edge enhancement of the approximate coefficient is carried out, and the artificial fish swarm (AFS) optimization algorithm is used to process the threshold value of the detail coefficient, and the processed coefficient is reconstructed by wavelet transform. Finally, the reconstructed image is segmented by FCM algorithm. Five typical gray-scale images are selected by adding Gaussian noise and Salt& pepper noise, respectively, and segmented by various methods. The peak signal-to-noise ratio (PSNR) and error rate (MR) of segmented images are used as performance indexes. Experimental results show that compared with traditional FCM clustering algorithm segmentation method, particle swarm optimization (PSO) segmentation method and other methods, the indexes of image segmentation by the proposed method is greatly improved. It can be seen that the proposed segmentation method retains the texture information of image edge well, and its anti-noise performance and segmentation performance are improved.

Time-of-use price is an important means of demand side management, how to accurately divide peak and valley periods is an important problem to be solved. In this paper, an improved fuzzy c-means (FCM) clustering algorithm is proposed to solve the problem that traditional FCM clustering algorithm is sensitive to the initial clustering center and easy to fall into local optimal. This algorithm combines an improved particle swarm optimization (PSO) based on support vector machine regression (SVR) with FCM algorithm, makes full use of the strong global search ability of PSO, replaces FCM to find the clustering center at the beginning of iteration, makes it out of the local optimal, realizes fuzzy clustering, and thus classifies more accurate peak and valley periods. Finally, the improved algorithm is applied to an example of an industrial park, and a distributed energy storage system is set up. The effectiveness of the proposed method is verified by simulation.

Considering the characteristics of the inconspicuous difference between targets and backgrounds and the low contrast in infrared images, an adaptive clustering algorithm based on fuzzy particle swarm optimization is used in the infrared image processing. Fuzzy C-mean (FCM) clustering algorithm is a local search algorithm because it is easily trapped local optimum and is sensitive to initial value effectively. On the other hand, particle swarm optimization (PSO) algorithm is a global optimization algorithm. By incorporating the local search ability of FCM algorithm and the global optimization ability of PSO and taking the clustering criterion function of FCM as the object function of PSO, a new hybrid image clustering algorithm based on particle swarm optimization and fuzzy C-mean algorithm is proposed. Experiments show that the new algorithm can get the optimal threshold by the maximum entropy.

Gold immunochromatographic strip (GICS) quantitative detective can provide more information than the qualitative or semiquantitative testing. In this paper, a fast color image segmentation method is presented to develop the quantitative detective of GICS. The image of GICS was acquired by Charge-coupled Device (CCD) image sensor, and segmented by fuzzy c-means (FCM) clustering algorithm based on color histogram in HSV color space. Maximin-distance algorithm was adopted to get the initial positions of centroids and cluster number to overcome the shortcoming that the FCM algorithm may produce local optimal results. For the segmented target image, a special characteristic parameter was constructed and calculated in HSV color space to achieve the quantitative interpretation of the GICS.

Automated peanut defect detection using hyperspectral imaging and deep learning: A real-time approach for smart agriculture