skip to main content
10.1145/2525314.2525456acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Map matching: comparison of approaches using sparse and noisy data

Published:05 November 2013Publication History

ABSTRACT

The process of map matching takes a sequence of possibly noisy GPS coordinates from a vehicle trace and estimates the actual road positions---a crucial first step needed by many GPS applications. There has been a plethora of methods for map matching published, but most of them are evaluated on low-noise datasets obtained from a planned route. And comparisons with other methods are very limited. Based on our previous unifying framework used to catalog different mathematical formulas in many published methods, we evaluate representative algorithms using the low-noise dataset from the GIS Cup 2012 and a high-noise dataset collected from Shanghai downtown. Our experiments reveal that global max-weight and global geometrical map matching methods are the most accurate, but each has its weaknesses. We therefore propose a new map matching algorithm that integrates Fréchet distance with global weight optimization, which is more accurate across all sampling intervals.

References

  1. GPS Datasets. grid.sjtu.edu.cn/mapmatching/data.Google ScholarGoogle Scholar
  2. M. Ali, T. Rautman, J. Krumm, and A. Teredesai. ACM SIGSPATIAL GIS Cup 2012. In GIS, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. H. Alt and et al. Matching planar maps. Journal of Algorithms, 49(2):262--283, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geometry Appl., 5:75--91, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  5. C. A. Blazquez and A. P. Vonderohe. Simple map-matching algorithm applied to intelligent winter maintenance vehicle data. Transportation Research Record, 1935(1):68--76, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  6. S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk. On map-matching vehicle tracking data. In VLDB, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. S. Greenfeld. Matching GPS observations to locations on a digital map. In Transportation Research Board, 2002.Google ScholarGoogle Scholar
  8. T. Griffin and et al. Routing-based map matching for extracting routes from GPS trajectories. In Computing for Geospatial Research & Applications, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Y. Lou and et al. Map-matching for low-sampling-rate GPS trajectories. In SIGSPATIAL GIS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. O. Mazhelis. Using recursive Bayesian estimation for matching GPS measurements to imperfect road network data. In IEEE Conference on Intelligent Transportation Systems, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  11. P. Newson and J. Krumm. Hidden Markov map matching through noise and sparseness. In SIGSPATIAL GIS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. O. Pink and B. Hummel. A statistical approach to map matching using road network geometry, topology and vehicular motion constraints. In IEEE Conference on Intelligent Transportation Systems, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  13. M. A. Quddus and et al. A general map matching algorithm for transport telematics applications. GPS Solutions, 7(3):157--167, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  14. A. Thiagarajan and et al. Vtrack: accurate, energy-aware road traffic delay estimation using mobile phones. In SenSys, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Y. Wang and et al. Challenges and opportunities in exploiting large-scale GPS probe data. Technical Report HPL-2011-109, HP Labs, 2011.Google ScholarGoogle Scholar
  16. H. Wei, Y. Wang, G. Forman, Y. Zhu, and H. Guan. Fast Viterbi map matching with tunable weight functions. In ACM SIGSPATIAL GIS, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. E. White and et al. Some map matching algorithms for personal navigation assistants. Transportation Research Part C, 8(1-6):91--108, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  18. J. Yang and et al. The map matching algorithm of GPS data with relatively long polling time intervals. Journal of the Eastern Asia Society for Transportation Studies, 6:2561--2573, 2005.Google ScholarGoogle Scholar
  19. Y. Zheng and M. A. Quddus. Weight-based shortest path aided map-matching algorithm for low frequency GPS data. In Transportation Research Board, 2011.Google ScholarGoogle Scholar
  20. Y. Zheng and X. Zhou. Computing with Spatial Trajectories. Springer, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Map matching: comparison of approaches using sparse and noisy data

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGSPATIAL'13: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
        November 2013
        598 pages
        ISBN:9781450325219
        DOI:10.1145/2525314

        Copyright © 2013 Owner/Author

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 5 November 2013

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate220of1,116submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader