Title :
Efficient Online Algorithms for the Polygonal Approximation of Trajectory Data
Author :
Kolesnikov, Alexander
Author_Institution :
Sch. of Comput., Univ. of Eastern Finland, Joensuu, Finland
Abstract :
The paper deals with the problem of how most efficiently to represent trajectory data with a piecewise -- constant velocity model of the object movement. Firstly, we experimented with fast and efficient offline algorithms based on heuristic and optimal algorithms for the approximation of planar and spatial curves for a given constraint on the maximum of the approximation error. Secondly, we developed efficient online algorithm for the approximation of trajectories adaptive to the size of buffer. The online algorithm can be successfully used to reduce spatiotemporal data and multidimensional signals.
Keywords :
Internet; approximation theory; data analysis; dynamic programming; multidimensional signal processing; piecewise constant techniques; set theory; heuristic algorithm; multidimensional signal; object movement; offline algorithm; online algorithm; optimal algorithm; piecewise constant velocity model; planar curve approximation; polygonal approximation error; spatial curve approximation; spatiotemporal data; trajectory approximation; trajectory data; Approximation algorithms; Approximation error; Complexity theory; Heuristic algorithms; Spatiotemporal phenomena; Trajectory; Dynamic Programming; polygonal approximation; spatiotemporal data; trajectory;
Conference_Titel :
Mobile Data Management (MDM), 2011 12th IEEE International Conference on
Conference_Location :
Lulea
Print_ISBN :
978-1-4577-0581-6
Electronic_ISBN :
978-0-7695-4436-6
DOI :
10.1109/MDM.2011.53
