首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 687 毫秒
1.
Lane-level road network updating is crucial for urban traffic applications that use geographic information systems contributing to, for example, intelligent driving, route planning and traffic control. Researchers have developed various algorithms to update road networks using sensor data, such as high-definition images or GPS data; however, approaches that involve change detection for road networks at lane level using GPS data are less common. This paper presents a novel method for automatic change detection of lane-level road networks based on GPS trajectories of vehicles. The proposed method includes two steps: map matching at lane level and lane-level change recognition. To integrate the most up-to-date GPS data with a lane-level road network, this research uses a fuzzy logic road network matching method. The proposed map-matching method starts with a confirmation of candidate lane-level road segments that use error ellipses derived from the GPS data, and then computes the membership degree between GPS data and candidate lane-level segments. The GPS trajectory data is classified into successful or unsuccessful matches using a set of defuzzification rules. Any topological and geometrical changes to road networks are detected by analysing the two kinds of matching results and comparing their relationships with the original road network. Change detection results for road networks in Wuhan, China using collected GPS trajectories show that these methods can be successfully applied to detect lane-level road changes including added lanes, closed lanes and lane-changing and turning rules, while achieving a robust detection precision of above 80%.  相似文献   

2.
Detailed real-time road data are an important prerequisite for navigation and intelligent transportation systems. As accident-prone areas, road intersections play a critical role in route guidance and traffic management. Ubiquitous trajectory data have led to a recent surge in road map reconstruction. However, it is still challenging to automatically generate detailed structural models for road intersections, especially from low-frequency trajectory data. We propose a novel three-step approach to extract the structural and semantic information of road intersections from low-frequency trajectories. The spatial coverage of road intersections is first detected based on hotspot analysis and triangulation-based point clustering. Next, an improved hierarchical trajectory clustering algorithm is designed to adaptively extract the turning modes and traffic rules of road intersections. Finally, structural models are generated via K-segment fitting and common subsequence merging. Experimental results demonstrate that the proposed method can efficiently handle low-frequency, unstable trajectory data and accurately extract the structural and semantic features of road intersections. Therefore, the proposed method provides a promising solution for enriching and updating routable road data.  相似文献   

3.
Geospatial data matching is an important prerequisite for data integration, change detection and data updating. At present, crowdsourcing geospatial data are attracting considerable attention with its significant potential for timely and cost-effective updating of geospatial data and Geographical Information Science (GIS) applications. To integrate the available and up-to-date information of multi-source geospatial data, this article proposes a heuristic probabilistic relaxation road network matching method. The proposed method starts with an initial probabilistic matrix according to the dissimilarities in the shapes and then integrates the relative compatibility coefficient of neighbouring candidate pairs to iteratively update the initial probabilistic matrix until the probabilistic matrix is globally consistent. Finally, the initial 1:1 matching pairs are selected on the basis of probabilities that are calculated and refined on the basis of the structural similarity of the selected matching pairs. A process of matching is then implemented to find M:N matching pairs. Matching between OpenStreetMap network data and professional road network data shows that our method is independent of matching direction, successfully matches 1:0 (Null), 1:1 and M:N pairs, and achieves a robust matching precision of above 95%.  相似文献   

4.
Spatial data can be represented at different scales, and this leads to the issue of multi-scale spatial representation. Multi-scale spatial representation has been widely applied to online mapping products (e.g., Google Maps and Yahoo Maps). However, in most current products, multi-scale representation can only be achieved through a series of maps at fixed scales, resulting in a discontinuity (i.e., with jumps) in the transformation between scales and a mismatch between the available scales and users' desired scales. Therefore, it is very desirable to achieve smoothly continuous multi-scale spatial representations. This article describes an integrated approach to build a hierarchical structure of a road network for continuous multi-scale representation purposes, especially continuous selective omission of roads in a network. In this hierarchical structure, the linear and areal hierarchies are constructed, respectively, using two existing approaches for the linear and areal patterns in a road network. Continuous multi-scale representation of a road network can be achieved by searching in these hierarchies. This approach is validated by applying it to two study areas, and the results are evaluated by both quantitative analysis with two measures (i.e., similarity and average connectivity) and visual inspection. Experimental results show that this integrated approach performs better than existing approaches, especially in terms of preservation of connectivity and patterns of a road network. With this approach, efficient and continuous multi-scale selective omission of road networks becomes feasible.  相似文献   

