By Topic

Real-Time Tracking Of Hundreds Of Targets With Efficient Exact JPDAF Implementation

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
$33 $13
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

2 Author(s)
Paul Horridge ; QinetiQ Ltd., Malvern Technology Centre, St Andrews Road, Malvern, Worcester, UK. ; Simon Maskell

An assignment problem is considered with the constraint that the same hypothesis cannot be applied to more than one object. We desire efficiency without approximation. Multiple target tracking methods such as the joint probabilistic association filter (JPDAF) motivate us. Methods of solving this assignment problem involving enumerating all possible joint assignments is infeasible except for small problems. A recent approach circumvents this combinatorial explosion by representing the structure of the target hypotheses in a `net' which exploits redundancy in an ordered list of objects us to describe the problem. Here, we generalize this approach to process the objects in a tree structure this exploits conditional independence between subsets of the objects. This gives a substantial computational saving and allows us to consider scenarios which were previously impractical. In particular, we show the feasibility of using an exact JPDAF implementation to track 400 targets

Published in:

2006 9th International Conference on Information Fusion

Date of Conference:

10-13 July 2006