One-pass error bounded trajectory simplification
Authors:
Open Access
- 1 March 2017
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 10 (7) , 841-852
Abstract
Nowadays, various sensors are collecting, storing and transmitting tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network band and computing resource. Line simplification (LS) algorithms are an effective approach to attacking this issue by compressing data points in a trajectory to a set of continuous line segments, and are commonly used in practice. However, existing LS algorithms are not sufficient for the needs of sensors in mobile devices. In this study, we first develop a one-pass error bounded trajectory simplification algorithm (OPERB), which scans each data point in a trajectory once and only once. We then propose an aggressive one-pass error bounded trajectory simplification algorithm (OPERB-A), which allows interpolating new data points into a trajectory under certain conditions. Finally, we experimentally verify that our approaches (OPERB and OPERB-A) are both efficient and effective, using four real-life trajectory datasets.Keywords
This publication has 20 references indexed in Scilit:
- Spatio-temporal compression of trajectories in road networksGeoInformatica, 2014
- Minimum-link paths revisitedComputational Geometry, 2013
- Compression of trajectory data: a comprehensive evaluation and new approachGeoInformatica, 2013
- A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory SimplificationIEEE Transactions on Image Processing, 2012
- Clustering and aggregating clues of trajectories for mining trajectory patterns and routesThe VLDB Journal, 2011
- Semantic Trajectory Compression2009
- Spatio-temporal data reduction with deterministic error boundsThe VLDB Journal, 2006
- Performance Evaluation of Line Simplification Algorithms for Vector GeneralizationThe Cartographic Journal, 2006
- Spatiotemporal Compression Techniques for Moving Point Objects2004
- ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURECartographica, 1973