5.
Integrating heterogeneous spatial data is a crucial problem for geographical information systems (GIS) applications. Previous studies mainly focus on the matching of heterogeneous road networks or heterogeneous polygonal data sets. Few literatures attempt to approach the problem of integrating the point of interest (POI) from volunteered geographic information (VGI) and professional road networks from official mapping agencies. Hence, the article proposes an approach for integrating VGI POIs and professional road networks. The proposed method first generates a POI connectivity graph by mining the linear cluster patterns from POIs. Secondly, the matching nodes between the POI connectivity graph and the associated road network are fulfilled by probabilistic relaxation and refined by a vector median filtering (VMF). Finally, POIs are aligned to the road network by an affine transformation according to the matching nodes. Experiments demonstrate that the proposed method integrates both the POIs from VGI and the POIs from official mapping agencies with the associated road networks effectively and validly, providing a promising solution for enriching professional road networks by integrating VGI POIs.  相似文献   

6.
Selection of roads is an intractable generalization operation due to the difficulty in retaining the density difference and connectivity of a road network. This paper proposes a novel approach of selective omission for roads based on mesh density. The density of a road network and its local variations are calculated using meshes as units. Since maps at different scales usually reveal different densities, different density thresholds for road networks are determined on the basis of theoretical analysis and empirical study of mesh densities on maps at different scales. The selection process starts with the identification of the meshes that have a density beyond the threshold. The mesh with the largest density is first treated. Its bounding road segments are ordered according to their relative importance. The least important segment is eliminated. The remaining segments are then merged with the adjacent mesh, thus forming a new mesh. The selection procedure is repeated until none of the meshes has a density beyond the threshold. Such a process of eliminating road segments and merging meshes can ensure the road network connectivity. In this study, the meshes are classified depending on the types of road segment. For the different mesh types, their density thresholds are set to be different, which can be used as an indicator for the preservation of the density difference. This proposed approach considers topological, geometric and semantic properties of the road network. It was applied to two sets of road networks, and the results of selection are convincing. This methodology has now been adopted for the updating of 1:50,000 maps of China.  相似文献   

7.
以闽江上游地区为例,在传统指数的基础上,提出并采用改进后的道路网络线密度和道路网络影响域面密度指数,结合空间自相关分析方法,从线上和面上综合探索道路网络对生态干扰的空间分异格局;并分析指数间的相关性。结果表明：① 道路干扰程度具有明显的地区差异,在研究区中部、东部和南部存在空间集聚效应;② 考虑到坡度影响,同等级的道路缓冲带宽度并不是一个固定值;③ 所有指数均呈显著正相关,同类指数相关性大,不同类指数相关性小。若仅采用单一的线密度或面密度指数,则将导致信息不全;虽然同类指数间相关性很大,相互印证,但改进后的指数更加符合客观事实,建议采用。  相似文献   

8.
Personalized navigation and way-finding are prominent research areas of location-based service (LBSs). This includes innovative concepts for car navigation. Within this paper, we investigate the idea of providing drivers a routing suggestion which avoids ‘complicated crossings’ in urban areas. Inexperienced drivers include persons who have a driver’s license but, for whatever reason, feel uncomfortable to drive in a city environment. Situations where the inexperienced driver has to depend on a navigation device and reach a destination in an unfamiliar territory may be difficult. Preferences of inexperienced drivers are investigated. ‘Fears’ include driving into ‘complicated crossings’. Therefore, the definition and spatial characteristics of ‘complicated crossings’ are investigated. We use OpenStreetMap as a road dataset for the routing network. Based on the topological characteristics of the dataset, measured by the number of nodes, we identify crossings that are ‘complicated’. The user can choose to compute an alternative route that avoids these complicated crossings. This methodology is one step in building a full ‘inexperienced drivers’ routing system, which includes additional preferences from the user group, for example, as avoiding left turns where no traffic light is present.  相似文献   

