Review Article
An Overview of Moving Object Trajectory Compression Algorithms
Table 1
Summary of trajectory compression algorithms (
is the size of trajectories).
| Algorithm | Computational complexity | Batch or online | Error criteria |
| Uniform sampling algorithm | ) | Batch/online | Target compression ratio () |
| Bellman algorithm | ) | Batch | Target compression ratio () |
| Douglas-Peucker algorithm | ) | Batch | Spatial distance () |
| Opening Window algorithm | | Online | Spatial distance () |
| Top-down time-ratio algorithm | ) | Batch | SED distance () |
| Top-down speed-based algorithm | | Batch/online | Speed difference () |
| Opening Window Time-Ratio algorithm | | Online | SED distance () |
| Dead Reckoning | | Online | SED distance (), velocity (v) |
| Semantic trajectory compression | | Batch | Spatial distance (ε) |
| Paralleled road-network-based trajectory compression | | Batch | TSND, NSTD |
| Similarity based compression of GPS trajectory data | | Batch | Similarity () |
| Spatial QUalIty Simplification Heuristic algorithm | | Batch/online | SED distance () |
| Spatial QUalIty Simplification Heuristic-Extended algorithm | | Batch/online | SED distance (), compression ratio () |
|
|