Paper Info
Title
An Offline Map Matching via Integer Programming
Abstract
The map matching problem is, given a spatial road network and a sequence of locations of an object moving on the network, to identify the path in the network that the moving object passed through. In this paper, an integer programming formulation for the offline map matching problem is presented. This is the first approach that gives the optimal solution with respect to a widely used objective function for map matching.
Year
DOI
Venue
2010
10.1109/ICPR.2010.1022
Pattern Recognition
Keywords
Field
DocType
data handling,integer programming,pattern matching,traffic engineering computing,integer programming,offline map matching,spatial road network,integer programming,map matching
Computer vision,Computer science,Integer programming,Artificial intelligence,Global Positioning System,Linear programming,3-dimensional matching,Pattern matching,Group method of data handling,Map matching,Trajectory
Conference
ISSN
ISBN
Citations 
1051-4651
978-1-4244-7542-1
4
PageRank 
References 
Authors
0.63
3
1
Name
Order
Citations
PageRank
Hiroki Yanagisawa140.63