Robust Suppressed Competitive Picture Fuzzy Clustering Driven by Entropy

Abstract

In the fuzzy clustering process, the clustering number for image or text data to be classified is not easy to determine or unknown. The competitive learning algorithm can automatically determine the optimal clustering number to avoid the problem of inappropriate artificial selection. In this paper, based on the clustering by competitive agglomeration (CA), the idea of the “Competitive Learning Mechanism” is introduced to picture fuzzy clustering to obtain the competitive agglomeration picture fuzzy clustering (CAPFCM). The competitive learning regular term of the CAPFCM objective function is reinterpreted from the perspective of minimizing the entropy, and the general framework of the entropy competitive clustering algorithm is constructed. Moreover, the competitive learning regular term of the objective function is replaced by quadratic entropy, Renyi entropy or Shannon entropy to obtain different entropy competitive clustering. To improve the efficiency of the CAPFCM algorithm, the suppressed factor is introduced to appropriately increase the maximum value of the picture fuzzy partition information for different clusters and suppress all others. In addition, this paper proposes a robust adaptive entropy competitive picture fuzzy clustering segmentation algorithm with neighborhood spatial information constraints to enhance the anti-noise ability of the picture fuzzy clustering algorithm for noise image. Experiments show that robust CAPFCM can automatically determine the clustering number and greatly improve the operation efficiency and segmentation performance.