Search

To improve the segmentation performance and anti-noise robustness of existing weighted kernel intuitionistic fuzzy clustering, a robust kernelized total Bregman divergence-based fuzzy local information clustering motivated by intuitionistic fuzzy information is proposed. In this algorithm, a kernelized total Bregman divergence is extended by a polynomial kernel function, and the corresponding intuitionistic kernelized total Bregman divergence is put forward to measure the difference between intuitionistic fuzzy sets. Then, the weighted local information is introduced into the objective function of intuitionistic fuzzy clustering, and the similarity between the current pixel and its neighborhood pixels is constructed to better describe the influence of neighborhood pixels on the current pixel. Finally, the square root of the deviation between the current pixel and the mean value of its neighboring pixels is used to adjust the local spatial information to improve the robustness to noise or outliers and further enhance the anti-noise ability of the algorithm. Experimental results show that the proposed algorithm has better clustering performance and stronger anti-noise robustness than existing state-of-the-art fuzzy clustering-related algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the problem that existing robust fuzzy clustering algorithms are still sensitive to high noise, a total Bregman divergence-driven possibilistic fuzzy clustering with multiple information constraints and kernel metric (TSKFLICM) is proposed in this article. First, we introduce total Bregman divergence (TBD) to overcome the shortcoming that Bregman divergence is variant with rotation. Second, polynomial kernel function is used to kernelize TBD, and kernelized TBD is embedded with neighborhood information of pixels to further enhance its ability to suppress noise. Finally, kernelized TBD with spatial information constraints is combined with possibilistic typicality to construct the novel objective function of possibilistic fuzzy clustering, and a TBD-driven kernel possibilistic fuzzy clustering with multiple information constraints is obtained through optimization theory. The effectiveness of the proposed algorithm for noisy image segmentation is explained by means of sample weighted clustering method. Experimental results show that compared with other algorithms, the Jaccard score, segmentation accuracy, and peak signal-to-noise ratio of the proposed algorithm are improved by 0.017–0.481, 1.327%–41.260%, and 2.416–11.765, respectively. Therefore, the TSKFLICM algorithm has better segmentation performance and stronger antinoise ability than the existing state-of-the-art fuzzy clustering algorithm. [ABSTRACT FROM AUTHOR]

• A joint learning model for superpixel-based fuzzy sparse subspace clustering is established. • A four-level alteration iterative algorithm for superpixel-based image segmentation is proposed. • A centroid shift strategy suitable for image contents is used to generate superpixels. • Experimental results indicate that the proposed algorithm has very good performance. Sparse subspace clustering (SSC) is an important image segmentation method that constructs a self-representation coefficient matrix to represent the relationships between pixels, and then uses spectral clustering to achieve clustering. Compared with other unsupervised segmentation algorithms, SSC has good segmentation performance. However, SSC has a high computational complexity when processing large-sized image. To improve computational efficiency, many researchers have proposed superpixel-based SSC algorithms, which process superpixels instead of pixels and improve efficiency through preprocessing. Due to the sensitivity of superpixel generation to noise, superpixel-based SSC algorithms still have poor robustness. Additionally, preprocessing increases the complexity of the algorithm. To address these issues, this paper proposes a robust superpixel-based fuzzy sparse subspace clustering algorithm. This algorithm combines fuzzy sparse subspace clustering with superpixel generation, and it constructs a unified optimization learning framework through fuzzy C-multiple-means clustering to improve segmentation performance and reduce complexity. Additionally, this paper introduces additional features of superpixel in sparse subspace clustering to further enhance the segmentation performance of the algorithm. Experiment results indicate that the proposed algorithm not only outperforms existing state-of-the-art robust segmentation algorithms independent of superpixels, but also is superior to the latest superpixel-based segmentation algorithms. [ABSTRACT FROM AUTHOR]

