scholarly journals A Local Neighborhood Robust Fuzzy Clustering Image Segmentation Algorithm Based on an Adaptive Feature Selection Gaussian Mixture Model

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2391 ◽  
Author(s):  
Hang Ren ◽  
Taotao Hu
Keyword(s):  
Feature Selection ◽  
Objective Function ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Fuzzy Clustering ◽  
Gaussian Mixture ◽  
Local Information ◽  
Segmentation Algorithm ◽  
Membership Degree ◽  
Noise Interference

Since the fuzzy local information C-means (FLICM) segmentation algorithm cannot take into account the impact of different features on clustering segmentation results, a local fuzzy clustering segmentation algorithm based on a feature selection Gaussian mixture model was proposed. First, the constraints of the membership degree on the spatial distance were added to the local information function. Second, the feature saliency was introduced into the objective function. By using the Lagrange multiplier method, the optimal expression of the objective function was solved. Neighborhood weighting information was added to the iteration expression of the classification membership degree to obtain a local feature selection based on feature selection. Each of the improved FLICM algorithm, the fuzzy C-means with spatial constraints (FCM_S) algorithm, and the original FLICM algorithm were then used to cluster and segment the interference images of Gaussian noise, salt-and-pepper noise, multiplicative noise, and mixed noise. The performances of the peak signal-to-noise ratio and error rate of the segmentation results were compared with each other. At the same time, the iteration time and number of iterations used to converge the objective function of the algorithm were compared. In summary, the improved algorithm significantly improved the ability of image noise suppression under strong noise interference, improved the efficiency of operation, facilitated remote sensing image capture under strong noise interference, and promoted the development of a robust anti-noise fuzzy clustering algorithm.

scholarly journals An Adaptive Feature Selection Algorithm for Fuzzy Clustering Image Segmentation Based on Embedded Neighbourhood Information Constraints

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3722
Author(s):  
Hang Ren ◽  
Taotao Hu
Keyword(s):  
Feature Selection ◽  
Image Segmentation ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Fuzzy Clustering ◽  
Prior Probability ◽  
Gaussian Mixture ◽  
Fuzzy C Means ◽  
Adaptive Feature Selection ◽  
Improved Algorithm

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.

scholarly journals Multispectral Image Segmentation Based on a Fuzzy Clustering Algorithm Combined with Tsallis Entropy and a Gaussian Mixture Model

2019 ◽  
Vol 11 (23) ◽  
pp. 2772 ◽  
Author(s):  
Yan Xu ◽  
Ruizhi Chen ◽  
Yu Li ◽  
Peng Zhang ◽  
Jie Yang ◽  
...  
Keyword(s):  
Image Segmentation ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Fuzzy Clustering ◽  
Gaussian Mixture ◽  
Multispectral Image ◽  
Tsallis Entropy ◽  
Segmentation Algorithm ◽  
Multispectral Images ◽  
Fuzzy C Means

Accurate multispectral image segmentation is essential in remote sensing research. Traditional fuzzy clustering algorithms used to segment multispectral images have several disadvantages, including: (1) they usually only consider the pixels’ grayscale information and ignore the interaction between pixels; and, (2) they are sensitive to noise and outliers. To overcome these constraints, this study proposes a multispectral image segmentation algorithm based on fuzzy clustering combined with the Tsallis entropy and Gaussian mixture model. The algorithm uses the fuzzy Tsallis entropy as regularization item for fuzzy C-means (FCM) and improves dissimilarity measure using the negative logarithm of the Gaussian Mixture Model (GMM). The Hidden Markov Random Field (HMRF) is introduced to define prior probability of neighborhood relationship, which is used as weights of the Gaussian components. The Lagrange multiplier method is used to solve the segmentation model. To evaluate the proposed segmentation algorithm, simulated and real multispectral images were segmented using the proposed algorithm and two other algorithms for comparison (i.e., Tsallis Fuzzy C-means (TFCM), Kullback–Leibler Gaussian Fuzzy C-means (KLG-FCM)). The study found that the modified algorithm can accelerate the convergence speed, reduce the effect of noise and outliers, and accurately segment simulated images with small gray level differences with an overall accuracy of more than 98.2%. Therefore, the algorithm can be used as a feasible and effective alternative in multispectral image segmentation, particularly for those with small color differences.

