Research Article
Fast Map-Matching Based on Hidden Markov Model
@INPROCEEDINGS{10.1007/978-3-030-28468-8_7, author={Shenglong Yan and Juan Yu and Houpan Zhou}, title={Fast Map-Matching Based on Hidden Markov Model}, proceedings={Mobile Computing, Applications, and Services. 10th EAI International Conference, MobiCASE 2019, Hangzhou, China, June 14--15, 2019, Proceedings}, proceedings_a={MOBICASE}, year={2019}, month={9}, keywords={Map matching Efficiency Trajectory compression Key points}, doi={10.1007/978-3-030-28468-8_7} }- Shenglong Yan
Juan Yu
Houpan Zhou
Year: 2019
Fast Map-Matching Based on Hidden Markov Model
MOBICASE
Springer
DOI: 10.1007/978-3-030-28468-8_7
Abstract
Map matching is the processing of recognizing the true driving route in the road network according to discrete GPS sampling datas. It is a necessary processing step for many relevant applications such as GPS trajectory data analysis and position analysis. The current map-matching algorithms based on HMM (Hidden Markov model) focus only on the accuracy of the matching rather than efficiency. In this paper, we propose a original method: Instead of focusing on a point-by-point, we consider the trajectory compression method to find the key points in the discrete trajectory, and then search for optimal path through the key points. The experiments are implemented on two sets of real dataset and display that our method significantly improve the efficiency compared with HMM algorithm, while keeping matching accuracy.