A trajectory-oriented carriageway-based road network data model,part 1: Background

This is the first of a three-part series of papers which introduces a general background of building trajectory-oriented road network data models, including motivation, related works, and basic concepts. The purpose of the series is to develop a trajectory-oriented road network data model, namely carriageway-based road network data model (CRNM). Part 1 deals with the modeling background. Part 2 proposes the principle and architecture of the CRNM. Part 3 investigates the implementation of the CRNM in a case study. In the present paper, the challenges of managing trajectory data are discussed. Then, developing trajectory-oriented road network data models is proposed as a solution and existing road network data models are reviewed. Basic representation approaches of a road network are introduced as well as its constitution.     

A trajectory-oriented,carriageway-based road network data model,Part 2: Methodology

This is the second of a three-part series of papers which presents the principle and architecture of the CRNM, a trajectory-oriented, carriageway-based road network data model. The first part of the series has introduced a general background of building trajectory-oriented road network data models, including motivation, related works, and basic concepts. Based on it, this paper describs the CRNM in detail. At first, the notion of basic roadway entity is proposed and discussed. Secondly, carriageway is selected as the basic roadway entity after compared with other kinds of roadway, and approaches to representing other roadways with carriageways are introduced. At last, an overall architecture of the CRNM is proposed.     

A Trajectory-Oriented, Carriageway-Based Road Network Data Model, Part 2： Methodology

IntroductionIf let roadway entities be denoted by arcs and in-tersections be denoted by nodes, then a road net-work can be represented with node-arc model. Be-cause the designation of nodes can be determinedby arcs according to the definition of node-arc mod-el, howto designate arcs becomes the key of repre-senting a road network. As described in the firstpaper of the series, all four kinds of roadway enti-ties (i.e., streets, road segments, carriageways,and lanes) can be represented by arcs. …     

A trajectory-oriented carriageway-based road network data model,part 3: Implementation

This is the final of a three-part series of papers which mainly discusses the implementation issues of the CRNM. The first two papers in the series have introduced the modeling background and methodology, respectively. An overall architecture of the CRNM has been proposed in the last paper. On the basis of the above discusses, a linear reference method (LRM) for providing spatial references for location points of a trajectory is developed. A case study is introduced to illustrate the application of the CRNM for modeling a road network in the real world is given. A comprehensive conclusion is given for the series of papers.     

A Trajectory-Oriented Carriageway-Based Road Network Data Model, Part 3: Implementation

IntroductionThe LRM based on the CRNMis a kind oflink-and-node LRM. As introduced in the firstpaper of the series ,the link-and-node LRMdoesnot designate any fixed reference point along aroad segment in advance but employs the nodesin the node-arc model d…     

基于地理实体的道路网络面向对象数据模型研究

城市交通迅速发展,道路网络呈现出空间结构复杂、数据量大、时效性强等特点。本文讨论了传统路网模型的特点,顾及道路的信息完整性、数据冗余性、管理高效性3个指标,研究了以道路实体为基本元素的路网模型;运用面向对象技术对路网模型进行了数据建模,并通过动态交通信息更新机制对路网的动态属性进行管理;构建了城市道路实体化实验系统,验证了该模型的有效性和可行性。     

一种支持城市路网交通关系自动化的智能模型

针对车载导航、地图网站等应用中路网要素之间交通关系维护的难题,提出一种支持路网要素交通关系自动化的智能过程模型,将路网要素交通关系自动化过程理解为由路网要素间的空间和语义关系、规则集和控制系统组成的产生式系统.该产生式系统可在路网要素空间和语义信息基础上,通过定义可扩展的交通关系规则集,自动化地生成符合应用需求的路网要素间的交通关系.此外,在该产生式系统中引入触发器概念监控和响应几何网络及其交通关系规则集的变更,实时更新逻辑网络中的连通关系信息,实现几何网络、规则集和逻辑网络三者的一致性.同时,提出路网要素交通关系处理的控制策略和关键流程,并对该智能网络模型的有效性进行了验证.

Abstract：

Maintaining the traffic connectivity relations between road features has always been a time consuming task for in-vehicle navigation, map website, and other traveling service related applications. Such a task has been commonly conducted artificially and inevitably inefficient, yet makes data quality control difficult. Considering the intrinsic rules of traffic connectivity formed by the geometrical structures, spatial and semantic relationships between road features in city road networks, an intelligent processing model is set forward in this paper for traffic connectivity automation. It is argued that traffic connectivity automation between road features is fundamentally a production system composed of the spatial and semantic relations between road features, connectivity rules and control system. With the implementation of an extendable connectivity rule set, the traffic connectivity relations between road network features are built automatically based on the spatial and semantic information of road network. The trigger concept is adopted to monitor and respond the changes in geometrical network and connectivity rules, and then dynamically updates the traffic connectivity between road network features in logical network so as to guarantee the consistence between geometrical network, connectivity rules and logical network. A series of control strategies and a conducting engine are developed to maintain the traffic connectivity relations. A case study conducted on a real road network verifies the effects of the proposed intelligent model.     

