出版社：Defence Scientific Information & Documentation Centre
摘要：This paper discusses the problem of estimating a ballistic trajectory and the launch point by using a trajectory similarity search in a database. The major difficulty of this problem is that estimation accuracy is guaranteed only when an identical trajectory exists in the trajectory database (TD). Hence, the TD must comprise an impractically great number of trajectories from various launch points. Authors proposed a simplified trajectory database with a single launch point and a trajectory similarity search algorithm that decomposes trajectory similarity into velocity and position components. These similarities are applied k-NN estimation. Furthermore, they used the iDistance technique to partition the data space of the high-dimensional database for an efficient k-NN search. Authors proved the effectiveness of the proposed algorithm by experiment. Defence Science Journal, Vol. 64, No. 1, January 2014, DOI:10.14429/dsj.64.2952
关键词：k-NN search, iDistance, trajectory similarity search, launch point estimation
