scispace - formally typeset
Open AccessProceedings Article

On map-matching vehicle tracking data

TLDR
This work presents three algorithms that consider especially the trajectory nature of the data rather than simply the current position as in the typical map-matching case, and proposes an incremental algorithm that matches consecutive portions of the trajectory to the road network.
Abstract
Vehicle tracking data is an essential "raw" material for a broad range of applications such as traffic management and control, routing, and navigation. An important issue with this data is its accuracy. The method of sampling vehicular movement using GPS is affected by two error sources and consequently produces inaccurate trajectory data. To become useful, the data has to be related to the underlying road network by means of map matching algorithms. We present three such algorithms that consider especially the trajectory nature of the data rather than simply the current position as in the typical map-matching case. An incremental algorithm is proposed that matches consecutive portions of the trajectory to the road network, effectively trading accuracy for speed of computation. In contrast, the two global algorithms compare the entire trajectory to candidate paths in the road network. The algorithms are evaluated in terms of (i) their running time and (ii) the quality of their matching result. Two novel quality measures utilizing the Frechet distance are introduced and subsequently used in an experimental evaluation to assess the quality of matching real tracking data to a road network.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Trajectory Data Mining: An Overview

TL;DR: A systematic survey on the major research into trajectory data mining, providing a panorama of the field as well as the scope of its research topics, and introduces the methods that transform trajectories into other data formats, such as graphs, matrices, and tensors.
Proceedings ArticleDOI

Hidden Markov map matching through noise and sparseness

TL;DR: A novel, principled map matching algorithm that uses a Hidden Markov Model (HMM) to find the most likely road route represented by a time-stamped sequence of latitude/longitude pairs, which elegantly accounts for measurement noise and the layout of the road network.
Proceedings ArticleDOI

Map-matching for low-sampling-rate GPS trajectories

TL;DR: The results show that the ST-matching algorithm significantly outperform incremental algorithm in terms of matching accuracy for low-sampling trajectories and when compared with AFD-based global algorithm, ST-Matching also improves accuracy as well as running time.
BookDOI

Computing with Spatial Trajectories

Yu Zheng, +1 more
TL;DR: This book presents an overview on both fundamentals and the state-of-the-art research inspired by spatial trajectory data, as well as a special focus on trajectory pattern mining, spatio-temporal data mining and location-based social networks.
Journal ArticleDOI

Semantic trajectories modeling and analysis

TL;DR: A survey of the approaches and techniques for constructing trajectories from movement tracks, enriching trajectories with semantic information to enable the desired interpretations of movements, and using data mining to analyze semantic trajectories to extract knowledge about their characteristics.
References
More filters
Book

Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison

TL;DR: In this paper, a mudflap assembly for use with a dump vehicle having dual tires at the rear end thereof and including a pair of flexible flap sections one of which is supported by a rigid member adjacent the dual tires and the other is located above and to the rear of the rigid member and is secured at its upper end to the dump body.
Book

GPS satellite surveying

TL;DR: Elements of Satellite Surveying The Global Positioning System Adjustment Computations Least Squares Adjustment Examples Links to Physical Observations The Three-Dimensional Geodetic Model GPS Observables Propagation Media, Multipath, and Phase Center Processing GPS Carrier Phases Network Adjustments Ellipsoidal and Conformal Mapping Models Useful Transformations Datums, Standards, and Specifications Appendices References Abbreviations for Frequently Used References Indexes as discussed by the authors.
Journal ArticleDOI

Computing the fréchet distance between two polygonal curves

TL;DR: As a measure for the resemblance of curves in arbitrary dimensions the authors consider the so-called Frechet-distance, which is compatible with parametrizations of the curves, and for polygonal chains P and Q consisting of p and q edges an algorithm of runtime O(pq log( pq))) measuring the Frechet Distance.