面向地图综合的VGI道路网重要度层次分解选取方法研究  

Application of the Decomposition Importance in the Road Network Auto-Selection of Volunteered Geographic Information for Map Generalization

作　　者：熊顺[1,2] 杜清运 马超[1,2] 刘平芝 蒋丹妮[2] XIONG Shun;DU Qingyun;MA Chao;LIU Pingzhi;JIANG Danni(Survevying and Mapping Institute,Xi'an 710054,China;State Key Laboratory of Geo-information Engineering,Xi'an 710054,China;WuHan University,Wuhan 430072,China)

机构地区：[1]西安测绘研究所,西安710054 [2]地理信息工程国家重点实验室,西安710054 [3]武汉大学,武汉430072

出　　处：《地球信息科学学报》2024年第1期135-143,共9页Journal of Geo-information Science

基　　金：国家自然科学基金项目(62101395)。

摘　　要：自发地理信息数据具有现势性好、覆盖范围广、信息丰富、获取方便等特点,可作为全球范围内地理信息数据生产与更新的良好数据资料。但是由于数据的无尺度特性,导致自发地理信息道路数据细节过于繁杂,难以直接应用于生产。现有道路网自动选取算法在计算道路重要度时,对所有待选取道路的重要性进行排序,并依据重要性从大到小依次选取。这种方法忽略了选取过程中,道路网结构变化对道路重要性的影响。为此,本文提出了一种基于重要度层次分解的道路网自动选取算法,该方法针对自发地理信息道路网细节繁杂的特点,根据地图数据制图综合时逐级缩编的思路,采用基于层次分解的选取策略进行道路网选取:首先计算所有节点的重要度,然后剔除重要度最小的一些道路节点,并重新计算新的所有节点的重要度,重复上述步骤,直至所有道路节点排序完毕,从而可获得所有道路的重要性排序并完成道路网选取。利用开放街道地图道路网数据进行实验,实验结果表明本文算法选取结果优于网络中心性方法。Volunteered geographic information has the characteristics of real time,wide coverage,rich information,and convenient access.It can be used as a good data input for the production and updating of worldwide geospatial data.However,due to the scale-free characteristics of this data,the details of volunteered geographic information road data are usually too complex,which is far beyond the needs for spatial vector data production and is thus difficult to be directly applied to geospatial data production.When calculating the road importance,the existing road network automatic selection algorithm sorts the importance of all roads to be selected and selects them from the largest to the smallest according to the importance.These methods usually ignore the influence of road network structure changes which could affect the road importance in the selection process.Therefore,this paper proposes an automatic selection algorithm of road network based on hierarchical decomposition of importance.Aiming at the characteristics of rich details and free scale of volunteered geographic information road network,this paper proposes a road network selection algorithm based on hierarchical decomposition.Compared with the previous algorithms based on the ranking and selection of road importance,the essence of this algorithm is that it considers the impact of the ranking of road importance caused by the changes in road network structure after deleting some roads in the process of gradual downsizing.It adopts the strategy of gradual decomposition and multiple calculations to reduce this impact by repeatedly calculating the road importance.The selection process of this algorithm is shown as follows.Firstly,we calculate the importance of all nodes and remove some road nodes with the least importance.Secondly,whether the selection results meet the requirements are judged.If the requirements are not met,we will recalculate the importance of all new nodes and repeat the judgement steps until all road nodes are sorted,so as to obtain the importan

关 键 词：自发地理信息 道路网选取 重要度 K-shell算法 层次分解 复杂网络 

分 类 号：U491[交通运输工程—交通运输规划与管理] P28[交通运输工程—道路与铁道工程]