Track Matching Method of Sea Surface Targets Based on Improved Longest Common Subsequence Algorithm

Dewei Deng, Ziqian Xiong, Chuan Wang, Hao Liu
{"title":"Track Matching Method of Sea Surface Targets Based on Improved Longest Common Subsequence Algorithm","authors":"Dewei Deng, Ziqian Xiong, Chuan Wang, Hao Liu","doi":"10.1109/ICUS55513.2022.9986530","DOIUrl":null,"url":null,"abstract":"Track similarity analysis is an important part of historical track big data mining analysis, which provides a basis for track clustering, target recognition, and target activity law analysis. The paper adopts the improved longest common subsequence method to measure the similarity between different tracks and complete track matching. Firstly, we establish a historical track database and establish a raster spatial index for the key sea areas of concern. Secondly, we preprocess the track data and unify the data of different sampling scales into one space-time dimension through sparse or interpolation, retrieve historical tracks that are geographically close to the current track, and use the improved longest common subsequence method to calculate the matching similarity probability between the current track and the historical track. Finally, the track clustering and activity rule mining analysis are completed according to the calculated maximum matching probability. The simulation experiment verifies that the algorithm can effectively calculate and complete the correlation matching of target tracks, which provides an effective basis for target track clustering and activity law mining and analysis.","PeriodicalId":345773,"journal":{"name":"2022 IEEE International Conference on Unmanned Systems (ICUS)","volume":"24 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Unmanned Systems (ICUS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUS55513.2022.9986530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Track similarity analysis is an important part of historical track big data mining analysis, which provides a basis for track clustering, target recognition, and target activity law analysis. The paper adopts the improved longest common subsequence method to measure the similarity between different tracks and complete track matching. Firstly, we establish a historical track database and establish a raster spatial index for the key sea areas of concern. Secondly, we preprocess the track data and unify the data of different sampling scales into one space-time dimension through sparse or interpolation, retrieve historical tracks that are geographically close to the current track, and use the improved longest common subsequence method to calculate the matching similarity probability between the current track and the historical track. Finally, the track clustering and activity rule mining analysis are completed according to the calculated maximum matching probability. The simulation experiment verifies that the algorithm can effectively calculate and complete the correlation matching of target tracks, which provides an effective basis for target track clustering and activity law mining and analysis.
基于改进最长公共子序列算法的海面目标航迹匹配方法
航迹相似度分析是历史航迹大数据挖掘分析的重要组成部分,为航迹聚类、目标识别和目标活动规律分析提供了基础。本文采用改进的最长公共子序列法测量不同航迹之间的相似度,实现航迹的完全匹配。首先,建立历史航迹数据库,建立重点关注海域的栅格空间指数;其次,对航迹数据进行预处理,通过稀疏或插值将不同采样尺度的数据统一到一个时空维度,检索地理上与当前航迹接近的历史航迹,并使用改进的最长公共子序列法计算当前航迹与历史航迹的匹配相似概率;最后,根据计算出的最大匹配概率完成航迹聚类和活动规则挖掘分析。仿真实验验证了该算法能够有效地计算并完成目标航迹的相关匹配,为目标航迹聚类和活动规律挖掘分析提供了有效依据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信