Share Email Print

Proceedings Paper

Fast mutual exclusion
Author(s): Simon Maskell; Mark Briers; Robert Wright
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A method is presented that circumvents the combinatorial explosion often assumed to exist when summing probabilities of joint association events in a multiple target tracking context. The approach involves no approximations in the summation and while the number of joint events grows exponentially with teh number of targets, the computational complexity of the approach is substantially less than exponential. Multiple target tracking algorithms that use this summation include mutual exclusion in a particle filtering context and the Joint Probabilistic Data Association Filter, a Kalman Filter based algorithm. The perceived computational expense associated with this combinatorial explosion has meant that such algorithms have been restricted to applications involving only a handful of targets. The approach presented here makes it possible to use such algorithms with a large number of targets.

Paper Details

Date Published: 25 August 2004
PDF: 11 pages
Proc. SPIE 5428, Signal and Data Processing of Small Targets 2004, (25 August 2004); doi: 10.1117/12.542068
Show Author Affiliations
Simon Maskell, QinetiQ Ltd. (United Kingdom)
Mark Briers, QinetiQ Ltd. (United Kingdom)
Cambridge Univ. (United Kingdom)
Robert Wright, QinetiQ Ltd. (United Kingdom)

Published in SPIE Proceedings Vol. 5428:
Signal and Data Processing of Small Targets 2004
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top