An evaluation of compression algorithms applied to moving object trajectories |
| |
| Authors: | Yoran E Leichsenring |
| |
| Institution: | Graduate Program in Applied Computing, Department of Computer Science, Santa Catarina State University – UDESC, Joinville, Brazil https://orcid.org/0000-0001-6907-9501 |
| |
| Abstract: | ABSTRACTThe amount of spatiotemporal data collected by gadgets is rapidly growing, resulting in increasing costs to transfer, process and store it. In an attempt to minimize these costs several algorithms were proposed to reduce the trajectory size. However, to choose the right algorithm depends on a careful analysis of the application scenario. Therefore, this paper evaluates seven general purpose lossy compression algorithms in terms of structural aspects and performance characteristics, regarding four transportation modes: Bike, Bus, Car and Walk. The lossy compression algorithms evaluated are: Douglas-Peucker (DP), Opening-Window (OW), Dead-Reckoning (DR), Top-Down Time-Ratio (TS), Opening-Window Time-Ratio (OS), STTrace (ST) and SQUISH (SQ). Pareto Efficiency analysis pointed out that there is no best algorithm for all assessed characteristics, but rather DP applied less error and kept length better-preserved, OW kept speed better-preserved, ST kept acceleration better-preserved and DR spent less execution time. Another important finding is that algorithms that use metrics that do not keep time information have performed quite well even with characteristics time-dependent like speed and acceleration. Finally, it is possible to see that DR had the most suitable performance in general, being among the three best algorithms in four of the five assessed performance characteristics. |
| |
| Keywords: | Compression trajectory algorithm simplifying trajectory algorithms perpendicular distance asynchronous Euclidean distance performance assessment |
|
|
![ORCID Icon]({"type":"image","src":"/templates/jsp/images/orcid.png"} "ORCID Icon")
https://orcid.org/0000-0001-6907-9501