Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

A fully automatic tracking algorithm must be able to deal with an unknown number of targets, unknown target initiation and termination times, false measurements and possibly time-varying target trajectory behaviour. An efficient algorithm for tracking in this environment is presented here. This approach makes use of estimates of the probability of target existence, which is an integral part of the algorithm. This allows for the efficient generation and management of possible target hypotheses, yielding an algorithm with performance that matches what can be obtained by multiple hypothesis tracking-based approaches, but at a significantly lower computational cost. This paper considers only the single target case for clarity. The extension to multiple targets is easily incorporated into this framework. Simulation studies are given that show the effectiveness of this approach in the presence of heavy and nonuniform clutter when tracking a target in an environment of low probability of detection and in an environment where the target performs violent manoeuvres. © 2007 IEEE.

Original publication

DOI

10.1109/TAES.2007.4441748

Type

Journal article

Journal

IEEE Transactions on Aerospace and Electronic Systems

Publication Date

01/10/2007

Volume

43

Pages

1409 - 1425