Segmenting trajectories: A framework and algorithms using spatiotemporal criteria
Visualitza/Obre
Cita com:
hdl:2117/14589
Tipus de documentArticle
Data publicació2011
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
In this paper we address the problem of segmenting a trajectory based on spatiotemporal
criteria. We require that each segment is homogeneous in the sense that a set
of spatiotemporal criteria are fulfilled. We define different such criteria, including location,
heading, speed, velocity, curvature, sinuosity, curviness, and shape. We present an algorithmic
framework that allows us to segment any trajectory into a minimum number of
segments under any of these criteria, or any combination of these criteria. In this framework,
a segmentation can generally be computed in O(n log n) time, where n is the number
of edges of the trajectory to be segmented. We also discuss the robustness of our approach.
CitacióBuchin, M. [et al.]. Segmenting trajectories: A framework and algorithms using spatiotemporal criteria. "Journal of Spatial Information Science", 2011, vol. 3, p. 33-63.
ISSN1948-660X
Versió de l'editorhttp://www.josis.org/index.php/josis/article/viewFile/66/61
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
A9R100.tmp.pdf | 582,7Kb | Visualitza/Obre |