Paper
25 August 2004 Fast mutual exclusion
Author Affiliations +
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.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Simon Maskell, Mark Briers, and Robert Wright "Fast mutual exclusion", Proc. SPIE 5428, Signal and Data Processing of Small Targets 2004, (25 August 2004); https://doi.org/10.1117/12.542068
Lens.org Logo
CITATIONS
Cited by 25 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Filtering (signal processing)

Electronic filtering

Particle filters

Particles

Back to Top