共查询到20条相似文献，搜索用时 15 毫秒
1.
Zhe Zeng Tong Zhang Qingquan Li Zhongheng Wu Haixiang Zou Chunxian Gao 《International journal of geographical information science》2016,30(4):660-690
Map matching method is a fundamental preprocessing technique for massive probe vehicle data. Various transportation applications need map matching methods to provide highly accurate and stable results. However, most current map matching approaches employ elementary geometric or topological measures, which may not be sufficient to encode the characteristic of realistic driving paths, leading to inefficiency and inaccuracy, especially in complex road networks. To address these issues, this article presents a novel map matching method, based on the measure of curvedness of Global Positioning System (GPS) trajectories. The curvature integral, which measures the curvedness feature of GPS trajectories, is considered to be one of the major matching characteristics that constrain pairwise matching between the two adjacent GPS track points. In this article, we propose the definition of the curvature integral in the context of map matching, and develop a novel accurate map matching algorithm based on the curvedness feature. Using real-world probe vehicles data, we show that the curvedness feature (CURF) constrained map matching method outperforms two classical methods for accuracy and stability under complicated road environments. 相似文献
2.
Xue Yang Kathleen Stewart Zhen Dong Xia Zhang Qingquan Li 《International journal of geographical information science》2018,32(3):601-621
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%. 相似文献
3.
Why GPS makes distances bigger than they are 总被引：1，自引：0，他引：1
Peter Ranacher Richard Brunauer Wolfgang Trutschnig Stefan Van der Spek Siegfried Reich 《International journal of geographical information science》2016,30(2):316-333
Global navigation satellite systems such as the Global Positioning System (GPS) is one of the most important sensors for movement analysis. GPS is widely used to record the trajectories of vehicles, animals and human beings. However, all GPS movement data are affected by both measurement and interpolation errors. In this article we show that measurement error causes a systematic bias in distances recorded with a GPS; the distance between two points recorded with a GPS is – on average – bigger than the true distance between these points. This systematic ‘overestimation of distance’ becomes relevant if the influence of interpolation error can be neglected, which in practice is the case for movement sampled at high frequencies. We provide a mathematical explanation of this phenomenon and illustrate that it functionally depends on the autocorrelation of GPS measurement error (C). We argue that C can be interpreted as a quality measure for movement data recorded with a GPS. If there is a strong autocorrelation between any two consecutive position estimates, they have very similar error. This error cancels out when average speed, distance or direction is calculated along the trajectory. Based on our theoretical findings we introduce a novel approach to determine C in real-world GPS movement data sampled at high frequencies. We apply our approach to pedestrian trajectories and car trajectories. We found that the measurement error in the data was strongly spatially and temporally autocorrelated and give a quality estimate of the data. Most importantly, our findings are not limited to GPS alone. The systematic bias and its implications are bound to occur in any movement data collected with absolute positioning if interpolation error can be neglected. 相似文献
4.
5.
Maximilian Konzack Thomas McKetterick Tim Ophelders Maike Buchin Luca Giuggioli Jed Long 《International journal of geographical information science》2017,31(2):320-345
The analysis of interaction between movement trajectories is of interest for various domains when movement of multiple objects is concerned. Interaction often includes a delayed response, making it difficult to detect interaction with current methods that compare movement at specific time intervals. We propose analyses and visualizations, on a local and global scale, of delayed movement responses, where an action is followed by a reaction over time, on trajectories recorded simultaneously. We developed a novel approach to compute the global delay in subquadratic time using a fast Fourier transform (FFT). Central to our local analysis of delays is the computation of a matching between the trajectories in a so-called delay space. It encodes the similarities between all pairs of points of the trajectories. In the visualization, the edges of the matching are bundled into patches, such that shape and color of a patch help to encode changes in an interaction pattern. To evaluate our approach experimentally, we have implemented it as a prototype visual analytics tool and have applied the tool on three bidimensional data sets. For this we used various measures to compute the delay space, including the directional distance, a new similarity measure, which captures more complex interactions by combining directional and spatial characteristics. We compare matchings of various methods computing similarity between trajectories. We also compare various procedures to compute the matching in the delay space, specifically the Fréchet distance, dynamic time warping (DTW), and edit distance (ED). Finally, we demonstrate how to validate the consistency of pairwise matchings by computing matchings between more than two trajectories. 相似文献
6.
Hengfeng Li Lars Kulik Kotagiri Ramamohanarao 《International journal of geographical information science》2013,27(12):2194-2222
Monitoring and predicting traffic conditions are of utmost importance in reacting to emergency events in time and for computing the real-time shortest travel-time path. Mobile sensors, such as GPS devices and smartphones, are useful for monitoring urban traffic due to their large coverage area and ease of deployment. Many researchers have employed such sensed data to model and predict traffic conditions. To do so, we first have to address the problem of associating GPS trajectories with the road network in a robust manner. Existing methods rely on point-by-point matching to map individual GPS points to a road segment. However, GPS data is imprecise due to noise in GPS signals. GPS coordinates can have errors of several meters and, therefore, direct mapping of individual points is error prone. Acknowledging that every GPS point is potentially noisy, we propose a radically different approach to overcome inaccuracy in GPS data. Instead of focusing on a point-by-point approach, our proposed method considers the set of relevant GPS points in a trajectory that can be mapped together to a road segment. This clustering approach gives us a macroscopic view of the GPS trajectories even under very noisy conditions. Our method clusters points based on the direction of movement as a spatial-linear cluster, ranks the possible route segments in the graph for each group, and searches for the best combination of segments as the overall path for the given set of GPS points. Through extensive experiments on both synthetic and real datasets, we demonstrate that, even with highly noisy GPS measurements, our proposed algorithm outperforms state-of-the-art methods in terms of both accuracy and computational cost. 相似文献
7.
通过梳理国内外场景理论的发展脉络,对场景内涵及要素特征进行了深入解读与分析,构建了包含场景要素、场景层级特征和场景规划方法在内的场景规划理论体系,从场景识别、场景构建、场景评价和场景应用视角实现了对场景规划工具的全新探索,用于指导在不同领域开展场景实践工作。并以粤港澳大湾区城市群协同发展为例,基于场景规划方法挖掘湾区的现状问题和发展目标,识别出代表未来湾区城市群协同发展方向的重要场景。最后以粤港澳大湾区城市群生态廊道构建为应用示例,初步应用场景规划方法进行场景要素分析,为下一步开展场景评价及场景应用示范等实践探索工作提供基础。 相似文献
8.
Hongchao Fan Bisheng Yang Alexander Zipf Adam Rousell 《International journal of geographical information science》2016,30(4):748-764
Matching road networks is an essential step for data enrichment and data quality assessment, among other processes. Conventionally, road networks from two datasets are matched using a line-based approach that checks for the similarity of properties of line segments. In this article, a polygon-based approach is proposed to match the OpenStreetMap road network with authority data. The algorithm first extracts urban blocks that are central elements of urban planning and are represented by polygons surrounded by their surrounding streets, and it then assigns road lines to edges of urban blocks by checking their topologies. In the matching process, polygons of urban blocks are matched in the first step by checking for overlapping areas. In the second step, edges of a matched urban block pair are further matched with each other. Road lines that are assigned to the same matched pair of urban block edges are then matched with each other. The computational cost is substantially reduced because the proposed approach matches polygons instead of road lines, and thus, the process of matching is accelerated. Experiments on Heidelberg and Shanghai datasets show that the proposed approach achieves good and robust matching results, with a precision higher than 96% and a F1-score better than 90%. 相似文献
9.
10.
基于正射影像匹配的地形变化检测与更新算法 总被引：3，自引：0，他引：3
利用新时期的航空影像和旧时期的DEM,基于正射影像匹配的相关理论,提出了地形变化检测和数据更新的自动化算法,该算法能够利用两个时期的未变化信息进行控制,避免了传统的定向过程,极大减少了人工编辑,能够同时得到变化检测的结果、更新后的DEM和DOM。实验结果证明了该算法的实用性和高效性。 相似文献
11.
Can Yang Győző Gidófalvi 《International journal of geographical information science》2018,32(3):547-570
Wide deployment of global positioning system (GPS) sensors has generated a large amount of data with numerous applications in transportation research. Due to the observation error, a map matching (MM) process is commonly performed to infer a path on a road network from a noisy GPS trajectory. The increasing data volume calls for the design of efficient and scalable MM algorithms. This article presents fast map matching (FMM), an algorithm integrating hidden Markov model with precomputation, and provides an open-source implementation. An upper bounded origin-destination table is precomputed to store all pairs of shortest paths within a certain length in the road network. As a benefit, repeated routing queries known as the bottleneck of MM are replaced with hash table search. Additionally, several degenerate cases and a problem of reverse movement are identified and addressed in FMM. Experiments on a large collection of real-world taxi trip trajectories demonstrate that FMM has achieved a considerable single-processor MM speed of 25,000–45,000 points/second varying with the output mode. Investigation on the running time of different steps in FMM reveals that after precomputation is employed, the new bottleneck is located in candidate search, and more specifically, the projection of a GPS point to the polyline of a road edge. Reverse movement in the result is also effectively reduced by applying a penalty. 相似文献
12.
The theory of experimental error in analysis of mixture experiments by abstract factor analysis or targettransformation factor analysis is considered. The theoretical implications of using signal-to-noise ratios(as weights) or canonical variates analysis to reduce the level of imbedded error in the factor model areexamined. The approach is illustrated by application to ~(13)C NMR spectra of lubricant basestockmixtures. 相似文献
13.
Kun Qi Chenglin Gong Jinyu Zhang Katrine Juul Andresen Zhenkui Jin 《Basin Research》2023,35(2):842-864
As one of the most important forcing factors, relative sea-level changes exert a major influence on the building of shelf-margin clinothems. However, it is still not well understood how these changes control the growth of shelf edges and the condition of sediments transporting into deep water, especially over the individual-clinothem scale of several 100 ky. On the late-Quaternary Pearl River margin, there are two distinct shelf-margin clinothems: SQ3 and SQ4. They have different shelf-edge trajectories (slight rising vs. steep rising) and different styles of deep-water deposition (fan lobes consisting mainly of MTDs vs. fan lobes consisting mainly of turbidites). This work takes those SQ3 and SQ4 as study objects and runs a total of 136 experiments from the Dionisos stratigraphic forward model to investigate how relative sea-level changes control the trajectories of shelf edges and the volumes of MTDs in deep water over the individual-clinothem scale. Our quantitative results suggest that under the geological background of high sediment supply on the late-Quaternary Pearl River margin, the duration of highstand systems tracts (HST) relative to lowstand systems tracts (LST) or forced regressive systems tracts (FST) has a significant influence on the building of individual shelf-margin clinothems. If the relative duration of HST is either very short or very long, slight-rising shelf-edge trajectories and large-volume MTDs would be formed, whereas if the relative duration of HST is comparable with LST or FST, steep-rising shelf-edge trajectories and limited MTDs would be formed. Through the constrains of the model set to the real geological condition of the SQ3 and SQ4 clinothems, it is found that SQ3 was caused by the quite long relative duration of HST, which made highstand deltaic systems advance over the pre-existing shelf-slope break, leading to significant accretion and instability of the shelf edge and thus, giving rise to the formation of slight-rising shelf-edge trajectories and fan lobes with high MTDs contents. SQ4, however, formed as a result of the comparable durations of HST, LST, and FST, which made highstand deltaic systems advance to but not beyond the previous shelf-slope break allowing the subsequent FST to be directly perched on the clinoform slope. Such building processes did not drive pronounced accretion and instability of the shelf edge and thus, caused the formation of steep-rising shelf-edge trajectories and fan lobes with low MTDs contents. 相似文献
14.
ABSTRACTThe amount of spatiotemporal data collected by gadgets is rapidly growing, resulting in increasing costs to transfer, process and store it. In an attempt to minimize these costs several algorithms were proposed to reduce the trajectory size. However, to choose the right algorithm depends on a careful analysis of the application scenario. Therefore, this paper evaluates seven general purpose lossy compression algorithms in terms of structural aspects and performance characteristics, regarding four transportation modes: Bike, Bus, Car and Walk. The lossy compression algorithms evaluated are: Douglas-Peucker (DP), Opening-Window (OW), Dead-Reckoning (DR), Top-Down Time-Ratio (TS), Opening-Window Time-Ratio (OS), STTrace (ST) and SQUISH (SQ). Pareto Efficiency analysis pointed out that there is no best algorithm for all assessed characteristics, but rather DP applied less error and kept length better-preserved, OW kept speed better-preserved, ST kept acceleration better-preserved and DR spent less execution time. Another important finding is that algorithms that use metrics that do not keep time information have performed quite well even with characteristics time-dependent like speed and acceleration. Finally, it is possible to see that DR had the most suitable performance in general, being among the three best algorithms in four of the five assessed performance characteristics. 相似文献
15.
16.
Hai Huang 《International journal of geographical information science》2013,27(12):2075-2094
This paper presents an original approach to dynamic anomalous behavior detection in individual trajectory using a recursive Bayesian filter. The anomalous pattern detection is of great interest for navigation, driver assistance systems, surveillance as well as crisis management. In this work, we focus on the GPS trajectories of automobiles finding where the driver’s behavior shows anomalies. Such anomalous behaviors can happen in many cases, especially when the driver encounters orientation problems, i.e., taking a wrong turn, performing a detour, or losing the way. First, three high-level features, i.e., turns and their density, detour factor, and route repetition are extracted from the given trajectory geometry, for which a long-term perspective is required to observe data sequences of a significant length instead of individual time stamps. We therefore employ high-order Markov chains with a ‘dynamic memory’ to model the trajectory integrating these long-term features. The Markov model is processed by a proposed recursive Bayesian filter to infer an optimal probability distribution of the potential anomalous driving behaviors dynamically over time. The filter performs unsupervised detection in single trajectories based on local features only. No training process is required to characterize the anomalous behaviors. By analyzing the detection results of individual trajectories, collective behaviors can be derived indicating traffic issues such as congestions and turn restrictions. Experiments are performed on volunteered geographic information (VGI) data, self-acquired trajectories, and open trajectory datasets to demonstrate the potential of the proposed approach. 相似文献
17.
为使土地登记规范化、程序化、制度化,更好地为确定土地权属、规范土地流转、保护土地权利人的权利服务,为社会经济的发展提供权属清楚、界址分明、面积准确的土地资源,该文基于目前土地登记中存在的问题,构想了一套由土地登记的法律、法规、规章和制度组成的比较完备的土地登记法律制度体系。 相似文献
18.
虚拟地形环境在游戏、仿真、虚拟现实等领域有广泛的应用,在网络环境下如何进行海量地形数据的三维表达与传输是目前研究的重点。基于对等思想提出一种适合大规模地形漫游的分布式网络结构,充分发挥客户机的作用,从而有效地减少服务器负载,采用多点下载数据,提高地形数据的传输速度。同时研究该网络结构下多点下载模型、数据预处理、数据流程和视点相关的LOD简化算法,实现网络环境下大规模地形实时漫游。实验结果表明,在分布式网络环境下,该文中提出的方案可实现大规模地形实时漫游。 相似文献
19.
20.
Rui Santos Patricia Murrieta-Flores Pável Calado Bruno Martins 《International journal of geographical information science》2018,32(2):324-348
Toponym matching, i.e. pairing strings that represent the same real-world location, is a fundamental problemfor several practical applications. The current state-of-the-art relies on string similarity metrics, either specifically developed for matching place names or integrated within methods that combine multiple metrics. However, these methods all rely on common sub-strings in order to establish similarity, and they do not effectively capture the character replacements involved in toponym changes due to transliterations or to changes in language and culture over time. In this article, we present a novel matching approach, leveraging a deep neural network to classify pairs of toponyms as either matching or nonmatching. The proposed network architecture uses recurrent nodes to build representations from the sequences of bytes that correspond to the strings that are to be matched. These representations are then combined and passed to feed-forward nodes, finally leading to a classification decision. We present the results of a wide-ranging evaluation on the performance of the proposed method, using a large dataset collected from the GeoNames gazetteer. These results show that the proposed method can significantly outperform individual similarity metrics from previous studies, as well as previous methods based on supervised machine learning for combining multiple metrics. 相似文献