利用Minkowski距离逼近道路网络距离算法研究

道路网络背景下的距离度量（如道路网络距离、旅行时间）是在空间分析或空间统计过程中常用的距离度量,但在科研过程中由于道路数据的可获得性和精度等方面的限制,该类距离的计算可能较为困难。Minkowski距离函数是欧氏空间中的广义距离函数,其参数p值的不同代表着对空间不同的度量。利用Minkowski的通用性和灵活性（参数p不同的取值）,研究如何更好地逼近道路网络距离。同时,探索不同道路网络的部分计量特征（如密度、弯曲度等）与最优p值之间的关系。实验证明,相对于最常用的欧氏距离度量,优选p值后的Minkowski距离函数能够更大程度上逼近道路距离。而通过对道路网络计量特征与最优p值之间的关系的分析,指出了弯曲度与最优p值之间的对应关系,它对于p值的选择具有重要的指导意义。此外,为了验证Minkowski距离逼近算法的可行性,以地理加权回归分析为例,通过对比传统的欧氏距离度量、最优Minkowski距离度量和道路网络距离（旅行时间）对模型解算结果的影响,指出优选后Minkowski距离一定程度上更接近于采用旅行时间对模型解算的结果。     

A multiple representation data structure for dynamic visualisation of generalised 3D city models

In this paper, a novel multiple representation data structure for dynamic visualisation of 3D city models, called CityTree, is proposed. To create a CityTree, the ground plans of the buildings are generated and simplified. Then, the buildings are divided into clusters by the road network and one CityTree is created for each cluster. The leaf nodes of the CityTree represent the original 3D objects of each building, and the intermediate nodes represent groups of close buildings. By utilising CityTree, it is possible to have dynamic zoom functionality in real time. The CityTree methodology is implemented in a framework where the original city model is stored in CityGML and the CityTree is stored as X3D scenes. A case study confirms the applicability of the CityTree for dynamic visualisation of 3D city models.     

Detection of clusters in traffic networks based on spatio‐temporal flow modeling

Spatio‐temporal clustering is a highly active research topic and a challenging issue in spatio‐temporal data mining. Many spatio‐temporal clustering methods have been designed for geo‐referenced time series. Under some special circumstances, such as monitoring traffic flow on roads, existing methods cannot handle the temporally dynamic and spatially heterogeneous correlations among road segments when detecting clusters. Therefore, this article develops a spatio‐temporal flow‐based approach to detect clusters in traffic networks. First, a spatio‐temporal flow process is modeled by combining network topology relations with real‐time traffic status. On this basis, spatio‐temporal neighborhoods are captured by considering traffic time‐series similarity in spatio‐temporal flows. Spatio‐temporal clusters are further formed by successive connection of spatio‐temporal neighbors. Experiments on traffic time series of central London's road network on both weekdays and weekends are performed to demonstrate the effectiveness and practicality of the proposed method.     

Integrated compression of vehicle spatio‐temporal trajectories under the road stroke network constraint

With fast growth of all kinds of trajectory datasets, how to effectively manage the trajectory data of moving objects has received a lot of attention. This study proposes a spatio‐temporal data integrated compression method of vehicle trajectories based on stroke paths coding compression under the road stroke network constraint. The road stroke network is first constructed according to the principle of continuous coherence in Gestalt psychology, and then two types of Huffman tree—a road strokes Huffman tree and a stroke paths Huffman tree—are built, based respectively on the importance function of road strokes and vehicle visiting frequency of stroke paths. After the vehicle trajectories are map matched to the spatial paths in the road network, the Huffman codes of the road strokes and stroke paths are used to compress the trajectory spatial paths. An opening window algorithm is used to simplify the trajectory temporal data depicted on a time–distance polyline by setting the maximum allowable speed difference as the threshold. Through analysis of the relative spatio‐temporal relationship between the preceding and latter feature tracking points, the spatio‐temporal data of the feature tracking points are all converted to binary codes together, accordingly achieving integrated compression of trajectory spatio‐temporal data. A series of comparative experiments between the proposed method and representative state‐of‐the‐art methods are carried out on a real massive taxi trajectory dataset from five aspects, and the experimental results indicate that our method has the highest compression ratio. Meanwhile, this method also has favorable performance in other aspects: compression and decompression time overhead, storage space overhead, and historical dataset training time overhead.     

