By Topic

Adaptive probabilistic data-association algorithm for tracking in cluttered environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ahmeda, S.S. ; Dept. of Electr. & Electron. Eng., Nottingham Univ., UK ; Harrison, I. ; Woolfson, M.S.

A probabilistic data-association filter which uses adaptive update times, for tracking a target in a cluttered environment and in an environment where the probability of detection (Pd) is less than the unity, is presented and compared with the probabilistic data-association filter which uses a constant update time. The tracking performance of the algorithm is assessed by Monte Carlo simulation on different target trajectories. A comparison is made using the percentage of tracks lost, the mean-square errors, the mean update times and mean number of updates

Published in:

Radar, Sonar and Navigation, IEE Proceedings -  (Volume:143 ,  Issue: 1 )