Dynamics-aware similarity of moving objects trajectories
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Utilizing Wireless Positioning as a Tracking Data Source
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Map-matching for low-sampling-rate GPS trajectories
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
On map matching of wireless positioning data: a selective look-ahead approach
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Probabilistic range queries for uncertain trajectories on road networks
Proceedings of the 14th International Conference on Extending Database Technology
Go with the flow: the direction-based fréchet distance of polygonal curves
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Finding the most accessible locations: reverse path nearest neighbor query in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
EnAcq: energy-efficient GPS trajectory data acquisition based on improved map matching
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Jaywalking your dog: computing the Fréchet distance with shortcuts
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
PNN query processing on compressed trajectories
Geoinformatica
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Event processing and real-time monitoring over streaming traffic data
W2GIS'12 Proceedings of the 11th international conference on Web and Wireless Geographical Information Systems
User oriented trajectory search for trip recommendation
Proceedings of the 15th International Conference on Extending Database Technology
How to walk your dog in the mountains with no magic leash
Proceedings of the twenty-eighth annual symposium on Computational geometry
Locally correct fréchet matchings
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Computational Geometry: Theory and Applications
Finding traffic-aware fastest paths in spatial networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
The fréchet distance revisited and extended
ACM Transactions on Algorithms (TALG)
Towards a Flexible and Scalable Fleet Management Service
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
| Hi-index | 0.00 |
With vehicle tracking data becoming an important sensor data resource for a range of applications related to traffic assessment and prediction, fast and accurate mapmatching algorithms become a necessary means to ultimately utilize this data. This work proposes a fast mapmatching algorithm which exploits tracking data error estimates in a provably correct way and offers a quality guarantee for the computed result trajectory. A new model for the map-matching task is introduced which takes tracking error estimates into account. The proposed Adaptive Clipping algorithm (i) provably solves this map-matching task and (ii) utilizes the weak Fréchet distance to measure similarity between curves. The algorithm uses the error estimates in the trajectory data to reduce the search space (error-aware pruning), while offering the quality guarantee of finding a curve which minimizes the weak Fréchet distance to the vehicle trajectory among all possible curves in the road network. Moreover, this work introduces an outputsensitive variant of an existing weak Fréchet map-matching algorithm, which is also employed in the Adaptive Clipping algorithm. Output-sensitiveness paired with error-aware pruning makes Adaptive Clipping the first map-matching algorithm that provably solves a well-defined map-matching task. An experimental evaluation establishes further that Adaptive Clipping is also in a practical setting a fast algorithm that at the same time produces high-quality matching results.