2020
DOI: 10.1109/tmc.2020.3043500
|View full text |Cite
|
Sign up to set email alerts
|

DeepMM: Deep Learning Based Map Matching with Data Augmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(14 citation statements)
references
References 27 publications
0
14
0
Order By: Relevance
“…To make up for the shortcomings of traditional physical sensors, Shi et al [3][4][5][6] used social networks as social sensors to optimize the briefing content in the meteorological domain and provided online services for weather monitoring platforms. Feng et al 7 completed map matching in the latent space based on deep learning and enhanced the matching with the knowledge of mobile patterns. Yan et al 8 proposed an algorithm based on stretching and shrinking distance (SSDBA) for link prediction in social networks.…”
Section: Related Workmentioning
confidence: 99%
“…To make up for the shortcomings of traditional physical sensors, Shi et al [3][4][5][6] used social networks as social sensors to optimize the briefing content in the meteorological domain and provided online services for weather monitoring platforms. Feng et al 7 completed map matching in the latent space based on deep learning and enhanced the matching with the knowledge of mobile patterns. Yan et al 8 proposed an algorithm based on stretching and shrinking distance (SSDBA) for link prediction in social networks.…”
Section: Related Workmentioning
confidence: 99%
“…Advanced algorithms use advanced techniques such as Kalman filter Jo et al (1996); Kim et al (2000), dynamic programming Zhu et al (2017) and Hidden Markov model Newson and Krumm (2009); Yang and Gidofalvi (2018); Feng et al (2020) in map-matching process. In Jo et al (1996); Kim et al (2000), they combined the geometric method with the Kalman filter to improve the matching accuracy.…”
Section: Advanced Algorithmsmentioning
confidence: 99%
“…In FMM, an upper-bounded origin-destination table is precomputed first to store all pairs of shorted paths under a specified length and then repeated routing queries are replaced with quick hash table searches. However, in Feng et al (2020), the authors point out two shortcomings in HMM based methods: they don't use historical trajectory in map-matching process and they are susceptible to noisy data.…”
Section: Advanced Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations