A Robust Trajectory Similarity Measure Method for Classical Trajectory

被引：0
|
作者：
Wang Q. [1 ]
机构：
[1] No.10 Research Institute of China Electronics Technology Group Corporation, Chengdu
来源：
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | 2020年 / 42卷 / 08期
关键词：
Classical trajectory; Great difference trajectory; Multi-to-one Longest Common Subsequence(m-1LCS); Robust computation; Trajectory similarity measurement;
D O I：
10.11999/JEIT24_190550
中图分类号：
学科分类号：
摘要：
In view of the great difference between classical trajectory and real-time trajectory, a robust trajectory similarity measurement method is proposed based on the longest common subsequence theory. Firstly, the distance between point and line segment is used to judge whether the point of classical trajectory is consistent with the line segment of real-time trajectory. Secondly, the longest common subsequence length between classical trajectory and real-time trajectory is calculated by using the improved multi-to-one longest common subsequence algorithm. Finally, the ratio of the longest common subsequence length to the number of points of the classical trajectory is taken as the similarity between the classical trajectory and the real-time trajectory. Experiments show that the algorithm is robust and can effectively solve the problem of similarity measurement between the classical trajectories and real-time trajectories.
引用
收藏
页码：1999 / 2005
页数：6
相关论文
共 16 条
  • [1] ANDRIENKO G, ANDRIENKO N, FUCHS G, Et al., Clustering trajectories by relevant parts for air traffic analysis, IEEE Transactions on Visualization and Computer Graphics, 24, 1, pp. 34-44, (2018)
  • [2] MAO Jiali, JIN Cheqing, ZHANG Zhigang, Et al., Anomaly detection for trajectory big data: Advancements and framework, Journal of Software, 28, 1, pp. 17-34, (2017)
  • [3] LI Baozhu, ZHANG Lin, DONG Yunlong, Et al., Anti-bias track association algorithm of radar and electronic support measurements based on track vectors hierarchical clustering, Journal of Electronics&Information Technology, 41, 6, pp. 1310-1316, (2019)
  • [4] CHEN Hongchang, XU Qian, HUANG Ruiyang, Et al., User identification across social networks based on user trajectory, Journal of Electronics&Information Technology, 40, 11, pp. 2758-2764, (2018)
  • [5] AGRAWAL R, FALOUTSOS C, SWAMI A., Efficient similarity search in sequence databases, The 4th International Conference on Foundations of Data Organization and Algorithms, pp. 69-84, (1993)
  • [6] KEOGH E, RATANAMAHATANA C A., Exact indexing of dynamic time warping, Knowledge and Information Systems, 7, 3, pp. 358-386, (2005)
  • [7] GUO Ning, MA Mengyu, XIONG Wei, Et al., An efficient query algorithm for trajectory similarity based on Fréchet distance threshold, ISPRS International Journal of Geo-Information, 6, 11, (2017)
  • [8] WEI Longxiang, HE Xiaohai, TENG Qizhi, Et al., Trajectory classification based on Hausdorff distance and longest common subsequence, Journal of Electronics&Information Technology, 35, 4, pp. 784-790, (2013)
  • [9] ZHU Jin, HU Bin, SHAO Hua, Trajectory similarity measure based on multiple movement features, Geomatics and Information Science of Wuhan University, 42, 12, pp. 1703-1710, (2017)
  • [10] VLACHOS M, KOLLIOS G, GUNOPULOS D., Discovering similar multidimensional trajectories, The 18th International Conference on Data Engineering, pp. 673-684, (2002)
12