期刊文献+

一种基于顶点聚类的线要素简化算法改进 被引量:2

Improvements of Linear Features Simplification Algorithm Based on Vertexs Clustering
下载PDF
导出
摘要 首先介绍了一种利用SOM神经网络对顶点进行聚类的线要素简化算法,该算法以线要素各顶点x,y坐标为输入样本集,经过SOM神经网络的训练,形成对原有顶点的聚类,每个聚类保留一个顶点作为简化后的结果。然后分析该算法存在的一些问题,先假设加入角度和距离两维能改善原算法的效果。最后自主实现算法,并采用相关实验数据加以验证,证明增加SOM维数确实行之有效。 Firstly,a linear features simplification algorithm based on vertexs clustering var SOM neural network was introduced.After the SOM neural network was trained by the x,y coordinates of the linear feature' s vertexs,the vertexs of the linear feature was clustered by the SOM neurons,one vertex was selected in every cluster to build up the simplified linear feature.Analysising some problems existing in the algorithm,it was assumed that the additional two dimensional,the angle and the distance,can improve the effect of the original algorithm.The algorithm was implemented independently and validated by related experimental data,which shows that our assumption is indeed correct.
出处 《测绘科学技术学报》 CSCD 北大核心 2013年第5期525-529,534,共6页 Journal of Geomatics Science and Technology
基金 国家自然科学基金项目(41071288)
关键词 制图综合 线要素简化 顶点聚类 SOM神经网络 弯曲 cartographic generalization linear features simplification vertex clustering SOM neural network bend
  • 相关文献

参考文献15

二级参考文献71

共引文献122

同被引文献23

  • 1何海威,钱海忠,段佩祥,谢丽敏,罗登瀚.线要素化简及参数自动设置的案例推理方法[J].武汉大学学报(信息科学版),2020,45(3):344-352. 被引量:9
  • 2王家耀,钱海忠.制图综合知识及其应用[J].武汉大学学报(信息科学版),2006,31(5):382-386. 被引量:45
  • 3朱鲲鹏,武芳,王辉连,朱强.Li-Openshaw算法的改进与评价[J].测绘学报,2007,36(4):450-456. 被引量:31
  • 4GOODCHILD M F.Geographical information science[J].International Journal of Geographical Information Systems,1992,6(1):31-45.
  • 5DOUGLAS D H,PEUCKER T K.Algorithms for the reduction of the number of points required to rep resent a digitized line or its caricature[J].The Canadian Cartographer,1973,10(2):112-122.
  • 6ZHAN H S,LI G X.Progressive transmission of vector map data based on polygonal chain simp lification[J].Lecture Notes in Computer Science,2006,4282:908-917.
  • 7GUIBAS L J,HERSHBERGER J,MITCHELL J,et a1.Approximating polygons and subdivisions with minimum link paths[J].Lecture Notes in Computer Science,1993(3):383-415.
  • 8ESTKOWSKI N,MITCHELL J S B.Simplifying apolygonal subdivision while keeping it simple[A].Proceedings of the 17th ACM Symposium on Computational Geometry[C].2001.40-49.
  • 9YANG B,PURVES R,WEIBEL R.Efficient transmission of vector data over the Internet[J].International Journal of Geographical Information Science,2007,21(2):215-237.
  • 10RAPOSO P.Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation[J].Cartography and Geographic Information Science,2013,40(5):427-443.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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