Please use this identifier to cite or link to this item:
Title: Map matching and uncertainty: an algorithm and real-world experiments
Authors: GHYS, Kristof
OTHMAN, Walied 
Van Goidsenhoven, Dries
VAISMAN, Alejandro 
Issue Date: 2009
Publisher: ACM
Source: Agrawal, Divyakant & Walid G., Aref & Chang-Tien, Lu & Mohamed, Mokbel & Peter, Scheuermann & Cyrus, Shahabi & Ouri, Wolfson (Ed.) Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, p. 468-471
Abstract: A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution to this problem is linear interpolation. A more realistic model is based on the notion of uncertainty modelled by space-time prisms, which capture the positions where the object could have been, when it moved from a to b. Often, object positions measured by location-aware devices are not on a road network. Thus, matching the user's position to a location on the digital map is required. This problem is called map matching. In this paper we study the relation between map matching and uncertainty, and propose an algorithm that combines weighted k-shortest paths with space-time prisms. We apply this algorithm to two real-world case studies and we show that accounting for uncertainty leads to obtaining more positive matchings.
Keywords: GIS, map matching, uncertainty
Document URI:
Link to publication:
ISBN: 978-1-60558-649-6
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
p468_Ghys.pdfPublished version168.01 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 18, 2022


checked on May 18, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.