Comparison of Nearest Neighbor and Probabilistic Data Association Filters for Target Tracking in Cluttered Environment

Tensy Thomas, Sreeja S
{"title":"Comparison of Nearest Neighbor and Probabilistic Data Association Filters for Target Tracking in Cluttered Environment","authors":"Tensy Thomas, Sreeja S","doi":"10.1109/iccca52192.2021.9666392","DOIUrl":null,"url":null,"abstract":"Target tracking is having of great importance as it is one of the developing areas which has various applications in the military as well as civilian applications. Detection of target and data association in presence of false alarms are the two main difficult situations faced during tracking a maneuvering target. A survey has been done on the number of algorithms developed so far to solve the difficulties in target tracking. This paper gives a brief review of the need for data association and the algorithms and techniques proposed so far to resolve the problem due to data correlation in target tracking. In this paper, a simulation has been carried out to analyze the filter performance using nearest neighbor (NN) and probabilistic data association (PDA) as data association techniques. A comparison has been done between these two algorithms based on the variation in the values of the sampling time, clutter rate, standard deviation in noise covariances. The results fosters the use of PDA as the better data association algorithm for tracking process especially in high cluttered environment.","PeriodicalId":399605,"journal":{"name":"2021 IEEE 6th International Conference on Computing, Communication and Automation (ICCCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 6th International Conference on Computing, Communication and Automation (ICCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccca52192.2021.9666392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Target tracking is having of great importance as it is one of the developing areas which has various applications in the military as well as civilian applications. Detection of target and data association in presence of false alarms are the two main difficult situations faced during tracking a maneuvering target. A survey has been done on the number of algorithms developed so far to solve the difficulties in target tracking. This paper gives a brief review of the need for data association and the algorithms and techniques proposed so far to resolve the problem due to data correlation in target tracking. In this paper, a simulation has been carried out to analyze the filter performance using nearest neighbor (NN) and probabilistic data association (PDA) as data association techniques. A comparison has been done between these two algorithms based on the variation in the values of the sampling time, clutter rate, standard deviation in noise covariances. The results fosters the use of PDA as the better data association algorithm for tracking process especially in high cluttered environment.
最近邻滤波器与概率数据关联滤波器在混乱环境下目标跟踪中的比较
目标跟踪作为发展中的领域之一,在军事和民用领域都有着广泛的应用,具有十分重要的意义。在机动目标跟踪过程中,目标检测和虚警情况下的数据关联是两个主要难题。对目前开发的解决目标跟踪难题的算法进行了综述。本文简要介绍了数据关联的必要性以及目前提出的解决目标跟踪中数据关联问题的算法和技术。本文采用最近邻(NN)和概率数据关联(PDA)作为数据关联技术,进行了滤波性能仿真分析。从采样时间、杂波率、噪声协方差标准差的变化情况对两种算法进行了比较。研究结果表明,PDA是一种较好的数据关联算法,尤其适用于高度混乱环境下的跟踪过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信