面向道路网VGI数据的匹配与融合方法

自发地理信息(VGI)是一种新兴的地理数据采集方式,具有数据更新快、细节丰富、覆盖范围广等优势。利用VGI数据可以对道路网实现快速更新;但是由于VGI数据是非专业自发共享的,且数据采集时多使用非专业设备,所以存在数据质量不高的问题。大量VGI数据对同一地理要素的重复采集与融合处理则可改善数据的质量,文中以多人采集的道路网数据为例,结合矢量要素的匹配与融合理论,设计一种适用于道路网VGI数据的匹配与融合算法。首先在路段结点处建立缓冲区进行结点匹配,再根据路段距离相似度进行路段匹配,最后再利用Delaunay三角剖分融合算法对匹配后的同名路段进行融合。将匹配融合后的道路网与原始道路网VGI数据及Google影像图叠加对比分析,结果表明利用本文算法可有效地实现道路网VGI数据的匹配与融合。     

融合SAR和TM图像更新GIS道路网络数据

遥感作为空间数据获取的一种手段,其在空间数据更新中的作用显得越来越重要,遥感数据已逐渐成为空间数据更新的主要数据来源。提出一种利用遥感图像自动更新GIS道路网络数据的方法,通过融合两种传感器图像数据,将整个道路网络准确完整地提取出来,然后通过线性特征的变化检测确定已修改的道路及新修建的道路。实验结果表明该方法可以准确地更新道路网络数据。     

改进全卷积网络方法的高分二号影像农村道路提取

针对目前利用高分遥感数据提取农村道路的研究与应用少,提取结果精准度不够的问题,提出了结合空洞卷积和ASPP（Atrous Spatial Pyramid Pooling）结构的改进全卷积农村道路提取网络模型DC-Net（Dilated Convolution Network）。该模型基于全卷积的编解码结构来提取道路深度特征信息,同时针对农村道路细长的特点,在解编码层之间加入了以空洞卷积为基础的ASPP（Atrous Spatial Pyramid Pooling）结构来提取道路的多尺度特征信息,在不牺牲特征空间分辨率的同时扩大了特征感受野FOV（Field-of-View）,从而提高细窄农村道路的识别率。以长株潭城市群郊区部分区域为试验对象,以高分二号国产卫星遥感影像为实验数据,将本文提出的方法与经典的几种全卷积网络方法进行实验结果对比分析。实验结果表明：（1）本文所提出的道路提取模型DC-Net在农村道路的提取上具有可行性,整体提取平均精度达到98.72%,具有较高的提取精度;（2）对比几种经典的全卷积网络模型在农村道路提取上的效果,DC-Net在农村道路提取的精度和连结性、以及树木和阴影的遮挡方面,均表现出了较好的提取结果;（3）本文提出的改进全卷积网络道路提取模型能够有效地提取高分辨率遥感影像中农村道路的特征信息,总体提取效果较好,为提高基于国产高分影像的农村道路提取精度提供了一种新的思路和方法。     

Towards an Automated Comparison of OpenStreetMap with Authoritative Road Datasets

OpenStreetMap (OSM) is an extraordinarily large and diverse spatial database of the world. Road networks are amongst the most frequently occurring spatial content within the OSM database. These road network representations are usable in many applications. However the quality of these representations can vary between locations. Comparing OSM road networks with authoritative road datasets for a given area or region is an important task in assessing OSM's fitness for use for applications like routing and navigation. Such comparisons can be technically challenging and no software implementation exists which facilitates them easily and automatically. In this article we develop and propose a flexible methodology for comparing the geometry of OSM road network data with other road datasets. Quantitative measures for the completeness and spatial accuracy of OSM are computed, including the compatibility of OSM road data with other map databases. Our methodology provides users with significant flexibility in how they can adjust the parameterization to suit their needs. This software implementation is exclusively built on open source software and a significant degree of automation is provided for these comparisons. This software can subsequently be extended and adapted for comparison between OSM and other external road datasets.     

结合轨迹数据的混合多特征道路网选取方法

