The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Hidden Markov map matching through noise and sparseness
Abstract
The problem of matching measured latitude/longitude points to roads is becoming increasingly important. This paper describes a novel, principled map matching algorithm that uses a Hidden Markov Model (HMM) to find the most likely road route represented by a time-stamped sequence of latitude/longitude pairs. The HMM elegantly accounts for measurement noise and the layout of the road network. We test our algorithm on ground truth data collected from a GPS receiver in a vehicle. Our test shows how the algorithm breaks down as the sampling rate of the GPS is reduced. We also test the effect of increasing amounts of additional measurement noise in order to assess how well our algorithm could deal with the inaccuracies of other location measurement systems, such as those based on WiFi and cell tower multilateration. We provide our GPS data and road network representation as a standard test set for other researchers to use in their map matching work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
IEEE Transactions on Industrial Electronics
(2016) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2593650 · Cited by 1,240
On map-matching vehicle tracking data
Brakatsoulas, S., Pfoser, D., Salas, R. Z., & Wenk, C. (2005) · Cited by 534
Inferring High-Level Behavior from Low-Level Sensors
Patterson, D. J., Liao, L., Fox, D., & Kautz, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39653-6_6 · Cited by 517
MATCHING GPS OBSERVATIONS TO LOCATIONS ON A DIGITAL MAP
Greenfeld, J. (2002) · Cited by 408
Adaptive fuzzy-network-based C-measure map-matching algorithm for car navigation system
Kim, S., & Kim, J.-H. (2001) · IEEE Transactions on Industrial Electronics · doi:10.1109/41.915423 · Cited by 118
Cited by
Semantic trajectories modeling and analysis
Parent, C., Spaccapietra, S., Renso, C., Andrienko, G., Andrienko, N., Bogorny, V., Damiani, M. L., Gkoulalas-Divanis, A., Macedo, J., Pelekis, N., et al. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501656 · Cited by 564
A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation
Yuan, H., & Li, G. (2021) · Data Science and Engineering · doi:10.1007/s41019-020-00151-z · Cited by 389
A graph CNN-LSTM neural network for short and long-term traffic forecasting based on trajectory data
Bogaerts, T., Masegosa, A. D., Angarita-Zapata, J. S., Onieva, E., & Hellinckx, P. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2020.01.010 · Cited by 373
An Interactive-Voting Based Map Matching Algorithm
Yuan, J., Zheng, Y., Zhang, C., Xie, X., & Sun, G.-Z. (2010) · 2010 Eleventh International Conference on Mobile Data Management · doi:10.1109/mdm.2010.14 · Cited by 318
Urban flow prediction from spatiotemporal data using machine learning: A survey
Xie, P., Li, T., Liu, J., Du, S., Yang, X., & Zhang, J. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.01.002 · Cited by 300
Metadata
- Authors
- Newson, P., & Krumm, J.
- Venue
- Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
- Publisher
- ACM
- Published
- 2009-11-04
- Pages
- 336-343
- OpenAlex
- W2135822894
- Cited by
- 1,019
- References
- 5
- FWCI
- 13.00
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.