9.
This paper introduces a robust method for computing the optimal route with hierarchy. We convert a planar road network into its Voronoi-based counterpart with multiple levels of detail (LoDs), which is subsequently assigned travel times that are estimated for different times of day using taxicab trajectory data. On the basis of this network structure, we model the path-finding process in travel, as the optimal route with hierarchy is computed in a ‘coarse-to-fine’ manner. In other words, the route is iteratively constructed from roads in a low LoD network to roads in a high LoD network. To confirm the efficiency and effectiveness of our method, comparative experiments were conducted using randomly selected pairs of origins/destinations in Wuhan, China. The results indicate that our travel lengths are on average 12% longer than those computed by the Dijkstra algorithm and 15% shorter than those computed by the hierarchical algorithm (in ArcGIS). Our travel times are on average 29% longer than those computed by the Dijkstra algorithm and 31% shorter than those computed by the hierarchical algorithm (in ArcGIS). Hence, we argue that our method is situated in terms of performance between the Dijkstra algorithm and the hierarchical algorithm (in ArcGIS). Moreover, road usage patterns confirm that our algorithm is cognitively equivalent to the hierarchical algorithm (in ArcGIS) by favoring high-class roads and outperforms the Dijkstra algorithm by avoiding choosing low-class roads. Computationally, our method outperforms the Dijkstra algorithm but is on the same level as the hierarchical algorithm (in ArcGIS) in terms of efficiency. Therefore, it has the potential to be used in real-time routing applications or services.  相似文献   

10.
城市道路数据的完整性和实时性是保障位置服务和规划导航路径的关键支撑。该文提出一种基于共享单车轨迹数据的新增自行车骑行道路自动检测和更新方法:首先,结合缓冲区方法和轨迹—路网几何特征检测增量轨迹;其次,基于分段—聚类—聚合策略提取更新路段,利用多特征融合密度聚类算法与最小外包矩形骨架线法提取增量道路中心线;最后,基于拓扑规则完成道路更新。以广州市共享单车轨迹为例,将该方法与传统栅格细化法进行实验对比,结果表明:该方法能有效更新道路网络,且在2 m和5 m精细尺度范围内提取的新增道路覆盖精度提升14%左右;在7 m尺度下精度达90%以上,在10 m尺度下精度达96%以上。  相似文献   

11.
谢波  肖扬谋 《地理科学进展》2022,41(10):1956-1968
机动交通快速发展背景下城市道路交通安全问题日益严峻,道路网络作为影响区域交通流与居民交通出行行为的关键因素,对区域交通事故的数量、类型和空间分布具有重要影响。论文从道路布局形式与几何拓扑特征2个方面归纳总结城市道路网络特征对交通事故的作用机理,并通过梳理道路网络与交通出行行为的关系分析其对交通事故的潜在影响。研究指出,格网型、平行曲线型、回路尽端型等道路网络布局形式以及中心性、连通性等道路网络拓扑指标,对交通事故的类型、频率和严重程度的影响存在差异性和空间尺度效应;合理的交叉口密度、路网密度、街区密度等道路网络几何特征对于提升交通安全水平具有重要作用。未来研究需要进一步运用复杂网络理论刻画道路网络的结构、功能等特征,在控制居住自选择效应的基础上,从交通出行行为视角深入分析复杂道路网络对交通事故的作用机制与非线性影响,同时考虑道路网络特征与建成环境的潜在交互作用。  相似文献   

12.
We propose a grounded ontological theory of channel networks to categorize features, such as junctions, in road network databases. The theory is grounded, because its primitives can be given an unambiguous interpretation into directly observable qualities of physical road networks, such as supported movements and their medium, connectedness of such media, and turnoff restrictions. The theory provides a very general approach to automatically annotate and integrate road network data from heterogeneous sources, because it rests on application-independent observation principles. We suggest that road network categories such as junctions and roads are based on locomotion affordances. Road network databases can be mapped into our channel network theory, so that instances of roads and junctions can be automatically categorized or checked for consistency by what they afford. In this paper, we introduce affordance-based definitions of a road network and a junction, and show that the definition of latter is satisfied by some of the most common junction types.  相似文献   

13.
  相似文献   

14.
宁夏回族自治区作为我国唯一的省级回族集聚地区,是一个很独特的地理-人口-交通单元,也是连接华北和西北的重要节点。以宁夏的交通路网数据为基础,通过设置阻抗改进网络分析法,并结合成本距离算法和GIS空间分析计算2011、2017年和2023年的县(区)可达性,研究全区路网的空间结构特征,并提出路网发展的决策建议。研究表明:宁夏已经构建路网的主骨架,但路网发展不均衡,北部的路网建设优于南部;县(区)的平均可达性由2011年的4.02 h缩短为2017年的3.75 h,路网可达性迅速提升,时空收敛效应显著;县(区)可达性的差异不断减小,全区路网空间结构的均衡性逐步增强。宁夏应重点建设以银川为中心的运输通道,通过加快南部地区的铁路建设来进一步优化全区路网布局,为全区的经济社会发展和“一带一路”建设提供运输支撑。  相似文献   

