We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
基于最长公共子序列的非同步相似轨迹判断.
- Authors
刘宇; 王前东
- 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 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.
- Publication
Telecommunication Engineering, 2017, Vol 57, Issue 10, p1165
- ISSN
1001-893X
- Publication type
Article
- DOI
10.3969/j.issn.1001-893x.2017.10.011