On Map-Matching Vehicle Tracking Data

By S. Brakatsoulas, D. Pfoser, Randall Salas, C. Wenk. Very Large Data Bases Conference, 2005

687 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/d91953b493323c18a1af5ff92f2f78da15dcda55

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Map-matching for low-sampling-rate GPS trajectories (2009, background): “In this paper, we focus on low sampling rate GPS trajectories with ∆𝑇 ≥ 2𝑚𝑖𝑛 .”
A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation (2021, background): “Some works [38, 39] aim to match an entire trajectory with a road network by computing the Euclidean distance.”
The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data (2011, methodology): “New deterministic algorithms emerged to directly match partial trajectories to the road by using the topology of the network [16] and topological metrics based on the Fréchet distance [8], [43].”
Semantic trajectories modeling and analysis (2013, background): “In the same context, Brakatsoulas et al. [2005] propose the following methodology: for every point Pi, given that point Pi−1 has already been matched to an edge c3, the adjacent edges to this edge are the candidate edges to be matched to Pi.”
Hidden Markov map matching through noise and sparseness (2009, methodology): “One of the most sophisticated geometric matching algorithms is from Brakatsoulas et al. [3].”
Trajectory Data Mining (2015, methodology): “Representative algorithms are those that use the Fréchet distance to measure the fit between a GPS sequence and candidate road sequence [9].”
Discovering popular routes from trajectories (2011, methodology): “Notice that if there is a road map available, we can find out the transfer network by map-matching [26] trajectories, but here we attempt to make this work compatible with both constraint and un-constraint trajectories.”
An Interactive-Voting Based Map Matching Algorithm (2010, methodology): “This work is extended in [21] with average Fréchet distance to reduce the effect of outliers.”