To improve the anti-noise ability of credibilistic intuitionistic fuzzy c-means clustering method (CIFCM) for image segmentation, this paper proposes a robust credibilistic intuitionistic fuzzy c-means clustering method based on credibility of pixels and intuitionistic fuzzy entropy. Firstly, a new similarity measure is constructed by utilizing the grayscale and spatial relationship between the current pixel and its neighborhood pixels. Secondly, it is embedded into the objective function of credibilistic intuitionistic fuzzy c-means clustering, and a new robust clustering method with spatial constraints is presented to effectively solve the segmentation problem of image corrupted by high noise. In the end, the convergence of this proposed robust clustering method is strictly proved by iterated convergence theorem. Experimental results show that proposed algorithm has better noise-suppression ability and more satisfactory segmentation results than CIFCM algorithm. [ABSTRACT FROM AUTHOR]

To improve the effectiveness and robustness of the existing semisupervised fuzzy clustering for segmenting image corrupted by noise, a kernel space semisupervised fuzzy C-means clustering segmentation algorithm combining utilizing neighborhood spatial gray information with fuzzy membership information is proposed in this paper. The mean intensity information of neighborhood window is embedded into the objective function of the existing semisupervised fuzzy C-means clustering, and the Lagrange multiplier method is used to obtain its iterative expression corresponding to the iterative solution of the optimization problem. Meanwhile, the local Gaussian kernel function is used to map the pixel samples from the Euclidean space to the high-dimensional feature space so that the cluster adaptability to different types of image segmentation is enhanced. Experiment results performed on different types of noisy images indicate that the proposed segmentation algorithm can achieve better segmentation performance than the existing typical robust fuzzy clustering algorithms and significantly enhance the antinoise performance. [ABSTRACT FROM AUTHOR]

Focusing on the currently available multi-view fuzzy clustering algorithms, many of which frequently lack robustness and are hence less frequently used in image segmentation. We present a multi-view fuzzy clustering image segmentation algorithm in this research, along with an autonomous view-weight learning mechanism. Firstly, to ensure that each view has the best view weight, the algorithm adds a view weight factor. Secondly, it introduces the weighted fuzzy factor and the kernel distance metric, the role of the weighted fuzzy factor is to collect the local spatial information and local grey scale information to preserve as much of the image’s detailed information as feasible during segmentation. The role of the kernel distance metric is to lessen the influence of outliers and noisy points on image segmentation. Finally, the technique for resolving the issue of image uncertainty and fuzzy factor selection introduces the concept of interval type-2 fuzzy c-means clustering. Numerous experiments on different images demonstrate that the proposed algorithm in this paper is more robust than previous multi-view fuzzy clustering algorithms for solving noise image segmentation problems. It is also more effective at segmenting images contaminated by noise and can better retain the detailed information in the image. [ABSTRACT FROM AUTHOR]

• A novel total-aware suppressed possibilistic clustering algorithm is proposed. • The convergence of the proposed algorithm is strictly proved by Zangwill theorem. • Robust total suppressed possibilistic clustering for text data or images with noise is obtained. • Experimental results show that all total suppressed algorithms outperform CPCM and SPCM. Cutset-type possibilistic c-means (CPCM) is an improved version of possibilistic c-means (PCM), and it addresses the issue of consistency clustering in PCM. However, the clustering performance has not significantly improved, and its convergence speed is still slow. Hence, a total-aware suppressed possibilistic c-means (TSPCM) clustering is proposed in this paper. Firstly, from a global perspective, the typicality values of all the non-winners of samples inside the cluster core are decreased by the suppressed factor while increasing the typicality values of all the winners of samples in the same core. Meanwhile, the typicality values of samples outside the cluster core remain unchanged. The corrected typicality values are used to update the clustering centers, and the modified clustering centers are again used to renew the typicality values alternately until the algorithm converges. Secondly, the objective function of the proposed TSPCM is constructed, and Zangwill's theorem firmly establishes its convergence. Finally, two robust total-aware suppressed algorithms are presented when TSPCM is used for the clustering of numerical data with noise and the segmentation of noisy images. Experimental results show that the proposed TSPCM and its robust algorithms are obviously superior to existing state-of-the-art PCM-related algorithms. [ABSTRACT FROM AUTHOR]

