Optimizing Vessel Trajectory Compression

@article{Fikioris2020OptimizingVT,
  title={Optimizing Vessel Trajectory Compression},
  author={Giannis Fikioris and Kostas Patroumpas and A. Artikis},
  journal={2020 21st IEEE International Conference on Mobile Data Management (MDM)},
  year={2020},
  pages={281-286}
}
In previous work we introduced a trajectory detection module that can provide summarized representations of vessel trajectories by consuming AIS positional messages online. This methodology can provide reliable trajectory synopses with little deviations from the original course by discarding at least 70% of the raw data as redundant. However, such trajectory compression is very sensitive to parametrization. In this paper, our goal is to fine-tune the selection of these parameter values. We take… 

Figures and Tables from this paper

Optimizing vessel trajectory compression for maritime situational awareness

An open-source system that can optimize compressed trajectory representations for large fleets of vessels by employing a genetic algorithm that converges to a fine-tuned configuration per vessel type without any hyper-parameter tuning and employing a composite event recognition engine to efficiently detect complex maritime activities.

Fine-Tuned Compressed Representations of Vessel Trajectories

An extension of a system for vessel trajectory compression that allows the user to fine-tune trajectory compression according to the requirements of a given application is presented, that avoids the issues of hyper-parameter tuning, supports incremental optimization and facilitates composite maritime event recognition.

A Trajectory Ensemble-Compression Algorithm Based on Finite Element Method

This paper proposes a novel trajectory compression algorithm that is based on the finite element method, in which the trajectory is taken as an elastomer to compress as a whole by elasticity theory, and trajectory compression can be thought of as deformation under stress.

Review and classification of trajectory summarisation algorithms: From compression to segmentation

This comprehensive review explains and classify techniques for the summarisation of trajectories according to their search strategy and point evaluation criteria, describing connections with the line simplification problem and explaining several special concepts in trajectory summarisation problem.

AIS Trajectories Simplification Algorithm Considering Topographic Information

An AIS trajectory simplification algorithm considering topographic information is proposed that simplifies the trajectories without the intersection of the trajectory and obstacle using the improved Douglas–Peucker algorithm.

Composite Maritime Event Recognition

References

SHOWING 1-10 OF 19 REFERENCES

On-the-fly mobility event detection over aircraft trajectories

An application framework that consumes streaming positions from a large fleet of flying aircrafts monitored in real time over a wide geographical area and develops one-pass heuristics to eliminate inherent noise and provide reliable trajectory representations is presented.

One-Pass Error Bounded Trajectory Simplification

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.

Online event recognition from moving vessel trajectories

Extensive tests validate the performance, efficiency, and robustness of the system against scalable volumes of real-world and synthetically enlarged datasets, but its deployment against online feeds from vessels has also confirmed its capabilities for effective, real-time maritime surveillance.

Trajectory Simplification: On Minimizing the Direction-based Error

A problem called Min-Error is defined and two exact algorithms and one 2-factor approximate algorithm for the problem are developed and extensive experiments on real datasets verified the algorithms.

Trajectory Simplification: An Experimental Study and Quality Analysis

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.

Compression of trajectory data: a comprehensive evaluation and new approach

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.

Efficient real-time trajectory tracking

This work proposes a family of tracking protocols that allow trading the communication cost and the amount of trajectory data stored at a MOD off against the spatial accuracy, and presents an effective compression technique to optimize the reduction performance of real-time line simplification in general.

Sampling Trajectory Streams with Spatiotemporal Criteria

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.

Spatio-temporal data reduction with deterministic error bounds

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.