期刊文献+

基于相似性传播聚类的灰度图像分割 被引量:4

Grey image segmentation method based on affinity propagation clustering
下载PDF
导出
摘要 基于k-Means等聚类算法的图像分割对聚类中心的初始选择敏感,可靠性差。为避免初始聚类中心选择的影响,将相似性传播聚类用于灰度图像分割。另外,为降低该聚类算法输入相似度矩阵的计算时间复杂度,提出用待分割图像中出现过的灰度值代替像素点作为数据点进行聚类。实验结果表明,与基于k-Means聚类的分割算法相比,该算法不需要预设聚类中心,可靠性更高。 The image segmentation methods based on the k-Means clustering are highly sensitive to the cluster centers' initialization. To avoid the effects of the cluster centers' initialization, the affinity propagation clustering was used to sgement grey images. To reduce the complexity in calculating the input similarity matrix of the affinity propagation clustering, it was proposed that all grey levels were selected to he used as data points instead of all pixels in the image. The results show that the method proposed need not preelect cluster centers and is more reliable than the method based on the k-Means culstering.
出处 《海军工程大学学报》 CAS 北大核心 2009年第3期33-37,共5页 Journal of Naval University of Engineering
基金 国家自然科学基金资助项目(60804034) 山东科技大学科学研究"春蕾计划"资助项目(2008BWZ054)
关键词 相似性传播聚类 图像分割 聚类中心 灰度值 时间复杂度 affinity propagation clustering image segmentation cluster center grey level time complexity
  • 相关文献

参考文献10

  • 1XU R,WUNSCH D.Survey of clustering algorithms[J].IEEE Transactions on Neural Networks,2005,16(3):645-678.
  • 2FREY B J,DUECK D.Clustering by passing messages between data points[J].Science,2007,315:972-976.
  • 3XIAO Jian-xiong,WANG Jing-dong,TAN Ping,et al.Joint affinity propagation for multiple view segmentation[C]//Proceedings of 2007 IEEE llth International Conference on Computer Vision.Piscataway,NJ 08855-1331,United States:Institute of Electrical and Electronics Engineers Inc.,2007.
  • 4谢信喜,王士同.适用于区间数据的基于相互距离的相似性传播聚类[J].计算机应用,2008,28(6):1441-1443. 被引量:8
  • 5FREY B J,DUECK D.Mixture modeling by affinity propagation[J].Neural Information Processing Systems,2006,18..379-386.
  • 6MEZRD M.Where are the exemplars?[J].Science,2007,315:949-951.
  • 7LOELIGER H A.An introduction to factor graphs[J].IEEE Signal Processing Magazine,2004,21(1):28-41.
  • 8FREY B J,MACKAY D J C.A revolution belief propagation in graphs with cycles[C]//Proceedings of the 1997 Conference on Advances in Neural Information Processing Systems 10.Cambridge:MIT Press,1998.
  • 9王开军,张军英,李丹,张新娜,郭涛.自适应仿射传播聚类[J].自动化学报,2007,33(12):1242-1246. 被引量:144
  • 10FREY B J,DUECK D.Response to comment on "clustering by passing messages between data points"[J].Science,2008,319:726-728.

二级参考文献22

  • 1洪志令 ,姜青山 ,董槐林 ,Wang Sheng-Rui .模糊聚类中判别聚类有效性的新指标[J].计算机科学,2004,31(10):121-125. 被引量:15
  • 2Frey B J, Dueck D. Clustering by passing messages between data points. Science, 2007, 315(5814): 972-976
  • 3Kelly K. Affinity program slashes computing times [Online], available: http://www.news.utoronto.ca/bin6/070215-2952. asp. October 25, 2007
  • 4Dudoit S, Fridlyand J. A prediction-based resampling method for estimating the number of clusters in a dataset. Genome Biology, 2002, 3(7): 1-21
  • 5Wang K J. Supplement of adaptive affinity propagation clustering [Online], available: http://www.mathworks. com/matlabcentral/fileexchange/loadAut hor .do?object Type =author&objectId=1095267, October 25, 2007
  • 6Velamuru P K, Renaut R A, Guo H B, Chen K W. Robust clustering of positron emission tomography data. In: Joint Interface CSNA. USA: 2005
  • 7Dembele D, Kastner P. Fuzzy C-means method for clustering microarray data. Bioinformatics, 2003, 19(8): 973-980
  • 8Strehl A. Relationship-based Clustering and Cluster Ensembles for High-dimensional Data Mining [Ph. D. dissertation], The University of Texas at Austin, 2002
  • 9Blake C L, Merz C J. UCI repository of machine learning databases (University of California) [Online], available:http://mlearn.ics.uci.edu/MLRepository.html, September 27, 2007
  • 10Ben H A, Guyon I, Elisseeff A. A stability based method for discovering structure in clustered data. In: Proceedings of the 7th Pacific Symposium on Biocomputing. Hawaii, USA: 2002. 6-17

共引文献148

同被引文献41

  • 1林健,彭敏晶.基于神经网络集成的GDP预测模型[J].管理学报,2005,2(4):434-436. 被引量:17
  • 2栗然,黎静华,李和明.基于加权平均粗糙度的配电网故障诊断分层模型[J].电网技术,2006,30(2):61-65. 被引量:15
  • 3FREY B J, DUECK D. Clustering by passing messages between data points [ J ]. Science, 2007, 315 (5814) :972-976.
  • 4LAZIC N, GIVONI Inmar E, AARABI Parham, et al. FLOSS : Facility location for subspace segmentation[ C ]// Proceedings of 12th International Conference on Computer Vision (ICCV). Kyoto: IEEE Press, 2009: 825-832.
  • 5LAZIC Nevena, FREY Brendan J,AARABI Parham. Solving the uncapacitated facility location problem using message passing algorithms[ C]// Proceedings of 13th International Conference on Artificial Intelligence and Statistics ( AISTATS ). Sardinia: Microtome Publishing, 2010: 429-436.
  • 6DUECK D, FREY B J. Non-metric affinity propagation for unsupervised image categorization [ C ]// Proceedings of 11th International Conference on Computer Vision (ICCV). Rio de Janeiro: IEEE Press, 2007- 1-8.
  • 7GIVONI I E, FREY B J. Semi-supervised affinity propagation with instance-level constraints [ C ]//Proceedingsof 12th International Conference on Artificial Intelligence and Statistics ( AISTATS ). Florida: Microtome Publishing, 2009 : 161-168.
  • 8DUECK D, FREY B J, JOJIC N, et al. Constructing treatment portfolios using affinity propagation [ C ]//Proceedings of International Conference on Research in Computational Molecular Biology ( RECOMB ). Singapore: Springer, 2008: 360- 371.
  • 9CLERC Maurice. The swarm & the queen towards a deterministic and adaptive particle swarm optimization[C]//Proceedings of Congress on Evolutionary Computation, Washington: IEEE Press, 1999: 1951-1957.
  • 10李玲玲,刘希玉,卢树强.基于粒子群优化算法的并行学习神经网络集成构造方法[J].山东科学,2007,20(4):16-20. 被引量:3

引证文献4

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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