2012
DOI: 10.1007/s00453-012-9654-2
|View full text |Cite
|
Sign up to set email alerts
|

Median Trajectories

Abstract: We investigate the concept of a median among a set of trajectories. We establish criteria that a "median trajectory" should meet, and present two different methods to construct a median for a set of input trajectories. The first method is very simple, while the second method is more complicated and uses homotopy with respect to sufficiently large faces in the arrangement formed by the trajectories. We give algorithms for both methods, analyze the worst-case running time, and show that under certain assumptions… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(41 citation statements)
references
References 32 publications
0
39
0
Order By: Relevance
“…It is less suited when curved trajectories, or, more precisely, trajectories not following one major directions, are involved. In such situations, computing a median trajectory [6] is advantageous: This approach constructs the arrangement, i.e., the embedded graph, induced by the set of segments of all subtrajectories in question. It then assembles the median trajectory via traversing this graph, moving along all segments for which the same number of other segments lie on either side.…”
Section: Computation Of Representative Trajectoriesmentioning
confidence: 99%
See 1 more Smart Citation
“…It is less suited when curved trajectories, or, more precisely, trajectories not following one major directions, are involved. In such situations, computing a median trajectory [6] is advantageous: This approach constructs the arrangement, i.e., the embedded graph, induced by the set of segments of all subtrajectories in question. It then assembles the median trajectory via traversing this graph, moving along all segments for which the same number of other segments lie on either side.…”
Section: Computation Of Representative Trajectoriesmentioning
confidence: 99%
“…Hence, positioning in or around buildings often has static local biases, distorting the positioning estimate in a specific direction. By aggregating all subtrajectories that correspond to a particular segment of the (approximate or known) route network into an average [18] or median trajectory [6] we compute a representative of the estimated movement pattern along this segment; see the blue trajectory in Figure 1 (left). Using a route network (given or reconstructed) and these representative trajectories, we can determine the static biases in the positioning system at specific locations and along paths typically used; see the red areas in Figure 1 (left).…”
Section: Introductionmentioning
confidence: 99%
“…To mitigate the effects of positioning inaccuracies, we smooth the position sequence by computing the median trajectory of the given positions [4]. We then use these smoothed positions to compute the speed between each consecutive position estimates, from which we for each window compute the mean, maximum, minimum and end-to-end speed in the window, which are used as features.…”
Section: Movement Speedmentioning
confidence: 99%
“…Trajectory grouping algorithms that allow segmentation in order to discover common substructure are desecribed in [14,17,2,19]. Methods for summarizing the grouping structure are explord in [17,5,6,22]. Notably, [6] introduces the application of the Reeb graph as a way to succinctly represent trajectory data in a way that encodes the merging and splitting structure.…”
Section: Previous Workmentioning
confidence: 99%