Probabilistic map matching of sparse and noisy smartphone location data
There is an immense amount of location data being collected today from smartphone users by various service providers. Due to bandwidth and battery-life considerations, smartphone locations are generally sampled at sparse intervals using energy-efficient, but inaccurate, alternatives to the power-hun...
Saved in:
Main Authors: | Jagadeesh, George Rosario, Srikanthan, Thambipillai |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145769 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Online map-matching of noisy and sparse location data with hidden Markov and route choice models
by: Jagadeesh, George Rosario, et al.
Published: (2020) -
Heuristic optimizations for high-speed low-latency online map matching with probabilistic sequence models
by: Jagadeesh, George Rosario, et al.
Published: (2021) -
Robust real-time route inference from sparse vehicle position data
by: Jagadeesh, George Rosario, et al.
Published: (2015) -
Fast computation of clustered many-to-many shortest paths and its application to map matching
by: Jagadeesh, George Rosario, et al.
Published: (2020) -
Collusion set detection using a quasi hidden Markov model
by: Wu, Z., et al.
Published: (2014)