Hidden Markov Model for Floating Car Trajectory Map Matching
Map matching is the key technology in the data processing of floating car trajectory data. In order to improve the matching accuracy, this paper adopted widely followed Hidden Markov Model (HMM) approach and proposed new probabilistic models for the transition probability. The new model considers distance difference feature and average speed difference feature, which was proved to be more reasonable and accurate to describe the context relationship between adjacent candidate points by experiments. The experiments showed that our proposed algorithm can achieve a better matching accuracy compared with a comparable HMM-based method from the literature.
KeywordsFloating car Map matching Hidden Markov Model
This work is supported by the 13th Five-Year equipment pre-research project (41401010201) and the 13th Five-Year key basic research project (JCKY2016206B001).
- 1.Newson, P., Krumm, J.: Hidden Markov map matching through noise and sparseness. In: ACM Sigspatial International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, Seattle, Washington, USA Proceedings, pp. 336–343, 4–6 November 2009Google Scholar
- 2.Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., Huang, Y.: Map-matching for low-sampling-rate GPS trajectories. In: ACM Sigspatial International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, Seattle, Washington, USA Proceedings, pp. 352–361, 4–6 November 2009Google Scholar
- 3.Liu, X., Lu, F.: ST-CRF: a novel map matching approach for low-frequency floating car data. In: ACM Sigspatial International Workshop on Geostreaming, pp. 9–18. ACM (2015)Google Scholar