期刊文献+

基于几何形状的点集聚类 被引量:4

Point-set clustering based on geometry-figure
在线阅读 下载PDF
导出
摘要 针对传统的基于距离计算相似性聚类方法的局限性,提出一种基于几何形状的点集聚类方法。该方法可以从离散的点集中提取出具有某种拓扑几何形状特征的目标对象。实验证明,该方法可以有效地检测分布呈小饶度的曲线形状的点集,在一定程度上克服了基于距离检测方法的局限性,可以在工程图纸识别、计算机视觉、遥感识别等领域得到应用。 Aimed at the limitations of clustering of the traditional calculation of similarity based on distance, a method of point-set clustering based on topology geometry-figure is proposed. Some kinds of objects with the geometric characteristics wishing to be needed are extracted from the discrete point-sets. The experiment shows that the method can detect effectively the curve points of small curvature, to some extent, it overcomes the limitation of the method based distance. It can be applied in the areas of engineering drawings recognition, computer vision, remote sensing recognition and so on.
作者 宁丽 林意
出处 《计算机工程与设计》 CSCD 北大核心 2008年第10期2613-2615,共3页 Computer Engineering and Design
关键词 聚类 几何形状 离散 饶度 曲线提取 clustering geometry-figure discrete curvature curve-extracting
  • 相关文献

参考文献4

二级参考文献24

  • 1李桂林,陈晓云.关于聚类分析中相似度的讨论[J].计算机工程与应用,2004,40(31):64-65. 被引量:26
  • 2周焰,李德仁,徐长勇.尺度变化对形状的比例不变特征的影响[J].华中科技大学学报(自然科学版),2003,31(3):11-13. 被引量:3
  • 3HanJiawei Kamber M 范明等译.数据挖掘:概念与技术[M].北京:机械工业出版社,2001..
  • 4Fayyad U, Piatssky-Shapiro G, Smyth P, Uthursamy R et al. Advances in knowledge discovery and data mining[M]. MIT Press, 1996.
  • 5Jain A K, Dubes R C. Algorithms for clustering data[M]. Engle-wood Cliffs New Jersey: Prentice-Hall,1988.
  • 6Arabie P, Hubert L J, deSoete G et al. Clustering and classification[M]. River Edge, NJ: World Scientific Publishing, 1996.
  • 7Yee Leung, Zhang Jiangshe, Xu Zongben. Clustering by Scale-Space Filtering[J]. IEEE Trans on Pattern Analysis and Machine Intelligence,2000;22(12).
  • 8Martin Ester, Hans-Peter Kriegel, XiaoWei Xu. A Density-Based algorithm for discovering clusters in large databases with noise[A]. Proc.2nd Int. Conf. On Knowledge Discovery and Data Mining[C]. Portland, OR,1996;226-231.
  • 9Ankerst M, Breunig M, Kriegel H P, & Sander J. OPTICS: Ordering Points To Identify the Clustering Structure[A]. Proc 1999 ACM-SIGMOD Conf. On Management of Data (SIG MOD'99)[C]. 1999;49-96.
  • 10Hinneburg, Alexander and Daniel A.Keim, An Efficient Approach to Clustering in Large Multimedia Databases with noise[A]. Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining[C]. (KDD98), New York, 1998;58-65.

共引文献39

同被引文献34

引证文献4

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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