15.
Moving objects produce trajectories, which are typically observed in a finite sample of time‐stamped locations. Between sample points, we are uncertain about the moving objects's location. When we assume extra information about an object, for instance, a (possibly location‐dependent) speed limit, we can use space–time prisms to model the uncertainty of an object's location.

Until now, space–time prisms have been studied for unconstrained movement in the 2D plane. In this paper, we study space–time prisms for objects that are constrained to travel on a road network. Movement on a road network can be viewed as essentially one‐dimensional. We describe the geometry of a space–time prism on a road network and give an algorithm to compute and visualize space–time prisms. For experiments and illustration, we have implemented this algorithm in MATHEMATICA.

Furthermore, we study the alibi query, which asks whether two moving objects could have possibly met or not. This comes down to deciding if the chains of space–time prisms produced by these moving objects intersect. We give an efficient algorithm to answer the alibi query for moving objects on a road network. This algorithm also determines where and when two moving objects may have met.  相似文献   

16.
Selective omission in a road network is a necessary operation for road network generalization. Most existing selective omission approaches involve one or two geometric parameters at a specific scale to determine which roads should be retained or eliminated. This study proposes an approach for determining the empirical threshold for such a parameter. The idea of the proposed approach is to first subdivide a large road network, and then to use appropriate threshold(s) obtained from one or several subdivisions to infer an appropriate threshold for the large one. A series of experiments was carried out to validate the proposed approach. Specifically, the road network data for New Zealand and Hong Kong at different scales (ranging from 1:50,000 to 1:250,000) were used as the experimental data, and subdivided according to different modes (i.e. administrative boundary data, a regular grid of different sizes, different update years, and different road network patterns). Not only geometric parameters, but also structural and hybrid parameters of existing selective omission approaches were involved in the testing. The experimental results show that although the most appropriate thresholds obtained from different subdivisions are not always the same, in most cases, the appropriate threshold ranges often overlap, especially for geometric parameters, and they also overlap with those obtained from the large road network data. This finding is consistent with the use of different subdivision modes, which verifies the effectiveness of the proposed approach. Several issues involving the use of the proposed approach are also addressed.  相似文献   

17.
The spatial patterns of road networks reflect the morphological and structural characteristics of cities. Previous studies have focused mainly on seeking universal laws in road networks rather than explaining their differences. A new approach for road network pattern analysis is proposed that has been inspired by landscape metric analysis. The utility of this approach is illustrated through (but is not limited to) the extraction of the main factors in network landscapes, or network-scapes for short. Twenty-four metrics were calculated for network-scapes of 100 cities worldwide, before an exploratory analysis is performed to detect the main factors. Four main factors were revealed and may be regarded as the characteristic indicators of road networks, which were identified to be evenness, richness-density, shape irregularity, and size and shape variation. The meanings of these factors are explained, and their spatial distributions are illustrated. Compared to existing road network analytics, these factors depict better the characteristic differences of road networks. The proposed approach provides a new framework for road network pattern analysis from a cellular perspective.  相似文献   

18.
  相似文献   

19.
面向指路标志系统的交通网络数据模型及应用   总被引：4，自引：0，他引：4  
指路标志指示的信息与路网的拓扑数据、几何特征和交通网络的服务规则紧密相关。在传统的弧段—结点数据模型基础上拓展了结点—邻近结点拓扑关系,加入与交叉口相关的路网几何特征和交通网络服务规则,建立面向指路标志系统的交通网络数据模型。将这种数据模型应用于广州市城市路网的指路标志系统中,实现了城市路网指路标志的自动生成。  相似文献   

20.
王丽  曾辉 《地理研究》2012,31(5):853-862
本文以我国典型快速城市化地区深圳市为例,综合使用GIS技术、道路网络结构特征分析、景观格局分析和相关分析方法研究其道路网络结构特征的成因及其景观生态效应。在确定了24个独立的空间研究单元的基础上,重点分析了深圳市道路网络结构特征的相关关系、城市化水平差异对道路网络结构特征的影响和道路格局特征的景观整体及重要组分的格局效应。结果表明:城市建设用地密度的增加导致交通用地密度、节点和廊道储量增加,道路网络结构复杂程度、格局指数降低;资源条件、环境和生态保护约束是导致道路网络复杂性增加、结构发育水平下降、网络格局指数不断降低的主要原因;深圳市的道路网络格局特征对全市景观整体格局没有表现显著的约束性影响,对建设用地显示出环境保护约束和空间吸引两个方面的综合效应,对于林地则表现出生态保护约束、空间排斥和物理分割三个方面的综合效应。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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