电讯技术2017，Vol.57Issue(10)：1165-1170,6.DOI:10.3969/j.issn.1001-893x.2017.10.011
基于最长公共子序列的非同步相似轨迹判断
Computing Similar Measure between Two Asynchronous Trajectories Based on Longest Common Subsequence Method
刘宇 1王前东1
作者信息
- 1. 中国西南电子技术研究所,成都610036
- 折叠
摘要
Abstract
For the problem of judging the asynchronous similar trajectory,a new algorithm for computing the similar trajectories is proposed based on the Longest Common Subsequence ( LCS) method. Firstly,the line segment distances,which are between line segments of the query trajectory and the line segments of the candidate trajectory,are computed by the line segment distance. Secondly,the length of the longest com-mon sub-trajectory,which is between the query trajectory and the candidate trajectory,is computed by the LCS method. Finally,the similarity measure between two trajectories is computed and the similar trajectory is got. Simulation shows the new method can improve the similarity measure between two asynchronous trajectories.关键词
侦察监视/最长公共子序列/非同步相似轨迹/最长公共子轨迹Key words
reconnaissance and surveillance/longest common subsequence/asynchronous similar trajecto-ry/longest common sub-trajectory分类
信息技术与安全科学引用本文复制引用
刘宇,王前东..基于最长公共子序列的非同步相似轨迹判断[J].电讯技术,2017,57(10):1165-1170,6.
