期刊文献+

改进的k'-means算法及其在图像分割中的应用

Improved k'-means algorithm and its application in image segmentation
下载PDF
导出
摘要 k'-means是对k-means算法的一种改进,它引入了竞争惩罚学习机制,可以在无监督的情况下确定聚类数目.本文提出了两种新的基于频率敏感差异度量的k'-means算法,新算法利用竞争惩罚学习机制确定聚类数目.针对一组合成数据进行对比实验,结果表明新的k'-means算法可以成功地对数据集进行分类.最后,本文将新算法应用于图像分割. k' -means is a improved k -means algorithm, it introduces competition punishment learning mechanism that can determine the unsupervised clustering number. This paper proposes two new k' -means with frequency sensitive discrepancy metrics. The new algorithms determine the number of clusters by competition punishment learning mechanism. Applied in synthetic datasets for a comparative experiment , the results show that the new k' -means can successfully classify the datasets. Finally, the new algorithms are applied to image segmentation.
作者 辛晚霞
机构地区 中北大学理学院
出处 《商丘师范学院学报》 CAS 2014年第6期7-11,共5页 Journal of Shangqiu Normal University
基金 国家自然科学基金资助项目(61171179)
关键词 k'-means K-MEANS 图像分割 k' - means k - means image segmentation
  • 相关文献

参考文献5

二级参考文献36

  • 1王守强,朱大铭,韩爱丽.基于初始点选取的k-means聚类近似常数算法[J].计算机研究与发展,2007,44(z2):69-74. 被引量:3
  • 2潘锐,朱大铭,马绍汉,肖进杰.k-Median近似计算复杂度与局部搜索近似算法分析[J].软件学报,2005,16(3):392-399. 被引量:8
  • 3郭欣,赵淑清.概率模型下的K-means算法在SAR图像分类中的应用[J].遥感技术与应用,2005,20(2):295-298. 被引量:8
  • 4[11]J Peng,Y Xia.A new theoretical framework for k-means-type clustering.McMaster University,Advanced Optimization Laboratory,Tech Rep:ADVOL2004/06,2004
  • 5[12]J Peng,Y Xia.A cutting algorithm for the minimum-sum-of-squared error clustering.SIAM Int'lConf on Data Mining,Newport Beach,CA,2005
  • 6[1]M Inaba,N Kaoth,H Imai.Application of weighted Voronoi diagrams and randomization to variance-based k-clustering(extended abstract).In:Proc of the 10th Annual Symp on Computational Geometry.New York:ACM Press,1994.332-339
  • 7[2]V Arya,et al.Local search heurictics for k-median and facility location problems.STOC'2001,Hersonissons,Crete,Greece,2001
  • 8[4]T Kanungo,D M Mount,N Netanyahu,et al.A local search approximation algorithm for k-means clustering.Computational Geometry,2004,28:89-112
  • 9[5]J Matousek.On approximate geometric k-clustering.Discrete and Computational Geometry,2004,24:61-84
  • 10[6]M Song,S Rajasekaran.Fast k-means algorithms with constant approximation.The 16th Annual Int'lSymp on Algorithms and Computation,Sanya,Hainan,2005

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部