共查询到20条相似文献，搜索用时 31 毫秒
1.
2.
针对车载导航、地图网站等应用中路网要素之间交通关系维护的难题,提出一种支持路网要素交通关系自动化的智能过程模型,将路网要素交通关系自动化过程理解为由路网要素间的空间和语义关系、规则集和控制系统组成的产生式系统.该产生式系统可在路网要素空间和语义信息基础上,通过定义可扩展的交通关系规则集,自动化地生成符合应用需求的路网要素间的交通关系.此外,在该产生式系统中引入触发器概念监控和响应几何网络及其交通关系规则集的变更,实时更新逻辑网络中的连通关系信息,实现几何网络、规则集和逻辑网络三者的一致性.同时,提出路网要素交通关系处理的控制策略和关键流程,并对该智能网络模型的有效性进行了验证.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. 相似文献
3.
道路网数据匹配是地理空间数据库进行变化探测和数据更新的重要前提,不同比例尺下的道路网之间的匹配是一个非常重要的部分。本文总结和分析了道路网匹配的已有算法,针对不同比例尺道路网之间的匹配可能存在的问题和难点,设计了一个融合多种匹配技术的算法。在考虑不同比例尺下道路网数据的特点基础上,改进了空间场景结构的评价方法;分析了stroke匹配算法在不同比例尺道路网数据下的局限性,提出了一种可针对不同比例尺下道路数据存在变化与更新的stroke部分匹配算法。试验表明,文中所提出的方法能够适应不同比例尺下道路网的匹配,匹配效果较好,运行效率较高。 相似文献
4.
The assessment of OpenStreetMap (OSM) data quality has become an interdisciplinary research area over the recent years. The question of whether the OSM road network should be updated through periodic data imports from public domain data, or whether the currency of OSM data should rather rely on more traditional data collection efforts by active contributors, has led to perpetual debates within the OSM community. A US Census TIGER/Line 2005 import into OSM was accomplished in early 2008, which generated a road network foundation for the active community members in the US. In this study we perform a longitudinal analysis of road data for the US by comparing the development of OSM and TIGER/Line data since the initial TIGER/Line import. The analysis is performed for the 50 US states and the District of Columbia, and 70 Urbanized Areas. In almost all tested states and Urbanized Areas, OSM misses roads for motorized traffic when compared with TIGER/Line street data, while significant contributions could be observed in pedestrian related network data in OSM compared with corresponding TIGER/Line data. We conclude that the quality of OSM road data could be improved through new OSM editor tools allowing contributors to trace current TIGER/Line data. 相似文献
5.
介绍了车载道路信息采集和更新系统 (CRICUS)的设计和研究进展。该系统利用 3S集成技术采集道路信息并生成数字道路网数据库。初步实验表明 ,该系统的定位精度可达 1m。 相似文献
6.
Pattern recognition in road networks can be used for different applications, including spatiotemporal data mining, automated map generalization, data matching of different levels of detail, and other important research topics. Grid patterns are a common pattern type. This paper proposes and implements a method for grid pattern recognition based on the idea of mesh classification through a supervised learning process. To train the classifier, training datasets are selected from worldwide city samples with different cultural, historical, and geographical environments. Meshes are subsequently labeled as composing or noncomposing grids by participants in an experiment, and the mesh measures are defined while accounting for the mesh’s individual characteristics and spatial context. The classifier is generated using the C4.5 algorithm. The accuracy of the classifier is evaluated using Kappa statistics and the overall rate of correctness. The average Kappa value is approximately 0.74, which corresponds to a total accuracy of 87.5%. Additionally, the rationality of the classifier is evaluated in an interpretation step. Two other existing grid pattern recognition methods were also tested on the datasets, and comparison results indicate that our approach is effective in identifying grid patterns in road networks. 相似文献
7.
为推进深度学习方法在点云配准、语义分割、实例分割等领域的发展,武汉大学联合国内外多家高等院校和研究机构发布了包含多类型场景的地面站点云配准基准数据集WHU-TLS和包含语义、实例的城市级车载点云基准数据集WHU-MLS。其中,WHU-TLS基准数据集涵盖了地铁站、高铁站、山地、公园、校园、住宅、河岸、文化遗产建筑、地下矿道、隧道等10种不同的环境,共包含115个测站、17.4亿个三维点以及点云之间的真实转换矩阵,为点云配准提供了迄今为止最大规模的基准数据集。WHU-MLS基准数据集涵盖了地面特征(机动车道、道路标线、井盖、非机动车道),动态目标(行人、车辆),植被(树木、树丛、低矮植被),杆状地物及其附属结构(电线杆、独立提示牌、路灯、信号灯、独立探头等),建筑和结构设施(房屋、道路隔离结构、围墙和栅栏)以及其他公共和便利设施(垃圾桶、邮筒、消防栓、街头座椅、电力线等)等6大类30余小类地物要素,共包含2亿多个点和超过5000个实例对象,为语义分割、实例分割点云深度学习网络的训练、测试和性能评估提供了当前最为丰富的基准数据集。 相似文献
8.
Network Density and the Delimitation of Urban Areas 总被引：3，自引：0，他引：3
Giuseppe Borruso 《Transactions in GIS》2003,7(2):177-191
This paper examines network analysis for urban areas. The research is focused on the problem of definition and visualisation of network geography and network spaces at different scales. The urban scale of analysis is examined and different spatial indices are considered. The built environment of the city is considered as a reference environment for a road network density index. The latter is implemented in order to study the spatial interactions between network phenomena and spaces and to provide further elements for the analysis of urban shape. The study is focused in particular on understanding spatial patterns drawn by networks and in helping with the delimitation of city centres. Different approaches are used to obtain the two indices: a grid–based analysis and a spatial density estimator based on Kernel Density Estimation. The two methodologies are analysed and compared using point data for the urban road network junctions and street numbers as house location identifiers in the Trieste (Italy) Municipality area. The density analysis is also used on road network junctions' data for the city of Swindon (UK) in order to test the methodology on a different urban area. 相似文献
9.
10.
11.
ABSTRACTOpenStreetMap (OSM) database has previously been used to support spatial disaggregation of population data by partly masking out non-residential impervious areas in the European Copernicus imperviousness layer (IL). However, the exact procedure of OSM data incorporation is unknown, and its contribution to the improvement of estimation accuracy has never been studied. In this article, we present a sensitivity study to find out which road categories should be used for masking of IL and how the linear features might be transformed to raster representation. Using Austria and Slovenia as a study area, 2006 commune population counts are disaggregated into 100 m grid cells using 12 versions of modified IL. Further tuning of estimates is performed using CORINE Land Cover (CLC) data in an iterative algorithm. Disaggregated grids are then validated against reference 1 km census-based data. The results show that overall error was reduced thanks to OSM incorporation in all tested scenarios, although the relative improvement varies between as well as within the two countries. The best result (5.3% reduction) was achieved using railways and three major road categories (motorway, trunk, and primary) with double exaggeration of width. 相似文献
12.
The amount of volunteered geographic information (VGI) has increased over the past decade, and several studies have been conducted to evaluate the quality of VGI data. In this study, we evaluate the completeness of the road network in the VGI data set OpenStreetMap (OSM). The evaluation is based on an accurate and efficient network-matching algorithm. The study begins with a comparison of the two main strategies for network matching: segment-based and node-based matching. The comparison shows that the result quality is comparable for the two strategies, but the node-based result is considerably more computationally efficient. Therefore, we improve the accuracy of node-based algorithm by handling topological relationships and detecting patterns of complicated network components. Finally, we conduct a case study on the extended node-based algorithm in which we match OSM to the Swedish National Road Database (NVDB) in Scania, Sweden. The case study reveals that OSM has a completeness of 87% in the urban areas and 69% in the rural areas of Scania. The accuracy of the matching process is approximately 95%. The conclusion is that the extended node-based algorithm is sufficiently accurate and efficient for conducting surveys of the quality of OSM and other VGI road data sets in large geographic regions. 相似文献
13.
路网更新的轨迹-地图匹配方法 总被引：2，自引：2，他引：0
全面准确的路网信息作为智慧城市的重要基础之一,在城市规划、交通管理以及大众出行等方面具有重要意义和价值。然而,传统的基于测量的路网数据获取方式往往周期较长,不能及时反映最新的道路信息。近几年,随着定位技术在移动设备的广泛运用,国内外学者在研究路网信息获取时逐渐将视野转向移动对象的轨迹数据中所蕴含的道路信息。当前,基于移动位置信息的路网生成和更新方法多是直接面向全部轨迹数据施加道路提取算法,在处理大规模轨迹或者大范围道路时,计算量极大。为此,本文基于轨迹地图匹配技术,提出一种采用"检查→分析→提取→更新"过程的螺旋式路网数据更新策略。其主要思想是逐条输入轨迹,借助HMM地图匹配发现已有路网中的问题路段,进而从问题路段周边局部范围内的轨迹数据中提取并更新相关道路信息。该方法仅在局部范围内利用少量轨迹数据来修复路网,避免了对整个轨迹数据集进行计算,从而有效减少了计算量。基于OpenStreetMap的武汉市区路网数据以及武汉市出租车轨迹数据的试验表明,本文提出的路网更新方法不仅可行,而且灵活高效。 相似文献
14.
The emergence of the Sensor Web has paved the way for a new set of innovative software applications that exploit the enhanced availability of real‐time information. This article describes one such application built from Sensor Web components that aggregates GPS track data from a fleet of vehicles to provide an overview of road traffic congestion at the city scale. The application embodies a Service Oriented Architecture; web service components are used to archive and pre‐process incoming sensor observations, to encapsulate a horizontally partitioned spatial database that performs geoprocessing, and to disseminate results to client applications. Our results confirm that floating car data can provide an accurate depiction of current road traffic conditions. The presented solution uses Open Geospatial Consortium web services where possible and serves to highlight the difficulties inherent in achieving horizontal database scalability in sensor based geoprocessing systems. 相似文献
15.
道路边界精确提取建模是城市道路管理、智能交通规划和高精度地图制作等领域的重要课题之一。本文提出了一种基于车载激光雷达点云数据和开源街道地图(OSM)的三维道路边界精确提取方法。首先,针对原始车载LiDAR点云数据应用布料模拟滤波分离地面点,再结合相对高程分析获取道路边界点候选数据集。然后,应用OSM矢量道路网数据的节点辅助道路边界点候选点集进行分段。最后,在各分段点云数据集中基于随机抽样一致性算法获得三维道路边界点集。通过直道、弯道及高密度复杂场景3种不同类型的城区道路边界路段分类提取试验。结果表明,利用该方法进行道路边界提取的准确率和召回率分别达96.12%和95.17%,F1值达92.11%,本文方法可用于高精度道路边界的三维精细提取与矢量化,进而为智能交通与无人驾驶导航提供支撑。 相似文献
16.
获取现势性的交通道路数据是数字城市和智慧城市建设的基础，基于传统测绘的道路网更新方法存在一定局限性，而基于众源数据及行车轨迹数据更新道路网近年来则倍受关注。首先提出了一种新的道路变化增量更新方法，该方法先对历史道路网建立面拓扑结构，生成由道路网组成的最小闭合面域（道路网眼）；然后以道路网眼为基本控制单元，综合利用轨迹点上下文距离信息和隐马尔可夫模型（hidden Markov model，HMM），提取失配轨迹点和失配轨迹段；最后采用缓冲区分析和最大密度法对失配轨迹提取骨架线，创建新增道路，增量更新历史道路网。实验结果表明，以道路网眼为控制单元，利用轨迹点上下文距离分析和HMM捕获失配轨迹点，可提高失配轨迹点的提取效率，改善道路网更新效果。该方法可用于大规模路网的增量式更新。 相似文献
17.
道路网是最重要的地理空间要素之一,空间数据融合能够把不同来源道路空间数据或信息加以结合,以获得信息量更丰富或更适于处理、分析、决策的新的数据集。传统的方法受限于道路网数据模型、属性数据类型以及缺少唯一标识的属性信息,道路网融合方法多以各个弧段或道路的位置、形状、方向等几何特征进行匹配,而忽略了道路的语义匹配。本文在数据来源与技术分析的基础上,提出了一种在工程化应用中可行的语义与几何相结合的道路网匹配方法,并通过FME实现空间数据融合,旨在为两个或多个道路网数据融合、联动更新提供方法参考。 相似文献
18.
With the increasing availability of location-aware devices, passively collected big GPS trajectory data offer new opportunities for analyzing human mobility. Processing big GPS trajectory data, especially extracting information from billions of trajectory points and assigning information to corresponding road segments in road networks, is a challenging but necessary task for researchers to take full advantage of big data. In this research, we propose an Apache Spark and Sedona-based computing framework that is capable of estimating traffic speeds for statewide road networks from GPS trajectory data. Taking advantage of spatial resilient distributed datasets supported by Sedona, the framework provides high computing efficiency while using affordable computing resources for map matching and waypoint gap filling. Using a mobility dataset of 126 million trajectory points collected in California, and a road network inclusive of all road types, we computed hourly speed estimates for approximately 600,000 segments across the state. Comparing speed estimates for freeway segments with speed limits, our speed estimates showed that speeding on freeways occurred mostly during the nighttime, while analysis of travel on residential roads showed that speeds were relatively stable over the 24-h period. 相似文献
19.
This paper describes a map-matching algorithm designed to support the navigational functions of a real-time vehicle performance and emissions monitoring system currently under development, and other transport telematics applications. The algorithm is used together with the outputs of an extended Kalman filter formulation for the integration of GPS and dead reckoning data, and a spatial digital database of the road network, to provide continuous, accurate and reliable vehicle location on a given road segment. This is irrespective of the constraints of the operational environment, thus alleviating outage and accuracy problems associated with the use of stand-alone location sensors. The map-matching algorithm has been tested using real field data and has been found to be superior to existing algorithms, particularly in how it performs at road intersections. 相似文献
20.
Qi Zhou 《Transactions in GIS》2015,19(6):848-876
Delineated built‐up areas may be used for applications such as navigation, database enrichment and the identification of urban sprawl. As more road network data have become available, many studies have considered using road network data to delineate built‐up areas. This study investigated the three existing approaches to delineating built‐up areas on a map: the grid‐based approach, kernel density analysis and an approach based on street blocks. These approaches are evaluated and compared from three angles. First, two measures were proposed to quantitatively evaluate the land area of the delineated built‐up areas; second, a questionnaire was designed to visually compare the representations of the delineated built‐up areas; and, third, the time complexity of using each approach was tested. The three approaches were applied to different sets of road network data for New Zealand; data from buildings and residential areas were used as benchmarks. The results showed that: (1) in a quantitative assessment, both the grid‐based approach and kernel density analysis can usually detect more built‐up areas than the approach based on street blocks; (2) on visual inspection, most of the students who completed the questionnaire performed the representations using the approach based on street blocks; and (3) in time complexity, the approach based on street blocks always takes the least time. 相似文献