DocumentCode
2383407
Title
A new probabilistic data association filter based on composite expanding and fading memory polynomial filters
Author
Nadjiasngar, Roaldje ; Inggs, Michael ; Paichard, Yoann ; Morrison, Norman
Author_Institution
Dept. of Electr. Eng., Univ. of Cape Town, Rondebosch, South Africa
fYear
2011
fDate
23-27 May 2011
Firstpage
152
Lastpage
156
Abstract
This paper presents the use of composite expanding and fading memory polynomial filters performing tracking in conditions of heavy clutter and low probability of detection. The composite expanding and fading memory polynomial filters are modified to incorporate probabilistic data association, and a simulation study shows that this new type of filtering offers performance comparable to the linear Kalman filter in a high clutter density and low detection probability environment.
Keywords
clutter; fading; filtering theory; polynomials; probability; sensor fusion; tracking; composite expanding polynomial filter; detection probability; fading memory polynomial filter; heavy clutter; probabilistic data association filter; Clutter; Covariance matrix; Kalman filters; Personal digital assistants; Polynomials; Probabilistic logic; Target tracking;
fLanguage
English
Publisher
ieee
Conference_Titel
Radar Conference (RADAR), 2011 IEEE
Conference_Location
Kansas City, MO
ISSN
1097-5659
Print_ISBN
978-1-4244-8901-5
Type
conf
DOI
10.1109/RADAR.2011.5960518
Filename
5960518
Link To Document