当前位置: X-MOL 学术Int. J. Fuzzy Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Robust Suppressed Competitive Picture Fuzzy Clustering Driven by Entropy
International Journal of Fuzzy Systems ( IF 3.6 ) Pub Date : 2020-10-30 , DOI: 10.1007/s40815-020-00937-3
Chengmao Wu , Na Liu

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.



中文翻译:

熵驱动的鲁棒抑制竞争图像模糊聚类

在模糊聚类过程中,要分类的图像或文本数据的聚类数不容易确定或未知。竞争性学习算法可以自动确定最佳聚类数,以避免出现人工选择不当的问题。本文在基于竞争集聚(CA)的聚类的基础上,将“竞争学习机制”的思想引入到图像模糊聚类中,以获得竞争性集聚图像模糊聚类(CAPFCM)。从最小化熵的角度重新解释了CAPFCM目标函数的竞争学习正则项,构建了熵竞争聚类算法的一般框架。而且,目标函数的竞争性学习正则项被二次熵代替,Renyi熵或Shannon熵获得不同的熵竞争聚类。为了提高CAPFCM算法的效率,引入了抑制因子以适当地增加针对不同聚类的图片模糊划分信息的最大值,并抑制所有其他图像。此外,本文提出了一种鲁棒的具有邻域空间信息约束的自适应熵竞争图像模糊聚类分割算法,以增强图像模糊聚类算法对噪声图像的抗噪能力。实验表明,鲁棒的CAPFCM可以自动确定聚类数量,大大提高了运算效率和分割性能。为了提高CAPFCM算法的效率,引入了抑制因子,以适当地增加针对不同聚类的图片模糊划分信息的最大值,并抑制所有其他图像。此外,本文提出了一种鲁棒的具有邻域空间信息约束的自适应熵竞争图像模糊聚类分割算法,以增强图像模糊聚类算法对噪声图像的抗噪能力。实验表明,鲁棒的CAPFCM可以自动确定聚类数量,大大提高了运算效率和分割性能。为了提高CAPFCM算法的效率,引入了抑制因子,以适当地增加针对不同聚类的图片模糊划分信息的最大值,并抑制所有其他图像。此外,本文提出了一种鲁棒的具有邻域空间信息约束的自适应熵竞争图像模糊聚类分割算法,以增强图像模糊聚类算法对噪声图像的抗噪能力。实验表明,鲁棒的CAPFCM可以自动确定聚类数量,大大提高了运算效率和分割性能。提出了一种具有邻域空间信息约束的鲁棒自适应熵竞争图像模糊聚类分割算法,以提高图像模糊聚类对噪声图像的抗噪能力。实验表明,鲁棒的CAPFCM可以自动确定聚类数量,大大提高了运算效率和分割性能。提出了一种具有邻域空间信息约束的鲁棒自适应熵竞争图像模糊聚类分割算法,以提高图像模糊聚类对噪声图像的抗噪能力。实验表明,鲁棒的CAPFCM可以自动确定聚类数量,大大提高了运算效率和分割性能。

更新日期:2020-10-30
down
wechat
bug