Controlling track coalescence with scaled joint probabilistic data association
Files
(Published version)
Date
2008
Authors
Kennedy, H.L.
Editors
Bates, B.
Bevan, B.
Bevan, B.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of 2008 International Conference on Radar, 2008 / Bates, B., Bevan, B. (ed./s), pp.440-445
Statement of Responsibility
Conference Name
International Conference on Radar 2008 (2 Sep 2008 - 5 Sep 2008 : Adelaide, South Australia)
Abstract
Track coalescence is undesirable when estimating the states of multiple manoeuvring targets, with a less-than-unity probability of detection, in clutter. Simple and compound forms of coalescence are defined and discussed. Simple coalescence is when two or more identical tracks follow a single target; compound coalescence is when two or more identical tracks follow the midpoint (or centroid) of two or more targets. It is shown that the incidence of compound track coalescence in Joint Probabilistic Data Association (JPDA) may be reduced using a scaling factor to favour the most likely association hypothesis. This prevents multiple hypothesis equivalence when tracking closely-spaced or crossing targets. The performance of the Scaled JPDA (SJPDA) algorithm is compared with Probabilistic Data Association (PDA) and JPDA using real and simulated data. Larger scaling factors decrease the likelihood and duration of compound track coalescence; however, they also increase the likelihood of track divergence on clutter or other targets. A value of unity corresponds to JPDA. The optimal value may be chosen to suit the application. A factor of two was found to give good results in the test data.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2008 IEEE