Group diagrams for representing trajectories

被引:11
作者
Buchin, Maike [1 ]
Kilgus, Bernhard [1 ,4 ]
Koelzsch, Andrea [2 ,3 ]
机构
[1] Ruhr Univ Bochum, Dept Math, Bochum, Germany
[2] Max Planck Inst Ornithol, Radolfzell am Bodensee, Germany
[3] Univ Konstanz, Dept Biol, Constance, Germany
[4] Max Planck Inst Anim Behav, Dept Migrat, Radolfzell am Bodensee, Germany
关键词
Movement analysis; trajectory analysis; computational geometry; Frechet distance; equal-time distance; PATTERNS;
D O I
10.1080/13658816.2019.1684498
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Given the trajectories of one or several moving groups, we propose a new framework, the group diagram (GD) for representing these. Specifically, we seek a minimal GD as a concise representation of the groups maintaining the spatio-temporal structure of the groups' movement. A GD is specified by three input values, namely a distance threshold, a similarity measure and a minimality criterion. For several variants of the GD, we give a comprehensive analysis of their computational complexity and present efficient approximation algorithms for their computation. Furthermore, we experimentally evaluate our algorithms on GPS data of migrating geese. Applying the proposed methods on these data sets reveals how the GD concisely represents the movement of the groups. This representation can be used for further analysis and for the formulation of new hypotheses for further ecological research, such as differences in movement patterns of groups on different surfaces or the shift of migration routes over several years. We use different similarity measures to summarize the migration routes of (i) a goose family for one migration period and to summarize (ii) the migration routes of one individual for several migration periods or (iii) the migration routes of several independent individuals for one migration period.
引用
收藏
页码:2401 / 2433
页数:33
相关论文
共 25 条
[1]  
Ahmed M., 2015, MAP CONSTRUCTION ALG
[2]  
Ahn Hee-Kap, 2016, LATIN 2016: Theoretical Informatics. 12th Latin American Symposium. Proceedings: LNCS 9644, P14, DOI 10.1007/978-3-662-49529-2_2
[3]   COMPUTING THE FRECHET DISTANCE BETWEEN 2 POLYGONAL CURVES [J].
ALT, H ;
GODAU, M .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (1-2) :75-91
[4]  
Baltzer O, 2008, LECT NOTES COMPUT SC, V5181, P340, DOI 10.1007/978-3-540-85654-2_32
[5]   Reporting flock patterns [J].
Benkert, Marc ;
Gudmundsson, Joachim ;
Huebner, Florian ;
Wolle, Thomas .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 41 (03) :111-125
[6]   Compact Flow Diagrams for State Sequences [J].
Buchin, Kevin ;
Buchin, Maike ;
Gudmundsson, Joachim ;
Horton, Michael ;
Sijben, Stef .
EXPERIMENTAL ALGORITHMS, SEA 2016, 2016, 9685 :89-104
[7]  
Buchin K, 2015, J COMPUT GEOM, V6, P75
[8]   DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES [J].
Buchin, Kevin ;
Buchin, Maike ;
Gudmundsson, Joachim ;
Loeffler, Maarten ;
Luo, Jun .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (03) :253-282
[9]  
Buchin K, 2010, LECT NOTES COMPUT SC, V6346, P463, DOI 10.1007/978-3-642-15775-2_40
[10]   Group Diagrams for Representing Trajectories [J].
Buchin, Maike ;
Kilgus, Bernhard ;
Koelzsch, Andrea .
PROCEEDINGS OF THE 11TH ACM SIGSPATIAL INTERNATIONAL WORKSHOP ON COMPUTATIONAL TRANSPORTATION SCIENCE (IWCTS 2018), 2018, :1-10