首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种基于集合划分的鲁棒性自适应模糊聚类分割算法
引用本文:朱威威,赵岩松,李艳灵.一种基于集合划分的鲁棒性自适应模糊聚类分割算法[J].信阳师范学院学报(自然科学版),2019(1):146-152.
作者姓名:朱威威  赵岩松  李艳灵
作者单位:信阳师范学院计算机与信息技术学院;信阳学院现代教育技术中心
摘    要:模糊C均值算法(FCM)是图像分割最常用的算法之一,这种方法需要提前确定初始聚类中心和聚类数.为此,提出了一种新的自适应模糊聚类算法(AFCM),AFCM算法中构造的观察矩阵、判断矩阵和集合划分可以自动确定合适的聚类数.为了得到更好的图像分割效果,采用核距离作为相似性度量,提出了一种鲁棒性自适应模糊C均值算法(RAFCM).实验结果表明,与FCM算法相比,AFCM和RAFCM算法不仅能自动地确定聚类数目,还可以得到更好的图像分割质量.

关 键 词:模糊聚类  图像分割  矩阵  集合划分  核距离

A Robust Adaptive Fuzzy Clustering Segmentation Algorithm Based on Set Partition
Institution:,College of Computer and Information Technology,Xinyang Normal University,Modern Educational Technology Center,Xinyang University
Abstract:Fuzzy C-means algorithm(FCM)is one of the most commonly used algorithms in image segmentation.In FCM,the initial cluster center and the number of clustering are determined in advance.To address this problem,a new adaptive fuzzy clustering algorithm(AFCM)is proposed.In AFCM algorithm,observation matrix,judgment matrix and set partitioning are used to select the appropriate clustering number automatically.In order to get better image segmentation effect,a robust adaptive fuzzy clustering algorithm(RAFCM)which using kernel distance as a similarity measure is proposed.The experimental results show that,compared with the FCM algorithm,the AFCM and RAFCM algorithms can not only determine the number of clustering automatically but also get better image segmentation quality.
Keywords:fuzzy clustering  image segmentation  matrix  set partition  kernel distance
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号