Abstract

This paper addresses the lack of robustness of feature selection algorithms for fuzzy clustering segmentation with the Gaussian mixture model. Assuming that the neighbourhood pixels and the centre pixels obey the same distribution, a Markov method is introduced to construct the prior probability distribution and achieve the membership degree regularisation constraint for clustering sample points. Then, a noise smoothing factor is introduced to optimise the prior probability constraint. Second, a power index is constructed by combining the classification membership degree and prior probability since the Kullback–Leibler (KL) divergence of the noise smoothing factor is used to supervise the prior probability; this probability is embedded into Fuzzy Superpixels Fuzzy C-means (FSFCM) as a regular factor. This paper proposes a fuzzy clustering image segmentation algorithm based on an adaptive feature selection Gaussian mixture model with neighbourhood information constraints. To verify the segmentation performance and anti-noise robustness of the improved algorithm, the fuzzy C-means clustering algorithm Fuzzy C-means (FCM), FSFCM, Spatially Variant Finite Mixture Model (SVFMM), EGFMM, extended Gaussian mixture model (EGMM), adaptive feature selection robust fuzzy clustering segmentation algorithm (AFSFCM), fast and robust spatially constrained Gaussian mixture model (GMM) for image segmentation (FRSCGMM), and improve method are used to segment grey images containing Gaussian noise, salt-and-pepper noise, multiplicative noise and mixed noise. The peak signal-to-noise ratio (PSNR) and the error rate (MCR) are used as the theoretical basis for assessing the segmentation results. The improved algorithm indicators proposed in this paper are optimised. The improved algorithm yields increases of 0.1272–12.9803 dB, 1.5501–13.4396 dB, 1.9113–11.2613 dB and 1.0233–10.2804 dB over the other methods, and the Misclassification rate (MSR) decreases by 0.32–37.32%, 5.02–41.05%, 0.3–21.79% and 0.9–30.95% compared to that with the other algorithms. It is verified that the segmentation results of the improved algorithm have good regional consistency and strong anti-noise robustness, and they meet the needs of noisy image segmentation.

Highlights

  • Scientific research shows that 70–80% of information in daily life is obtained through the human visual system, and images are an important medium for humans to understand the world and perceive things through

  • Since the fuzzy local information C-means (FLICM) segmentation algorithm cannot consider the effects of different features on the clustering segmentation results, a local fuzzy clustering segmentation algorithm based on a feature selection Gaussian mixture model (GMM) is proposed

  • To verify the segmentation performance and anti-noise robustness of the improved algorithm, the Fuzzy Superpixels Fuzzy C-means (FSFCM), Spatially Variant Finite Mixture Model (SVFMM), EGFMM, extended Gaussian mixture model (EGMM), AFSFCM and FRSCGMM were used for comparison

Read more

Summary

Introduction

Scientific research shows that 70–80% of information in daily life is obtained through the human visual system, and images are an important medium for humans to understand the world and perceive things through. Images play a very important role in people’s daily lives. Sensors 2020, 20, 3722 people are generally only interested in some of the content. It is usually necessary to extract the region of interest in an image from the image so that people can best observe this area; follow-up processes can be implemented. Image segmentation is a process of region division for a given image and the extraction of the target region of interest

Development Status of Clustering Image Segmentation Algorithms
Main Contributions of This Paper
Algorithm Analysis
FSGMM Fuzzy Clustering Algorithm
Experimental Results and Analysis
85. Gaussian
The of clusters are avalue and mean deviation to sensing
Gaussian noise interfering with the images of the the types of objects
Salt-and-pepper
Figures and Tables
Comparison
17.74 C-means
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call