Optimizing Vessel Trajectory Compression
- URL: http://arxiv.org/abs/2005.05418v1
- Date: Mon, 11 May 2020 20:38:56 GMT
- Title: Optimizing Vessel Trajectory Compression
- Authors: Giannis Fikioris, Kostas Patroumpas, Alexander Artikis
- Abstract summary: 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.
We take into account the type of each vessel in order to provide a suitable configuration that can yield improved trajectory synopses.
- Score: 71.42030830910227
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 into account the type of each vessel in order
to provide a suitable configuration that can yield improved trajectory
synopses, both in terms of approximation error and compression ratio.
Furthermore, we employ a genetic algorithm converging to a suitable
configuration per vessel type. Our tests against a publicly available AIS
dataset have shown that compression efficiency is comparable or even better
than the one with default parametrization without resorting to a laborious data
inspection.
Related papers
- Automatic Outlier Rectification via Optimal Transport [7.421153752627664]
We propose a novel conceptual framework to detect outliers using optimal transport with a concave cost function.
We take the first step to utilize the optimal transport distance with a concave cost function to construct a rectification set.
Then, we select the best distribution within the rectification set to perform the estimation task.
arXiv Detail & Related papers (2024-03-21T01:30:24Z) - Compression of Structured Data with Autoencoders: Provable Benefit of
Nonlinearities and Depth [83.15263499262824]
We prove that gradient descent converges to a solution that completely disregards the sparse structure of the input.
We show how to improve upon Gaussian performance for the compression of sparse data by adding a denoising function to a shallow architecture.
We validate our findings on image datasets, such as CIFAR-10 and MNIST.
arXiv Detail & Related papers (2024-02-07T16:32:29Z) - Tuning the perplexity for and computing sampling-based t-SNE embeddings [7.85331971049706]
We show that a sampling-based embedding approach can circumvent problems with large data sets.
We show how this approach speeds up the computation and increases the quality of the embeddings.
arXiv Detail & Related papers (2023-08-29T16:24:11Z) - Semi-DETR: Semi-Supervised Object Detection with Detection Transformers [105.45018934087076]
We analyze the DETR-based framework on semi-supervised object detection (SSOD)
We present Semi-DETR, the first transformer-based end-to-end semi-supervised object detector.
Our method outperforms all state-of-the-art methods by clear margins.
arXiv Detail & Related papers (2023-07-16T16:32:14Z) - Learning Accurate Performance Predictors for Ultrafast Automated Model
Compression [86.22294249097203]
We propose an ultrafast automated model compression framework called SeerNet for flexible network deployment.
Our method achieves competitive accuracy-complexity trade-offs with significant reduction of the search cost.
arXiv Detail & Related papers (2023-04-13T10:52:49Z) - Minimizing the Accumulated Trajectory Error to Improve Dataset
Distillation [151.70234052015948]
We propose a novel approach that encourages the optimization algorithm to seek a flat trajectory.
We show that the weights trained on synthetic data are robust against the accumulated errors perturbations with the regularization towards the flat trajectory.
Our method, called Flat Trajectory Distillation (FTD), is shown to boost the performance of gradient-matching methods by up to 4.7%.
arXiv Detail & Related papers (2022-11-20T15:49:11Z) - Unbalanced CO-Optimal Transport [16.9451175221198]
CO-optimal transport (COOT) takes this comparison further by inferring an alignment between features as well.
We show that it is sensitive to outliers that are omnipresent in real-world data.
This prompts us to propose unbalanced COOT for which we provably show its robustness to noise.
arXiv Detail & Related papers (2022-05-30T08:43:19Z) - Feasible Low-thrust Trajectory Identification via a Deep Neural Network
Classifier [1.5076964620370268]
This work proposes a deep neural network (DNN) to accurately identify feasible low thrust transfer prior to the optimization process.
The DNN-classifier achieves an overall accuracy of 97.9%, which has the best performance among the tested algorithms.
arXiv Detail & Related papers (2022-02-10T11:34:37Z) - Deep Shells: Unsupervised Shape Correspondence with Optimal Transport [52.646396621449]
We propose a novel unsupervised learning approach to 3D shape correspondence.
We show that the proposed method significantly improves over the state-of-the-art on multiple datasets.
arXiv Detail & Related papers (2020-10-28T22:24:07Z) - On Compression Principle and Bayesian Optimization for Neural Networks [0.0]
We propose a compression principle that states that an optimal predictive model is the one that minimizes a total compressed message length of all data and model definition while guarantees decodability.
We show that dropout can be used for a continuous dimensionality reduction that allows to find optimal network dimensions as required by the compression principle.
arXiv Detail & Related papers (2020-06-23T03:23:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.