Bounded Quadrant System: Error-bounded trajectory compression on the go

@article{Liu2015BoundedQS,
  title={Bounded Quadrant System: Error-bounded trajectory compression on the go},
  author={Jiajun Liu and Kun Zhao and Philipp Sommer and Shuo Shang and Branislav Kusy and Raja Jurdak},
  journal={2015 IEEE 31st International Conference on Data Engineering},
  year={2015},
  pages={987-998}
}
  • Jiajun Liu, Kun Zhao, +3 authors R. Jurdak
  • Published 30 November 2014
  • Computer Science
  • 2015 IEEE 31st International Conference on Data Engineering
Long-term location tracking, where trajectory compression is commonly used, has gained high interest for many applications in transport, ecology, and wearable computing. However, state-of-the-art compression methods involve high space-time complexity or achieve unsatisfactory compression rate, leading to rapid exhaustion of memory, computation, storage and energy resources. We propose a novel online algorithm for error-bounded trajectory compression called the Bounded Quadrant System (BQS… 
Error Bounded Line Simplification Algorithms for Trajectory Compression: An Experimental Evaluation
TLDR
This study provides a full picture of error bounded line simplification algorithms, which leads to guidelines on how to choose appropriate algorithms and distance metrics for practical applications.
Error Bounded Line Simplification Algorithms for Trajectory Compression: An Experimental Evaluation
Nowadays, various sensors are collecting, storing and transmitting tremendous trajectory data, and it is wellknown that the storage, network bandwidth and computing resources could be heavily wasted
An Online Approach for Direction-Based Trajectory Compression with Error Bound Guarantee
TLDR
This paper investigates two approaches extended from Douglas-Peucker and Greedy Deviation algorithms respectively, and proposes a faster approximate algorithm with error bound guarantee named Angular-Deviation, which can achieve low running time to suit the most constrained computation environments.
One-Pass Error Bounded Trajectory Simplification
TLDR
This study develops a one-pass error bounded trajectory simplification algorithm (OPERB), which scans each data point in a trajectory once and only once, and proposes an aggressive one- pass error bounded trajectories simplifying algorithm (operB-A), which allows interpolating new data points into a trajectory under certain conditions.
DAVT: An Error-Bounded Vehicle Trajectory Data Representation and Compression Framework
TLDR
This work brings the idea of mobile edge computing and transfer the computation-intensive data compression task to the mobile devices of drivers and proposes an error-bounded trajectory data representation, and a compression framework that can lower data communication and storage costs simultaneously.
A Novel Framework for Online Amnesic Trajectory Compression in Resource-Constrained Environments
TLDR
This work demonstrates the effectiveness of the standalone BQS algorithms in significantly reducing the time and space complexity of trajectory compression, while greatly improving the compression rates of the state-of-the-art algorithms.
An Efficient Online Approach for Direction-Preserving Trajectory Simplification with Interval Bounds
TLDR
A new trajectory simplification problem is studied which is direction-preserving and works in an online fashion and an efficient simplification algorithm is proposed, which is guaranteed to be error-bounded and achieves O(n) time and O(1) space complexity.
Trajectory Simplification: An Experimental Study and Quality Analysis
TLDR
A thorough comparison to cover all the state-of-the-art algorithms and evaluate their quality using datasets in diversified motion patterns is conducted, which presents useful guidance for the selection or development of effective trajectory simplification algorithms.
VTracer: When Online Vehicle Trajectory Compression Meets Mobile Edge Computing
TLDR
Experimental results demonstrate that the implemented inline-formula achieves the excellent performance in terms of matching accuracy, compression ratio, and it also costs the acceptable memory, energy, and app size.
REST: A Reference-based Framework for Spatio-temporal Trajectory Compression
TLDR
A novel framework for compressing trajectory data, REST (Reference-based Spatio-temporal trajectory compression), by which a raw trajectory is represented by concatenation of a series of historical (sub-)trajectories (called reference trajectories) that form the compressed trajectory within a given spatio-tem temporal deviation threshold.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Compression of trajectory data: a comprehensive evaluation and new approach
TLDR
A new compression method called SQUISH-E (Spatial QUalIty Simplification Heuristic - Extended) that provides improved run-time performance and usability and is carried out through an empirical study across three types of real-world datasets and a variety of error metrics.
SQUISH: an online approach for GPS trajectory compression
TLDR
The Spatial QUalIty Simplification Heuristic (SQUISH) method is described, which demonstrates improved performance when compressing up to roughly 10% of the original data size, and preserves speed information at a much higher accuracy under aggressive compression.
Spatio-temporal data reduction with deterministic error bounds
TLDR
This work proposes an aging mechanism which gradually shrinks the size of the trajectories as time progresses, and proposes to adopt existing linguistic constructs to manage the uncertainty introduced by the trajectory approximation.
A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification
TLDR
This work presents a fast polygonal approximation algorithm in 2-D space for the GPS trajectory simplification under the so-called integral square synchronous distance error criterion in a linear time complexity and achieves a better approximation result than the existing competitive methods.
On-line data reduction and the quality of history in moving objects databases
TLDR
A first step towards analyzing the quality of the history in making in MOD is taken by correlating the (impact of the) agreement between the server and the moving objects for on-line updates in real time with the error bounds of the data that becomes a representation of the past trajectories as time evolves.
Sampling Trajectory Streams with Spatiotemporal Criteria
TLDR
This paper proposes two single-pass approximation techniques based on sampling that take advantage of the spatial locality and temporal timeliness inherent in trajectory streams and utilizes heuristic prediction to distinguish which locations to preserve in the compressed trajectories.
Direction-Preserving Trajectory Simplification
TLDR
This paper presents a polynomial-time algorithm for optimal direction-preserving trajectory simplification, and another approximate algorithm with a quality guarantee, and extensive experimental evaluation with real trajectory data shows the benefit of the new techniques.
EnTracked: energy-efficient robust position tracking for mobile devices
TLDR
This work proposes EnTracked - a system that, based on the estimation and prediction of system conditions and mobility, schedules position updates to both minimize energy consumption and optimize robustness and provides evidence that the system can lower the energy consumption considerably and remain robust when faced with changing system conditions.
Energy-efficient localization: GPS duty cycling with radio ranging
TLDR
This article addresses the trade-off between energy consumption and localization performance in a mobile sensor network application by augmenting GPS location with more energy-efficient location sensors to bound position estimate uncertainty while GPS is off.
Camazotz: Multimodal activity-based GPS sampling
  • R. Jurdak, P. Sommer, +4 authors D. Westcott
  • Computer Science
    2013 ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)
  • 2013
TLDR
The results show that multimodal activity-based localisation reduces the power consumption over periodic GPS and single sensor-triggered GPS by up to 77% and 14% respectively, and provides a richer event type dissociation for fine-grained control of GPS sampling.
...
1
2
3
...