Hidden Markov map matching through noise and sparseness
Hidden Markov map matching through noise and sparseness
P. Newson,John Krumm
2009 · DOI: 10.1145/1653771.1653818
ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems · 1,053 citazioni
TLDR
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.