Map Matching Based on Conditional Random Fields and Route Preference Mining for Uncertain Trajectories

20Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In order to improve offline map matching accuracy of uncertain GPS trajectories, a map matching algorithm based on conditional random fields (CRF) and route preference mining is proposed. In this algorithm, road offset distance and the temporal-spatial relationship between the sampling points are used as features of GPS trajectory in a CRF model, which integrates the temporal-spatial context information flexibly. The driver route preference is also used to bolster the temporal-spatial context when a low GPS sampling rate impairs the resolving power of temporal-spatial context in CRF, allowing the map matching accuracy of uncertain GPS trajectories to get improved significantly. The experimental results show that our proposed algorithm is more accurate than existing methods, especially in the case of a low-sampling-rate.

Cite

CITATION STYLE

APA

Xu, M., Du, Y., Wu, J., & Zhou, Y. (2015). Map Matching Based on Conditional Random Fields and Route Preference Mining for Uncertain Trajectories. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/717095

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free