ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Hidden Markov map matching through noise and sparseness
Full text PdfPdf (1.24 MB)
Source
Geographic Information Systems archive
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems table of contents
Seattle, Washington
SESSION: Traffic on road networks table of contents
Pages: 336-343  
Year of Publication: 2009
ISBN:978-1-60558-649-6
Authors
Paul Newson  Microsoft Corporation, Redmond, WA
John Krumm  Microsoft Corporation, Redmond, WA
Sponsor
SIGSPATIAL : ACM Special Interest Group on Spatial Information
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 46,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1653771.1653818
What is a DOI?

ABSTRACT

The problem of matching measured latitude/longitude points to roads is becoming increasingly important. This paper describes 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. The HMM elegantly accounts for measurement noise and the layout of the road network. We test our algorithm on ground truth data collected from a GPS receiver in a vehicle. Our test shows how the algorithm breaks down as the sampling rate of the GPS is reduced. We also test the effect of increasing amounts of additional measurement noise in order to assess how well our algorithm could deal with the inaccuracies of other location measurement systems, such as those based on WiFi and cell tower multilateration. We provide our GPS data and road network representation as a standard test set for other researchers to use in their map matching work.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
Gather, U. and V. Schultze, Robust Estimation of Scale of an Exponential Distribution. Statistica Neerlandica, 2001. 53(3): p. 327--341.
 
5
Greenfeld, J. S., Matching GPS Observations to Locations on a Digital Map, in 81th Annual Meeting of the Transportation Research Board. 2002: Washington, DC, USA.
 
6
 
7
 
8
 
9
Hummel, B., Map Matching for Vehicle Guidance, in Dynamic and Mobile GIS: Investigating Space and Time, J. Drummond and R. Billen, Editors. 2006, CRC Press: Florida.
 
10
Kim, S. and J.-H. Kim, Adaptive Fuzzy-Network-Based C-Measure Map-Matching Algorithm for Car Navigation System. IEEE Transactions on Industrial Electronics, 2001. 48(2): p. 432--441.
 
11
Krumm, J., A Markov Model for Driver Turn Prediction, in Society of Automotive Engineers (SAE) 2008 World Congress. 2008: Detroit, Michigan, USA.
 
12
Krumm, J., J. Letchner, and E. Horvitz, Map Matching with Travel Time Constraints, in Society of Automotive Engineers (SAE) 2007 World Congress. 2007: Detroit, Michigan, USA.
 
13
Lamb, P. and S. Thiebaux, Avoiding Explicit Map-Matching in Vehicle Location, in 6th World Conference on Intelligent Transportation Systems (ITS-99). 1999: Toronto, Canada.
 
14
Patterson, D. J., et al., Inferring High-Level Behavior from Low-Level Sensors, in Fifth Internation Conference on Ubiquitous Computing (UbiComp 2003). 2003, Springer. p. 73--89.
 
15
VanDiggelen, F., GNSS Accuracy: Lies, Damn Lies, and Statistics, in GPS World. 2007. p. 26--32.
 
16
White, C. E., D. Bernstein, and A. L. Kornhauser, Some map matching algorithms for personal navigation assitants. Transportation Reserach Part C: Emerging Technologies, 2000. 8(1--6): p. 91--108.