首页 | 本学科首页   官方微博 | 高级检索  
     

制图综合知识及其应用
引用本文:刘万增, 陆辰妮, 霍亮, 吴晨琛, 赵婷婷, 朱秀丽. 最优信息熵约束的居民地点状要素选取方法[J]. 武汉大学学报 ( 信息科学版), 2021, 46(8): 1178-1185. DOI: 10.13203/j.whugis20190305
作者姓名:刘万增  陆辰妮  霍亮  吴晨琛  赵婷婷  朱秀丽
作者单位:1.国家基础地理信息中心,北京,100830;2.国家测绘产品质量检验测试中心,北京,100830;3.北京建筑大学测绘与城市空间信息学院,北京,102616
基金项目:国家重点研发计划(2018YFC0807005)
摘    要:实现多种约束下的地图信息的负载均衡是制图综合的难点之一。在中小比例尺地图中,对于乡镇及村庄居民点进行尺度转换,需要综合考虑其行政级别、拓扑和度量关系,以使地图信息负载量在一定尺度下达到合理。提出一种基于最优信息熵约束的居民地点状要素选取方法,在最优信息熵约束下,调整度量关系约束,优先考虑语义关系,保留行政级别高的居民点,对行政级别低的居民点,如果不是道路端点,且不满足度量关系约束,则删除该点,不断迭代,直到满足最优信息熵约束。采用1∶250 000居民地点数据进行实验,实现了维护拓扑一致性、级别优先性、度量合理性的居民地点状要素选取,在有效地保持地图的负载均衡和可读性的同时,实现了地图有效信息量的最大化。采用最优信息熵约束进行居民点选取,在整体上可以保留居民点群空间分布的疏密特征,效果上能够达到图幅信息量的负载均衡。

关 键 词:点状要素选取  地图制图  最优信息熵约束  Delaunay三角网  Voronoi图
收稿时间:2019-10-24

Cartographic-Generaliaztion-Knowledge and Its Application
LIU Wanzeng, LU Chenni, HUO Liang, WU Chenchen, ZHAO Tingting, ZHU Xiuli. Selection Method of Residential Point Features Constrained by Optimal Information Entropy[J]. Geomatics and Information Science of Wuhan University, 2021, 46(8): 1178-1185. DOI: 10.13203/j.whugis20190305
Authors:LIU Wanzeng  LU Chenni  HUO Liang  WU Chenchen  ZHAO Tingting  ZHU Xiuli
Affiliation:1.National Geomatics Center of China, Beijing 100830, China;2.National Quality Inspection and Testing Center for Surveying and Mapping Products, Beijing 100830, China;3.School of Geomatics and Urban Spatial Informatics, Beijing University of Civil Engineering and Architecture, Beijing 102616, China
Abstract:  Objectives  The load balancing of map information under multiple constraints is one of the difficulties in cartographic generalization. In small and medium-scale maps, it is necessary to comprehensively consider their administrative levels, topologies and metric relationships for the scale conversion of townships and village residential point features to make the map information load reasonable at a certain scale.  Methods  This paper proposes a method for selecting residential point features based on optimal information entropy constraints. Under the constraints of optimal information entropy, the metric relationship constraints are adjusted, the semantic relationships are prioritized, the residential point features with higher administrative levels are reserved, and for the residential point features with lower administrative levels, if they are not the endpoints of the road and do not satisfy the metric relationship constraint, then the points are deleted, and the process is iterated until the optimal information entropy constraint is satisfied.  Results  Experiments with 1∶250 000 residential point data have realized the selection of residential location elements that maintain topological consistency, level priority, and metric rationality. The load balancing and readability of the map are effectively maintained, meanwhile, the amount of effective information of the map is maximized based on the algorithm.  Conclusions  The optimal information entropy constraint is adopted for the selection of residential points, which can retain the density characteristics of the spatial distribution of the residential point group as a whole, and achieve the load balancing of map information in effect.
Keywords:point feature selection  cartography  optimal information entropy constraint  Delaunay triangulation  Voronoi diagram
点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《武汉大学学报(信息科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号