Abstract The task of map-matching consists of finding a correspondence between a geographical point or sequence of points (e.g. obtained from GPS) and a given map. Due to many reasons, namely the noisy input data and incomplete or inaccurate maps, such a task is not trivial and can affect the validity of applications that depend on it. This includes any Transport Research projects that rely on post-hoc analysis of traces (e.g. via Floating Car Data). In this article, we describe an off-line map-matching algorithm that allows us to handle incomplete map databases. We test and compare this with other approaches and ultimately provide guidelines for use within other applications. This project is provided as open source.
An off-line map-matching algorithm for incomplete map databases
European Transport Research Review ; 1 , 3 ; 107-124
11.09.2009
18 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Map-matching Algorithm for Large Databases
Online Contents | 2015
|Multiresolution descriptor matching algorithm for fast exhaustive search in norm-sorted databases
British Library Online Contents | 2005
|Context-dependent segmentation and matching in image databases
British Library Online Contents | 2004
|Clustering Time-Series Medical Databases Based on the Improved Multiscale Matching
British Library Conference Proceedings | 2005
|