Comparison of data association algorithms for bearings-only multi-sensor multi-target tracking

Michael Beard, S. Arulampalam
{"title":"Comparison of data association algorithms for bearings-only multi-sensor multi-target tracking","authors":"Michael Beard, S. Arulampalam","doi":"10.1109/ICIF.2007.4408037","DOIUrl":null,"url":null,"abstract":"In multi-sensor multi-target bearings-only tracking we often see false intersections of bearings known as ghosts. When the bearing measurements from each sensor have been associated to form sequences termed threads, the problem is to associate pairs of threads to identify the true target intersections. In this paper we present two algorithms: (i) classical bayesian thread association (CBTA) and (ii) Monte Carlo thread association (MCTA), for this problem. The performance of these algorithms is compared using Monte Carlo simulations. Furthermore, we also compare their performance against the Rao-Blackwellised Monte Carlo Data Association (RBMCDA) algorithm, which uses unthreaded measurements, in order to ascertain the benefits of using thread information. Simulations show that MCTA is superior to CBTA, and that there is significant benefit in using thread information in this class of problems.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 10th International Conference on Information Fusion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIF.2007.4408037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In multi-sensor multi-target bearings-only tracking we often see false intersections of bearings known as ghosts. When the bearing measurements from each sensor have been associated to form sequences termed threads, the problem is to associate pairs of threads to identify the true target intersections. In this paper we present two algorithms: (i) classical bayesian thread association (CBTA) and (ii) Monte Carlo thread association (MCTA), for this problem. The performance of these algorithms is compared using Monte Carlo simulations. Furthermore, we also compare their performance against the Rao-Blackwellised Monte Carlo Data Association (RBMCDA) algorithm, which uses unthreaded measurements, in order to ascertain the benefits of using thread information. Simulations show that MCTA is superior to CBTA, and that there is significant benefit in using thread information in this class of problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
纯方位多传感器多目标跟踪数据关联算法比较
在多传感器多目标纯方位跟踪中,我们经常会看到虚假的方位相交,也就是所谓的鬼影。当来自每个传感器的轴承测量值被关联到称为螺纹的序列时,问题是将螺纹对关联以识别真正的目标交叉点。在本文中,我们提出了两种算法:(i)经典贝叶斯线程关联(CBTA)和(ii)蒙特卡罗线程关联(MCTA)来解决这个问题。通过蒙特卡罗仿真比较了这些算法的性能。此外,我们还将它们的性能与使用非线程测量的Rao-Blackwellised蒙特卡洛数据关联(RBMCDA)算法进行比较,以确定使用线程信息的好处。仿真表明MCTA优于CBTA,并且在这类问题中使用线程信息有显著的好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Semi-autonomous reference data generation for perception performance evaluation Track association and fusion with heterogeneous local trackers Distributed detection of a nuclear radioactive source using fusion of correlated decisions Distributed data fusion algorithms for tracking a maneuvering target Multi agent systems for flexible and robust Bayesian information fusion
×
引用
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