Published in

VLDB Endowment, Proceedings of the VLDB Endowment, 7(10), p. 841-852, 2017

DOI: 10.14778/3067421.3067432

Links

Tools

Export citation

Search in Google Scholar

One-Pass Error Bounded Trajectory Simplification

Journal article published in 2017 by Xuelian Lin, Shuai Ma, Han Zhang, Tianyu Wo, Jinpeng Huai
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Green circle
Published version: archiving allowed
Data provided by SHERPA/RoMEO

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. ; Comment: published at the 43rd International Conference on Very Large Data Bases (VLDB), Munich, Germany, 2017