首页期刊视频编委会征稿启事出版道德声明审稿流程读者订阅论文查重联系我们English
引用本文
  • 王前东.大批量目标航迹关联加速算法[J].电讯技术,2014,54(12): - .    [点击复制]
  • WANG Qian-dong.An accelerated track association algorithm for a large number of targets[J].,2014,54(12): - .   [点击复制]
【打印本页】 【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 3256次   下载 49 本文二维码信息
码上扫一扫!
大批量目标航迹关联加速算法
王前东
0
(中国西南电子技术研究所,成都 610036)
摘要:
针对分布式航迹关联耗时较多的问题,提出了一种加快处理速度的新算法。该方法首先将平面等分割成很多矩形网格;其次,根据关联门限计算关联的矩形网格集合;最后,根据关联网格集合选定待关联目标,从而减少关联次数,提高处理速度。仿真试验表明,当目标数为1 600以上、传感器数为2以上时,航迹关联加速算法比一般航迹关联算法的处理速度高出30倍以上。
关键词:  航迹关联  大批量目标  加速关联算法  网格剖分
DOI:
基金项目:
An accelerated track association algorithm for a large number of targets
WANG Qian-dong
()
Abstract:
To solve the problem that distributed track-to-track association algorithm occupies too much time when a large number of targets are detected,a new accelerated algorithm is proposed.Firstly,the plane area is partitioned into many equal-sized rectangle grids by grid partition method.Secondly,the association grids are computed by the association threshold.Finally,the possible association targets are selected by these association grids,which can reduce association times and improve processing speed.The simulation shows the velocity of the accelerated track-to-track association method is more than 30 times than that of the common track-to-track association method when 1 600 targets(or more) are detected by 2 sensors(or more).
Key words:  track-to-track association  a large number of targets  accelerated association algorithm  grid partition
安全联盟站长平台