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 条

[11] LIU Yu, WANG Qiandong, Computing similar measure between two asynchronous trajectories based on longest common subsequence method, Telecommunication Engineering, 57, 10, pp. 1165-1170, (2017)
[12] WAGNER R A, FISCHER M J., The string-to-string correction problem, Journal of the ACM, 21, 1, pp. 168-173, (1974)
[13] CHOONG M Y, ANGELINE L, CHIN R K Y, Et al., Modeling of vehicle trajectory clustering based on LCSS for traffic pattern extraction, The 2nd IEEE International Conference on Automatic Control and Intelligent Systems, pp. 74-79, (2017)
[14] WANG Qiandong, A matching path constrained longest common subsequence length algorithm, Journal of Electronics&Information Technology, 39, 11, pp. 2615-2619, (2017)
[15] WANG Haoxin, ZHONG Jingdong, ZHANG Defu, A duplicate code checking algorithm for the programming experiment, The 2nd International Conference on Mathematics and Computers in Sciences and in Industry, pp. 39-42, (2015)
[16] YUAN Guan, SUN Penghui, ZHAO Jie, Et al., A review of moving object trajectory clustering algorithms, Artificial Intelligence Review, 47, 1, pp. 123-144, (2017)

← 1 2 →