A framework for petrophysically and geologically guided geophysical inversion using a dynamic Gaussian mixture model prior

2019 ◽  
Vol 219 (3) ◽  
pp. 1989-2012 ◽  
Author(s):  
Thibaut Astic ◽  
Douglas W Oldenburg
Keyword(s):  
Objective Function ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Optimization Problems ◽  
Reference Model ◽  
Gaussian Mixture ◽  
Geological Data ◽  
Geophysical Inversion ◽  
Geophysical Model ◽  
Geological Information

SUMMARY We propose a new framework for incorporating petrophysical and geological information into voxel-based geophysical inversion. By developing the geophysical inverse problem from a probabilistic perspective, we redesign the objective function and the iteration steps as a suite of cyclic optimization problems in which three separate MAP optimization problems are solved using geophysical, petrophysical and geological data, respectively. By quantitatively linking these data into a single framework, we recover a final inverted model that reproduces the observed, or desired, petrophysical and geological features while fitting the geophysical data. To achieve our goal we replace the Gaussian prior, used in the Tikhonov inversion approach, by a Gaussian mixture model. After each geophysical model update, the mixture parameters (means, variances and proportions) are determined by the geophysical model and the expected characteristics of the lithologies through another optimization process using the expectation–maximization algorithm. We then classify the model cells into rock units according to the petrophysical and geological information. These two additional steps over the petrophysical and geological data result in a dynamic update of the reference model and associated weights and guide the inversion towards reproducing the expected petrophysical and geological characteristics. The resulting geophysical objective function does not require extra terms to include the additional petrophysical and geological information; this is an important distinction between our work and previous frameworks that carry out joint geophysical and petrophysical data inversion. We highlight different capabilities of our methodology by inverting magnetotelluric and direct-current resistivity data in 1-D and 2-D, respectively. Finally, we apply our framework to inverting airborne frequency domain data, acquired in Australia, for the detection and characterization of saline contamination of freshwater.

Feature Selection Based on Gaussian Mixture Model Clustering for the Classification of Pulmonary Nodules Based on Computed Tomography

2020 ◽  
Vol 10 (5) ◽  
pp. 1033-1039
Author(s):  
Huihong Duan ◽  
Xu Wang ◽  
Xingyi He ◽  
Yonggang He ◽  
Litao Song ◽  
...  
Keyword(s):  
Computed Tomography ◽  
Feature Selection ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Pulmonary Nodules ◽  
Gaussian Mixture ◽  
Local Optimum ◽  
Computer Aided ◽  
Aided Diagnosis

Background: In the pulmonary nodules computer aided diagnosis systems (CAD), feature selection plays an important role in reducing the false positive rate and improving the system accuracy. To solve the problem of feature selection techniques by which the diversity of features was damaged in the process of distinguishing malignant pulmonary nodules from benign pulmonary nodules, this study developed a novel feature selection algorithm for improving the accuracy of traditional computer-aided differential diagnosis for benign and malignant classification of pulmonary nodules. Method: Firstly, we divided the extracted features of nodules into several groups by using Gaussian mixture model (GMM). Secondly, we applied Relief and sequential forward selection (SFS) algorithm to find local optimum features dataset for each group. Afterwards, we used the optimumpath forest (OPF) classifier with the found features dataset to obtain the classification results. Finally, the local optimum features dataset with the highest area under curve AUC in all groups were added into the final selected set. Results: According to collected pulmonary nodules on computed tomography (CT) scans, tested with two set of samples, we achieved an average accuracy of 89.5%, sensitivity of 87.1% and specificity of 90.9% on the first set of samples, and 90.1%, 88.7% and 92.1% on the second set of samples. The areas under the receiver operating characteristic (ROC) curves based on these two sample sets were 95.2%, and 96.3% respectively. Conclusions: This study shows that the proposed method was promising for improving the pulmonary nodules computer aided diagnosis systems performance of benign and malignant pulmonary nodules.

Sign in / Sign up

Export Citation Format

Share Document