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

基于半监督信息的截集式可能性C-均值聚类算法
引用本文:范九伦,高梦飞,于海燕,陈斌斌.基于半监督信息的截集式可能性C-均值聚类算法[J].电子与信息学报,2021,43(8):2378-2385.
作者姓名:范九伦  高梦飞  于海燕  陈斌斌
作者单位:1.西安邮电大学通信与信息工程学院 西安 7101212.西安邮电大学电子信息勘验应用技术公安部重点实验室 西安 710121
基金项目:国家自然科学基金(62071378, 62071379, 62071380),西安邮电大学西邮新星团队(xyt2016-01)
摘    要:截集式可能性C-均值(C-PCM)聚类算法将截集概念引入可能性C-均值(PCM)聚类算法中,明显改善了PCM的聚类中心重合问题,并能够对噪声和奇异点的数据进行有效聚类,但该聚类算法对小目标数据聚类时仍然存在聚类中心偏移的问题。针对此问题,该文将半监督学习机制引入C-PCM的目标函数中,通过部分先验信息来指导聚类过程,提出半监督截集式可能性C-均值(SS-C-PCM)聚类算法。为了提高彩色图像的分割效率和分割准确率,将差分进化超像素(DES)算法获得的图像空间邻域信息融入SS-C-PCM目标函数中,并利用彩色直方图重构目标函数,以降低算法的计算复杂度,进而提出基于差分进化超像素的半监督截集式可能性C-均值(desSS-C-PCM)聚类算法。通过人造数据和彩色图像分割的仿真并与多种相关算法进行对比,表明该文算法能够有效改善小目标数据的聚类效果,提高算法的执行效率。

关 键 词:截集式可能性C-均值聚类    半监督    超像素    彩色直方图
收稿时间:2020-08-26

Cutset-type Possibilistic C-means Clustering Algorithms Based on Semi-supervised Information
Jiulun FAN,Mengfei GAO,Haiyan YU,Binbin CHEN.Cutset-type Possibilistic C-means Clustering Algorithms Based on Semi-supervised Information[J].Journal of Electronics & Information Technology,2021,43(8):2378-2385.
Authors:Jiulun FAN  Mengfei GAO  Haiyan YU  Binbin CHEN
Affiliation:1.School of Communication and Information Engineering, Xi’an University of Posts and Telecommunications, Xi’an 710121, China2.Key Laboratory of Electronic Information Application Technology for Scene Investigation of Ministry of Public Security, Xi’an University of Posts and Telecommunications, Xi’an 710121, China
Abstract:Cutset-type Possibilistic C-Means clustering (C-PCM) algorithm can significantly reduce the coincident clustering phenomenon of the Possibilistic C-Means clustering (PCM) algorithm by introducing the cut-set concept into the PCM. The C-PCM also has strong robustness to noise and outliers. However, the C-PCM still suffers from the center migration problem for datasets with small targets. In order to solve this problem, a Semi-Supervised Cutset-type Possibility C-Means (SS-C-PCM) clustering algorithm is proposed by introducing the semi-supervised learning mechanism into the objective function of the C-PCM and utilizing some prior information to guide the clustering process. Meanwhile, in order to improve the segmentation efficiency and accuracy of color images, a differential evolutionary superpixel-based Semi-Supervised Cutset-type Possibilistic C-Means (desSS-C-PCM) clustering algorithm is proposed. In the desSS-C-PCM, the Differential Evolutionary Superpixel(DES) algorithm is used to obtain the spatial neighborhood information of an image, which is integrated into the objective function of the semi-supervised C-PCM to improve the segmentation quality. Simultaneously, the color histogram is used to reconstruct the new objective function to reduce the computational complexity of the algorithm. Several experiments of artificial data clustering and color image segmentation show that the proposed algorithm can effectively improve the clustering effect of datasets with small targets and the execution efficiency compared with several related algorithms.
Keywords:
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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