Message passing based multitarget tracking with merged measurements

IF 3.4 2区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC Signal Processing Pub Date : 2024-08-30 DOI:10.1016/j.sigpro.2024.109682
Jingling Li, Lin Gao, Shangyu Zhao, Ping Wei
{"title":"Message passing based multitarget tracking with merged measurements","authors":"Jingling Li,&nbsp;Lin Gao,&nbsp;Shangyu Zhao,&nbsp;Ping Wei","doi":"10.1016/j.sigpro.2024.109682","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers the problem of multitarget tracking (MT) under situations where sensors have limited resolution, which leads to the presence of merged measurements (MMs). In general, an algorithm for MT under MMs can be derived by extending its standard MT counterpart which assumes that each measurement can come from at most one target. However, such an extension is by no means trivial due to the fact that one must consider data association between target groups to measurements, which results in exponential computational increasing along with the number of targets. In order to address such a difficulty, this paper proposes to adopt the message passing (MP) algorithm, and a new factor graph is constructed for MT under MMs. Then the sum–product algorithm (SPA) and max-sum algorithm (MSA) is jointly exploited for belief propagation, where the SPA is adopted for calculating the messages used for prediction and update, and the MSA is employed for efficiently perform data association. The analytical Gaussian mixture (GM) implementation is also devised for the proposed algorithm. Computational burden analyses show that the computational complexity of proposed algorithm scales linearly with respect to the number of targets and measurements. The performance of proposed algorithm is demonstrated via simulations.</p></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"227 ","pages":"Article 109682"},"PeriodicalIF":3.4000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0165168424003025","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This paper considers the problem of multitarget tracking (MT) under situations where sensors have limited resolution, which leads to the presence of merged measurements (MMs). In general, an algorithm for MT under MMs can be derived by extending its standard MT counterpart which assumes that each measurement can come from at most one target. However, such an extension is by no means trivial due to the fact that one must consider data association between target groups to measurements, which results in exponential computational increasing along with the number of targets. In order to address such a difficulty, this paper proposes to adopt the message passing (MP) algorithm, and a new factor graph is constructed for MT under MMs. Then the sum–product algorithm (SPA) and max-sum algorithm (MSA) is jointly exploited for belief propagation, where the SPA is adopted for calculating the messages used for prediction and update, and the MSA is employed for efficiently perform data association. The analytical Gaussian mixture (GM) implementation is also devised for the proposed algorithm. Computational burden analyses show that the computational complexity of proposed algorithm scales linearly with respect to the number of targets and measurements. The performance of proposed algorithm is demonstrated via simulations.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于信息传递的多目标跟踪与合并测量
本文探讨了在传感器分辨率有限的情况下的多目标跟踪(MT)问题,这种情况会导致合并测量(MMs)的出现。一般来说,MMs 下的多目标跟踪算法可以通过扩展标准的多目标跟踪算法得出,因为标准的多目标跟踪算法假定每个测量最多只能来自一个目标。然而,这种扩展绝非易事,因为我们必须考虑目标组与测量之间的数据关联,这会导致计算量随着目标数量的增加而呈指数级增长。为了解决这一难题,本文建议采用消息传递(MP)算法,并为 MM 下的 MT 构建了一个新的因子图。然后,联合利用和积算法(SPA)和最大和算法(MSA)进行信念传播,其中 SPA 用于计算用于预测和更新的消息,MSA 用于有效地执行数据关联。此外,还为拟议算法设计了高斯混合物(GM)分析实现。计算负担分析表明,所提算法的计算复杂度与目标和测量值的数量成线性关系。建议算法的性能通过仿真得到了证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Signal Processing
Signal Processing 工程技术-工程:电子与电气
CiteScore
9.20
自引率
9.10%
发文量
309
审稿时长
41 days
期刊介绍: Signal Processing incorporates all aspects of the theory and practice of signal processing. It features original research work, tutorial and review articles, and accounts of practical developments. It is intended for a rapid dissemination of knowledge and experience to engineers and scientists working in the research, development or practical application of signal processing. Subject areas covered by the journal include: Signal Theory; Stochastic Processes; Detection and Estimation; Spectral Analysis; Filtering; Signal Processing Systems; Software Developments; Image Processing; Pattern Recognition; Optical Signal Processing; Digital Signal Processing; Multi-dimensional Signal Processing; Communication Signal Processing; Biomedical Signal Processing; Geophysical and Astrophysical Signal Processing; Earth Resources Signal Processing; Acoustic and Vibration Signal Processing; Data Processing; Remote Sensing; Signal Processing Technology; Radar Signal Processing; Sonar Signal Processing; Industrial Applications; New Applications.
期刊最新文献
PIPO-Net: A Penalty-based Independent Parameters Optimization deep unfolding Network An interference power allocation method against multi-objective radars based on optimized proximal policy optimization Codesign of transmit waveform and reflective beamforming for active reconfigurable intelligent surface-aided MIMO ISAC system Adaptive three-dimensional histogram modification for JPEG reversible data hiding A novel Gaussian-Student’s t-Skew mixture distribution based Kalman filter
×
引用
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