A group target track-before-detect approach using two-stage strategy with maximum-likelihood probabilistic data association

IF 1.4 4区 管理学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Iet Radar Sonar and Navigation Pub Date : 2024-05-10 DOI:10.1049/rsn2.12574
Leiru Bu, Bin Rao, Dan Song
{"title":"A group target track-before-detect approach using two-stage strategy with maximum-likelihood probabilistic data association","authors":"Leiru Bu,&nbsp;Bin Rao,&nbsp;Dan Song","doi":"10.1049/rsn2.12574","DOIUrl":null,"url":null,"abstract":"<p>In tracking scenarios involving groups with dense targets, achieving effective data association is challenging due to mutual occlusion and interference among targets. The complexity of the tracking problem is further exacerbated in low-observable environments by the increase in false alarm rates. The track-before-detect (TBD) is an advanced technology for detecting and tracking low-observable targets, effectively mitigating data association problems by integrating multi-frame echo data. However, the existing multi-target TBD algorithms typically assume that the targets are spatially separated and are not suitable for scenarios involving group targets. A group target maximum-likelihood probabilistic data association (GT-ML-PDA) algorithm, based on the concept of TBD, is proposed to track group targets effectively in low-observable environments. The proposed algorithm divides group target tracking into two stages: group centre trajectory estimation and individual target trajectory estimation. To enhance the performance of the proposed algorithm, two strategies are suggested: modifying the equivalent measurements and extracting independent measurement sets for individual targets. Simulation results demonstrate that the proposed algorithm is capable of effectively tracking numerous individual targets within a group, even in the presence of heavy clutter.</p>","PeriodicalId":50377,"journal":{"name":"Iet Radar Sonar and Navigation","volume":"18 8","pages":"1351-1363"},"PeriodicalIF":1.4000,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/rsn2.12574","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iet Radar Sonar and Navigation","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/rsn2.12574","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

In tracking scenarios involving groups with dense targets, achieving effective data association is challenging due to mutual occlusion and interference among targets. The complexity of the tracking problem is further exacerbated in low-observable environments by the increase in false alarm rates. The track-before-detect (TBD) is an advanced technology for detecting and tracking low-observable targets, effectively mitigating data association problems by integrating multi-frame echo data. However, the existing multi-target TBD algorithms typically assume that the targets are spatially separated and are not suitable for scenarios involving group targets. A group target maximum-likelihood probabilistic data association (GT-ML-PDA) algorithm, based on the concept of TBD, is proposed to track group targets effectively in low-observable environments. The proposed algorithm divides group target tracking into two stages: group centre trajectory estimation and individual target trajectory estimation. To enhance the performance of the proposed algorithm, two strategies are suggested: modifying the equivalent measurements and extracting independent measurement sets for individual targets. Simulation results demonstrate that the proposed algorithm is capable of effectively tracking numerous individual targets within a group, even in the presence of heavy clutter.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
采用最大似然概率数据关联的两阶段策略的群目标先跟踪后检测方法
在涉及密集目标群的跟踪场景中,由于目标之间的相互遮挡和干扰,实现有效的数据关联具有挑战性。在低可观测环境中,误报率的增加进一步加剧了跟踪问题的复杂性。先跟踪后检测(Track-before-detect,TBD)是检测和跟踪低可观测目标的先进技术,通过整合多帧回波数据有效缓解了数据关联问题。然而,现有的多目标 TBD 算法通常假定目标在空间上是分离的,并不适用于涉及群体目标的情况。本文提出了一种基于 TBD 概念的群目标最大似然概率数据关联(GT-ML-PDA)算法,可在低可观测环境中有效跟踪群目标。该算法将群体目标跟踪分为两个阶段:群体中心轨迹估计和单个目标轨迹估计。为提高所提算法的性能,提出了两种策略:修改等效测量值和提取单个目标的独立测量集。仿真结果表明,即使在杂波严重的情况下,所提出的算法也能有效跟踪群组中的众多单个目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Iet Radar Sonar and Navigation
Iet Radar Sonar and Navigation 工程技术-电信学
CiteScore
4.10
自引率
11.80%
发文量
137
审稿时长
3.4 months
期刊介绍: IET Radar, Sonar & Navigation covers the theory and practice of systems and signals for radar, sonar, radiolocation, navigation, and surveillance purposes, in aerospace and terrestrial applications. Examples include advances in waveform design, clutter and detection, electronic warfare, adaptive array and superresolution methods, tracking algorithms, synthetic aperture, and target recognition techniques.
期刊最新文献
Matched cross-spectrum phase processing for source depth estimation in deep water Development of a reliable adaptive estimation approach for a low-cost attitude and heading reference system Availability evaluation and optimisation of advanced receiver autonomous integrity monitoring fault detection and exclusion considering temporal correlations Multi-agent multi-dimensional joint optimisation of jamming decision-making against multi-functional radar Active reconfigurable intelligent surface-aided multiple-input-multiple-output radar detection in the presence of clutter
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1