• An interval type-2 possibilistic fuzzy clustering with local information is proposed. • Deep neighborhood window is used to enhance the adaptive ability of algorithm. • Local and non-local information is used to improve the robustness of algorithm. • Using structural similarity to enhance the influence of local spatial information. • Testing results show that the proposed algorithm has extremely good performance. Type-2 fuzzy set theory has certain potential advantage in processing high-order uncertainty, and has been more and more widely applied in pattern recognition, image processing, and system modeling. Although it has been introduced into robust fuzzy clustering modeling, most clustering methods based on type-2 fuzzy set theory have many obvious shortcomings, such as weak robustness against noise and high sensitivity to initial value. Therefore, this paper presents a novel single fuzzifier interval type-2 kernel-based possibilistic fuzzy local and non-local information c-means clustering, and it is driven by deep neighborhood information for image segmentation in the presence of high noise. Firstly, we construct the novel deep neighborhood window structure, which consists of local neighborhood window around current pixel and deep neighborhood window around the pixel in local neighborhood window around current pixel. Secondly, using the structural similarity between local neighborhood window and deep neighborhood window around current pixel, we construct a novel fuzzy local information factor to tune the impact of local neighborhood information on current pixel clustering. Thirdly, possibility theory and fuzzy local information factor are introduced into interval type-2 kernel-based fuzzy c-means clustering, and a novel single fuzzifier type-2 possibilistic fuzzy clustering with richer local and non-local information and kernel metric is proposed. Experimental results indicate that the proposed algorithm outperforms existing state-of-the-art robust fuzzy clustering-related algorithms, and significantly improve the robustness of robust fuzzy clustering algorithms against noise. [ABSTRACT FROM AUTHOR]

• Fuzzy local information clustering with quadratic surface prototype is proposed. • Further fused with local membership to form dual local information constraints. • The convergence is analyzed by Zangwill theorem and bordered Hessian matrxi. • Experimental results show that the proposed algorithm has better robustness. Single-valued point can not effectively describe the gray characteristic of the image region, which makes existing fuzzy clustering algorithms difficult to segment image with uneven illumination, weak edges and strong noise. Hence, fuzzy c-means clustering with quadratic polynomial surface as clustering center has become a new method to solve complex image segmentation. Aiming at the shortcoming of current latest spatial fuzzy c-means clustering algorithm with quadratic surface as clustering center, quadratic polynomial surface is firstly introduced into existing widely used fuzzy local information c-means clustering algorithm, and further modify the membership degree of fuzzy local information c-means clustering by means of local membership of neighborhood pixels, a novel fuzzy dual-local information c-means clustering with quadratic polynomial-center clusters is proposed to solve the segmentation problem of complex image in the presence of high noise. Then the convergence of the proposed algorithm is strictly proved by Zangwill theorem and bordered Hessian matrix. Experimental results show that the proposed algorithm has better segmentation performance and anti-noise robustness than existing quadratic polynomial-related QPFCM, widely used FLICM, and multiple state-of-the-art algorithms, meanwhile, it also promotes the development of robust fuzzy clustering-related image segmentation theory. [ABSTRACT FROM AUTHOR]

Kernel possibilistic fuzzy C-means with local information (KWPFLICM) has important research significance of image segmentation, but it is very sensitive to high noise or outliers. To enhance the segmentation performance of the algorithm, this paper proposes a kernelized total Bregman divergence-driven possibilistic fuzzy clustering with local information (TKWPFLICM). Firstly, a polynomial kernel function is introduced to kernelize total Bregman divergence (TBD), and local neighborhood information of the pixel is used to modify it, which overcomes the shortcomings of Bregman divergence (BD) with rotation variability; Secondly, the modified kernelized TBD and possibilistic typicality are combined to further enhance the anti-noise ability of the algorithm; Finally, the modified kernelized TBD is introduced into the objective function of KWPFLICM algorithm, then a novel robust fuzzy clustering algorithm is derived by optimization theory. Experimental results show that compared with existing fuzzy clustering-related algorithms, the average SA improvement on TKWPFLICM algorithm is in the range of 0.791% to 33.237%. Therefore, TKWPFLICM algorithm has better anti-noise robustness and segmentation accuracy. [ABSTRACT FROM AUTHOR]