道路网选取是制图综合的重要内容,针对现有方法仅考虑道路网静态特征等问题,提出了一种结合轨迹数据的混合多特征选取方法。首先以stroke为基本选取单元,构建对偶图来描述路网的结构关系,采用长度、连通度、接近度和中介度等指标对道路的静态特征进行评价;然后结合轨迹数据特点,采用车流量、车辆速度和道路交叉口附近的车辆密度等指标对道路的动态特征进行评价;最后利用基于相互关系准则的标准重要性方法计算得到各指标的权值及各道路的综合重要性值。同时引入线Voronoi图对道路进行划分,得到道路的密度特征值,并将其作为道路网选取的约束指标。实验结果表明,所提方法能够保持道路的整体结构,同时顾及道路的连通性和密度分布,而且结合了轨迹数据的动态交通特性,选取结果符合实际情况,具有一定的实用性。     

Spatial Modeling of the Black Death in Sweden

The purpose of this work is to determine whether spatial modeling can be used to model the spread of the Black Death. The study is limited to models for the propagation of the disease in Sweden in 1350. Geographic data of Swedish water bodies and medieval road networks, historical data on the population in Swedish parishes, including their medieval boundaries, along with historical notes and disease characteristics, were used to build alternative models for spatial distribution. Three different models are presented: one radial, one cost‐based and one combining network analysis and radial propagation. Simulations were made to depict different scenarios on the spread of the disease, as well as the drastic changes in the overall population of Sweden, over a couple of hundred years. For purpose of validation the population decrease estimated in each parish is compared with independent historical documents. Results from model scenarios are visualized in maps of propagation, animated video sequences and a web map service. Our analyses clearly demonstrate the power of spatial analysis and geographic information systems to describe, model and visualize epidemiologic processes in space and time.     

Road hierarchy with integration of attributes using fuzzy-AHP

Road objects in a network data model are categorised into a hierarchical structure in accordance with their functions and capacities. In this study; five road attributes derived from semantic, geometric and topological properties of network data set (i.e. road class, road length and centralities of degree, closeness and betweenness) are utilised for the creation of road network hierarchy. The relationships with each attributes except road class and their effects on the determination of road importance are analysed by using a distribution graph and the equation of Pearson correlation coefficient. For creating road network hierarchy, integration process is achieved through the application of fuzzy analytic hierarchy process assuming attributes as the fuzzy criteria. The integration process is followed by the calculation of new priority attribute that indicates the importance of road objects. At the end of the process, road class, which is the most important attribute, is also used for the validation of proposed methodology. The results show that the new priority value of a road is superior to its each attribute value in hierarchical organisation.     

改进Mask R-CNN公路病害检测算法

针对公路路面病害与背景像素对比度低导致检测困难的问题,本文提出了改进Mask R-CNN公路病害检测算法(FAC-Mask R-CNN)。首先在ResNet101基础上增加强位置信息浅层特征表达,并融合相邻特征图作为主干网络最终特征输出,同时引入CBAM模块,以减弱目标与背景像素间低对比度的影响;然后采用深度可分离卷积和空洞卷积分别代替主干网络及有效特征层输出过程应用的普通卷积,提升模型计算效率及掩码预测精度。FAC-Mask R-CNN在公路路面病害数据集(RDD)上平均精确率为89.86%,召回率为88.54%,调和均值为90%,相较于Mask R-CNN算法平均精确率提升3.09%。结果表明,FAC-Mask R-CNN能有效完成公路路面病害精细化检测与分割任务。     

路网更新的轨迹-地图匹配方法

全面准确的路网信息作为智慧城市的重要基础之一,在城市规划、交通管理以及大众出行等方面具有重要意义和价值。然而,传统的基于测量的路网数据获取方式往往周期较长,不能及时反映最新的道路信息。近几年,随着定位技术在移动设备的广泛运用,国内外学者在研究路网信息获取时逐渐将视野转向移动对象的轨迹数据中所蕴含的道路信息。当前,基于移动位置信息的路网生成和更新方法多是直接面向全部轨迹数据施加道路提取算法,在处理大规模轨迹或者大范围道路时,计算量极大。为此,本文基于轨迹地图匹配技术,提出一种采用"检查→分析→提取→更新"过程的螺旋式路网数据更新策略。其主要思想是逐条输入轨迹,借助HMM地图匹配发现已有路网中的问题路段,进而从问题路段周边局部范围内的轨迹数据中提取并更新相关道路信息。该方法仅在局部范围内利用少量轨迹数据来修复路网,避免了对整个轨迹数据集进行计算,从而有效减少了计算量。基于OpenStreetMap的武汉市区路网数据以及武汉市出租车轨迹数据的试验表明,本文提出的路网更新方法不仅可行,而且灵活高效。