2021
DOI: 10.1007/s10707-021-00434-1
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating the effect of compressing algorithms for trajectory similarity and classification problems

Abstract: During the last few years the volumes of the data that synthesize trajectories have expanded to unparalleled quantities. This growth is challenging traditional trajectory analysis approaches and solutions are sought in other domains. In this work, we focus on data compression techniques with the intention to minimize the size of trajectory data, while, at the same time, minimizing the impact on the trajectory analysis methods. To this extent, we evaluate five lossy compression algorithms: Douglas-Peucker (DP),… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 42 publications
0
6
0
Order By: Relevance
“…Many of these datasets have already being used in [6] and [44] for comparing several classification methods. A detailed description of the trajectory datasets is presented below.…”
Section: Datasetmentioning
confidence: 99%
“…Many of these datasets have already being used in [6] and [44] for comparing several classification methods. A detailed description of the trajectory datasets is presented below.…”
Section: Datasetmentioning
confidence: 99%
“…The turning point is obviously very important for determining trajectory ( Makris et al, 2021b ; Sousa, Boukerche & Loureiro, 2021 ; Zhan et al, 2014 ). Because trajectory data compression is based on the premise that trajectory shape does not change, turning points should be preserved during compression ( Chen & Chen, 2021 ; Zhou, Qu & Toivonen, 2017 ; Fu & Lee, 2020 ).…”
Section: Introductionmentioning
confidence: 99%
“…The existing methods of trajectory data compression can be divided into three categories [8][9][10][11]. The first is a trajectory data compression based on line segment simplification [12][13][14][15][16][17]; the trajectory in free space is segmented linearly by constraints, and only two end points of each approximate segment are stored to achieve compression.…”
Section: Introductionmentioning
confidence: 99%