基于最长公共子序列的非同步相似轨迹判断

针对非同步相似轨迹判断问题,提出了一种基于最长公共子序列理论的相似轨迹判断新算法。首先,求出查询轨迹线段与候选轨迹线段之间的距离;其次,利用最长公共子序列算法,计算两轨迹的最长公共子轨迹长度;最后,根据相似度门限,判断轨迹是否相似。数值实例验证了所提算法能够提高非同步轨迹的相似度。...

Full description

Saved in:
Bibliographic Details
Published in电讯技术 Vol. 57; no. 10; pp. 1165 - 1170
Main Author 刘宇 王前东
Format Journal Article
LanguageChinese
Published 中国西南电子技术研究所,成都,610036 2017
Subjects
侦察监视
最长公共子序列
最长公共子轨迹
非同步相似轨迹
非同步相似轨迹
侦察监视
longest common subsequence
最长公共子序列
asynchronous similar trajecto-ry
longest common sub-trajectory
最长公共子轨迹
reconnaissance and surveillance
Online AccessGet full text
ISSN1001-893X
DOI10.3969/j.issn.1001-893x.2017.10.011

Cover

More Information
Summary:针对非同步相似轨迹判断问题,提出了一种基于最长公共子序列理论的相似轨迹判断新算法。首先,求出查询轨迹线段与候选轨迹线段之间的距离;其次,利用最长公共子序列算法,计算两轨迹的最长公共子轨迹长度;最后,根据相似度门限,判断轨迹是否相似。数值实例验证了所提算法能够提高非同步轨迹的相似度。
Bibliography:LIU Yu,WANG Qiandong（Southwest China Institute of Electronic Technology,Chengdu 610036, China）
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 common 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.
51-1267/TN
reconnaissance and surveillance; longest common subsequence; asynchronous similar trajectory;longest common sub-trajectory
ISSN:1001-893X
DOI:10.3969/j.issn.1001-893x.2017.10.011