Hidden Markov model and driver path preference for floating car trajectory map matching

Hidden Markov model and driver path preference for floating car trajectory map matching

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Intelligent Transport Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Here, a hidden Markov model (HMM) and driver path preference (DPP)-based algorithm was proposed for floating car trajectory map matching. The algorithm focused on two improvements over existing HMM-based map matching algorithm: (i) the use of distance difference feature and average speed difference feature for transition probability calculation, which reasonably describe the context information between the two adjacent sampling points. It results in a more accurate matching capability; (ii) the DPP overcomes the shortcoming of feature attenuation in calculating the transition probability at low floating car sampling rates. It assures the matching accuracy of the algorithm at low sampling rates. The algorithm was evaluated using ground truth data and the results of the experiment show that the new transition probability significantly improves the matching capability. The proposed DPP can significantly help to maintain the matching accuracy under the condition of low sampling rates.


    1. 1)
      • 1. Yuan, J., Zheng, Y., Zhang, L., et al: ‘Where to find my next passenger’. Conf. Ubiquitous Computing, Int. Conf., UBICOMP, Beijing, China, September 2011, pp. 109118.
    2. 2)
      • 2. Tao, S., Manolopoulos, V., Rodriguez, S.: ‘Real-time urban traffic state estimation with a-GPS mobile phones as probes’, J. Transp. Technol., 2012, 02, (1), pp. 2231.
    3. 3)
      • 3. He, W., Kai, H., Li, D.: ‘Intelligent carpool routing for urban ridesharing by mining GPS trajectories’, IEEE Trans. Intell. Transp. Syst., 2014, 15, (5), pp. 22862296.
    4. 4)
      • 4. Shen, Y., Zhao, L., Fan, J.: ‘Analysis and visualization for hot spot based route recommendation using short-dated taxi GPS traces’, Information, 2015, 6, (2), pp. 134151.
    5. 5)
      • 5. Newson, P., Krumm, J.: ‘Hidden Markov map matching through noise and sparseness’. Proc. ACM Sigspatial Int. Symp. on Advances in Geographic Information Systems, Acm-Gis, Seattle, Washington, USA, November 2009, pp. 336343.
    6. 6)
      • 6. Lou, Y., Zhang, C., Zheng, Y., et al: ‘Map-matching for low-sampling-rate GPS trajectories’. Proc. ACM Sigspatial Int. Symp. on Advances in Geographic Information Systems, Acm-Gis, Seattle, Washington, USA, November 2009, pp. 352361.
    7. 7)
      • 7. Ming, R.H.A.K., Karimi, A.H.A.: ‘A hidden Markov model-based map-matching algorithm for wheelchair navigation’, J. Navig., 2009, 62, (3), pp. 383395.
    8. 8)
      • 8. Goh, C.Y., Dauwels, J., Mitrovic, N., et al: ‘Online map-matching based on hidden Markov model for real-time traffic sensing applications’. Conf. Int. IEEE Conf. on Intelligent Transportation Systems, Anchorage, AK, USA, 2012, vol. 24, pp. 776781.
    9. 9)
      • 9. Raymond, R., Morimura, T., Osogami, T., et al: ‘Map matching with hidden Markov model on a sampled road network’. Int. Conf. on Pattern Recognition, Tsukuba, Japan, 2012, pp. 22422245.
    10. 10)
      • 10. Greenfeld, J.S.: ‘Matching GPS observations to locations on a digital map’. Conf. 81th Annual Meeting of the Transportation Research Board, Washington, DC, USA, 2002, vol. 1, no. 3, pp. 164173.
    11. 11)
      • 11. Chawathe, S.S.: ‘Segment-based map matching’. Conf. Intelligent Vehicles Symp., Istanbul, Turkey, 2007.
    12. 12)
      • 12. Bang, Y., Kim, J., Yu, K.: ‘An improved map-matching technique based on the Fréchet distance approach for pedestrian navigation services’, Sensors, 2016, 16, (10), p. 1768.
    13. 13)
      • 13. Viterbi, A.J.: ‘Error bounds for convolutional codes and an asymptotically optimum decoding algorithm’, IEEE Trans. Inf. Theory, 1967, 13, (2), pp. 260269.
    14. 14)
      • 14. Diggelen, F.V.: ‘System design & test-GNSS accuracy-lies, damn lies, and statistics-this update to a seminal article first published here in 1998 explains how statistical methods can create many different’, GPS World, 2007, 18, (1), pp. 2633.
    15. 15)
      • 15. Froehlich, J., Krumm, J.: ‘Route prediction from trip observations’. SAE Technical Paper, 2008.
    16. 16)
      • 16. Yuan, J., Zheng, Y., Xie, X., et al: ‘Driving with knowledge from the physical world’. Proc. of the 17th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 2011, pp. 316324.
    17. 17)
      • 17. Gather, U., Schultze, V.: ‘Robust estimation of a scale of an exponential distribution’, Stat. Neerl., 1997, 53, (53), pp. 327341.

Related content

This is a required field
Please enter a valid email address