The crucial problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information If an incorrect hit is associated with a track, that track could diverge and prematurely terminate or cause other tracks to also diverge. Most methods for hit-to-track data association fall into two categories: multiple hypothesis tracking (MHT) and joint probabilistic data association (JPDA). Versions of MHT use all or some reasonable hits to update a track and delay the decision on which hit was correct. JPDA uses a weighted sum of the reasonable hits to update a track. These weights are the probability that the hit originated from the target in track. The computational load for the joint probabilities increases exponentially as the number of targets increases and therefore, is not an attractive algorithm when expecting to track many targets. Reviewed here is the JPDA filter and two simple approximations of the joint probabilities which increase linearly in computational load as the number of targets increase. Then a new class of near optimal JPDA algorithms is introduced which run in polynomial time. The power of the polynomial is an input to the algorithm. This algorithm bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms.<>
A class of near optimal JPDA algorithms
IEEE Transactions on Aerospace and Electronic Systems ; 30 , 2 ; 504-510
1994-04-01
616773 byte
Article (Journal)
Electronic Resource
English
A Class of Near Optimal JPDA Algorithms
Online Contents | 1994
|Combining IMM and JPDA for tracking multiple maneuvering targets in clutter
British Library Conference Proceedings | 2002
|Minimum Uncertainty JPDA Filters and Coalescence Avoidance for Multiple Object Tracking
Online Contents | 2016
|Minimum Uncertainty JPDA Filters and Coalescence Avoidance for Multiple Object Tracking
Springer Verlag | 2016
|