Gaussian kernel is defined by Euclidean distance and has been widely used in many fields. In the view of Euclidean distance is sensitive to outliers or noise and it is difficult to obtain satisfactory results for complex non-convex data. Entropy-like divergence is firstly induced by combining Jenson-Shannon/Bregman divergence with convex function, and its mercer kernel function called entropy-like divergence-based kernel is also constructed in this paper. Secondly, a new fuzzy weighted factor based on entropy-like divergence-based kernel is proposed by improving the existing trade-off weighting factor of kernel-based fuzzy local information C-means clustering (KWFLICM). In the end, a weighted fuzzy local information clustering based on entropy-like divergence-based kernel (EKWFLICM) is presented, which combines a new weighted fuzzy factor and entropy-like divergence-based kernel. Experiment results show that the proposed algorithm outperforms the segmentation performance of existing state-of-the-art fuzzy clustering-related algorithms for the image in presence of high noise. • An entropy-like divergence and its mercer kernel function are presented. • A novel divergence-based kernel fuzzy clustering is proved to be convergent. • A kernel weighted fuzzy clustering based on entropy-like divergence is constructed. • Proposed algorithm outperforms existing KWFLICM and ILKFCM for image segmentation. [ABSTRACT FROM AUTHOR]

The fuzzy local information C-means clustering algorithm (FLICM) is an important robust fuzzy clustering segmentation method, which has attracted considerable attention over the years. However, it lacks certain robustness to high noise or severe outliers. To improve the accuracy and robustness of the FLICM algorithm for images corrupted by high noise, a novel fuzzy local information c-means clustering utilizing total Bregman divergence (TFLICM) is proposed in this paper. The total Bregman divergence is modified by the local neighborhood information of sample to further enhance the ability to suppress noise, and then modified total Bregman divergence is introduced into the FLICM to construct a new objective function of robust fuzzy clustering, and the iterative clustering algorithm with high robustness is obtained through optimization theory. The convergence of the TFLICM algorithm is proved by the Zangwill theorem. In addition, the validity of the TFLICM algorithm applied in noise image segmentation is explained by means of sample weighting fuzzy clustering. Meanwhile, the generalized total Bregman divergence unifies the Bregman divergence with the total Bregman divergence and enhances the universality of the TFLICM algorithm applied in segmenting complex medical and remote sensing images. Some experimental results show that the TFLICM algorithm can obtain better segmentation quality and stronger anti-noise robustness than the existing FLICM algorithm. • Total Bregman divergence applied in fuzzy clustering is improved. • The improved total Bregman divergence is introduced in robust FLICM algorithm. • An explanation of TFLICM is given by means of sample weighting clustering. • Generalized total Bregman divergence is proposed to enhance clustering performance. [ABSTRACT FROM AUTHOR]

Image segmentation has been broadly applied in computer vision and image analysis. However, many segmentation methods suffer from limited accuracy for noisy images. To improve the robustness of the existing picture fuzzy clustering and solve the problem of selecting spatial constraint parameter, a novel picture fuzzy clustering is proposed. Firstly, a novel symmetric regularizing term is constructed to solve the time-consuming problem of existing picture fuzzy clustering, and the corresponding fuzzy clustering is proposed. Secondly, considering the correlation between current pixel and its neighboring pixels, the objective function is modified by adaptive weighting fusion of local mean information, and the maximum weight entropy constraint is embedded into it to solve the difficulty of parameter selection. Finally, the local spatial information constraint item of the current pixel is constructed by using its neighboring picture fuzzy partition information and is utilized to modify the picture fuzzy partition information of current pixel to correct the clustering center. Results show the proposed algorithm has some potential advantages in segmentation accuracy and anti-noise robustness. [ABSTRACT FROM AUTHOR]