A Study of Trajectory Compression Algorithms for Moving Objects
| Autor: | Yao-Cheng Wu, 巫曜程 |
|---|---|
| Rok vydání: | 2018 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 106 With the increase of devices with GPS records, such as smart phones, smart watches, the problems of storage, transmission and analysis become more and more important. Since compression algorithm is an effective way to preserve useful trajectory points and remove unnecessary points, it has become a significant issue to explore. In the compression trajectory problem, the error rate and the compression rate that can be computed by the original trajectory and the compressed trajectory are used to evaluate the performance of the compression algorithm. In this paper, we propose a compression trajectory method called TP, which improves the original SQUISH-E algorithm by using three stages to filter the original trajectory. The first stage uses a bigger sliding window to remain more points than the number that indicated by the target compression rate. In the second stage, the filtered points after the first stage are used to calculate the values μ and find out the promising turning points. For the computation in this stage, we propose the value ϕ to accelerate the process of calculation. In the third stage, there are two options, the values ϕ and SED values, according to the analysis of different goals. Finally, the trajectory compression algorithm proposed in this article, under the high compression ratio, not only saves a lot of storages and transmission costs, but also provides relative information trajectory in response to more comprehensive analysis and application which enable the process of trajectory mining more quickly and clearly. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|