Directed Acyclic Graph Based Online Multi-Dimensional Trajectory Simplification Algorithm

In response to the issues of disregarding turning and speed characteristics as well as excessive compression in traditional directed acyclic graph-based trajectory simplification (DOTS)algorithm, this study proposes a directed acyclic graphs based online multi-dimensional trajectory simplification (...

Full description

Saved in:
Bibliographic Details
Published in2023 5th International Conference on Frontiers Technology of Information and Computer (ICFTIC) pp. 800 - 804
Main Authors Tan, Shizhe, Cao, Zhike, Wang, Lizhi, Gong, Runze, Tian, Lu
Format Conference Proceeding
LanguageEnglish
Published IEEE 17.11.2023
Subjects
Costs
data compression
Directed acyclic graph
Feature extraction
Heuristic algorithms
Memory
multi-dimensional trajectories
steering characteristics
Turning
US Department of Transportation
velocity characteristics
Online AccessGet full text

Cover

More Information
Summary:In response to the issues of disregarding turning and speed characteristics as well as excessive compression in traditional directed acyclic graph-based trajectory simplification (DOTS)algorithm, this study proposes a directed acyclic graphs based online multi-dimensional trajectory simplification (DOMTS)algorithm. The algorithm integrates real-time feature extraction methods and an improved DOTS algorithm. In the initial stage of trajectory processing, it dynamically identifies and labels turning and speed feature points in the trajectory, incorporating them into a comprehensive trajectory compression strategy. Subsequently, the trajectory undergoes compression using the enhanced DOTS algorithm. Experimental results unequivocally demonstrate that this algorithm effectively reduces trajectory data storage and transmission costs while maintaining a low global compression error. This lays a reliable foundation for further multi-dimensional feature-based trajectory analysis.
DOI:10.1109/ICFTIC59930.2023.10456153