A Line Simplification Method Based on Support Vector Machine

被引:0
作者
Duan P. [1 ,2 ]
Qian H. [1 ]
He H. [1 ]
Xie L. [1 ]
Luo D. [1 ]
机构
[1] Institute of Geospatial Information, Information Engineering University, Zhengzhou
[2] 32176 Troops, Kuerle
来源
Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University | 2020年 / 45卷 / 05期
基金
中国国家自然科学基金;
关键词
Automatic map generalization; Case-based studying; Line simplification; Support vector machine;
D O I
10.13203/j.whugis20180434
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Line simplification is one of the most important parts of automatic map generalization. Aiming at the problem that the effect of the current line simplification methods is too dependent on the artificial setting of algorithm parameters and thresholds, and lacking the adaptive learning ability for different simplification environments, this paper considers the line simplification as a binary classification problem about the selection or deletion of the simplification unit. From the perspective of case-based studying, a new line simplification method based on support vector machine (SVM) is proposed. Firstly, point and bend are taken as the simplification unit, the simplification case is automatically obtained from the simplification results of experts, and then the feature description items are extracted as the attribute space of the case sample. The line simplification classifier is trained by SVM. Finally, the SVM classifier is used to classify the simplification units of the new line elements into selection and deletion, so that the line simplification is realized. The experimental results show that this method can well reduce the simplification intention of the experts by learning the simplification case, with a high classification accuracy for the selection and deletion of simplification units, and can adaptively complete the line simplification. © 2020, Editorial Board of Geomatics and Information Science of Wuhan University. All right reserved.
引用
收藏
页码:744 / 752and783
相关论文
共 22 条
[1]  
Guo Qingsheng, Theory and Method of Automatic Map Generalization, (2002)
[2]  
Wang Jiayao, Principles of Cartographic Generalization of Map, (1993)
[3]  
Douglas D H, Peucker T K., Algorithms for the Reduction of Points Required to Represent a Digitized Line or Its Caricature, Canadian Cartographer, 10, pp. 112-122, (1993)
[4]  
Li Zhilin, Openshaw S., Algorithms for Objective Generalization of Line Features Based on the Natural Principle, International Journal of Geographical Information Systems, 6, 5, pp. 373-389, (1992)
[5]  
Nakos B, Mitropoulos V., Local Length Ratio as a Measure of Critical Point Detection for Line Simplification, Symposium of the 5th ICA Workshop on Progress in Automated Map Generalization, (2003)
[6]  
Teh C H, Chin R T., On the Detection of Dominant Points on Digital Curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 8, pp. 859-872, (2004)
[7]  
Chrobak T., A Numerical Method for Generalizing the Linear Elements of Large-Scale Maps, Based on the Example of Rivers, Cartographica: The International Journal for Geographic Information & Geovisualization, 37, 1, pp. 49-56, (2000)
[8]  
Zhu Kunpeng, Wu Fang, Wang Huilian, Et al., Improvement and Assessment of Li-Openshaw Algorithm, Acta Geodaetica et Cartographica Sinica, 36, 4, pp. 450-456, (2007)
[9]  
Liu Huimin, Fan Zide, Xu Zhen, Et al., An Improved Local Length Ratio Method for Curve Simplification and Its Evaluation, Geography and Geo-information Science, 27, 1, pp. 45-48, (2011)
[10]  
Deng Min, Chen Jie, Li Zhilin, Et al., An Improved Local Measure Method for the Importance of Vertices in Curve Simplification, Geography and Geo-information Science, 25, 1, pp. 40-43, (2009)