2007 IEEE Aerospace Conference 2007
DOI: 10.1109/aero.2007.353090
|View full text |Cite
|
Sign up to set email alerts
|

Trajectory Comparison for Civil Aircraft

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…Trajectory data of simultaneously moving objects is the key to analyse animal migration (Lee et al 2008), transportation (Baud et al 2007;Giannotti et al 2007), tactics in team sports (Hirano and Tsumoto 2005;Kempe et al 2014;Lucey et al 2013;Wei et al 2013), players and Editor: Tijl De Bie. avatars in (serious) computer games (Kang et al 2013;Pao et al 2010), customer behaviour (Larson et al 2005) as well as spread patterns of fires (Trunfio et al 2011). A characteristic trait of many such applications is that trajectories of several objects are more informative than the trajectory of a single object.…”
Section: Introductionmentioning
confidence: 99%
“…Trajectory data of simultaneously moving objects is the key to analyse animal migration (Lee et al 2008), transportation (Baud et al 2007;Giannotti et al 2007), tactics in team sports (Hirano and Tsumoto 2005;Kempe et al 2014;Lucey et al 2013;Wei et al 2013), players and Editor: Tijl De Bie. avatars in (serious) computer games (Kang et al 2013;Pao et al 2010), customer behaviour (Larson et al 2005) as well as spread patterns of fires (Trunfio et al 2011). A characteristic trait of many such applications is that trajectories of several objects are more informative than the trajectory of a single object.…”
Section: Introductionmentioning
confidence: 99%
“…Trajectory comparison distance[3] ( D ): we consider a trajectory as a sequence of positions over time, and define the fixation trajectory F ={(x 1 , y 1 ),(x 2 , y 2 ),…,(x n , y n )}, x i and y i are the coordinates of fixation i (i=1,2,…n); and the recalled point trajectoryR ={(a 1 , b 1 ),(a 2 , b 2 ),…,(a m , b m )}, a j and b j are the coordinates of recalled point j (j=1,2,…m). For each time step t (t=1, 2… k and k= minimum (n, m)), the distance between fixation and its recalled point positions is given fixation point a recalled point represents, so we assume it is the nearest one.…”
mentioning
confidence: 99%