Share Email Print

Proceedings Paper

Complexity reduction in MHT/MFA tracking: part II, hierarchical implementation and simulation results
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The MHT/MFA approach to tracking has been shown to have significant advantages compared to single frame methods. This is especially the case for dense scenarios where there are many targets and/or significant clutter. However, the data association problem for such scenarios can become computationally prohibitive. To make the problem manageable, one needs effective complexity reduction methods to reduce the number of possible associations that the data association algorithm must consider. At the 2005 SPIE conference, Part I of this paper1 was presented wherein a number of "gating algorithms" used for complexity reduction were derived. These included bin gates, coarse pair and triple gates, and multiframe gates. In this Part II paper, we provide new results that include additional gating methods, describe a hierarchical framework for the integration of gates, and show simulation results that demonstrate a greater than 95% effectiveness at removing clutter from the tracking problem.

Paper Details

Date Published: 19 May 2006
PDF: 12 pages
Proc. SPIE 6236, Signal and Data Processing of Small Targets 2006, 62360U (19 May 2006); doi: 10.1117/12.673520
Show Author Affiliations
Benjamin J. Slocumb, Numerica Corp. (United States)
Aubrey B. Poore, Numerica Corp. (United States)

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

© SPIE. Terms of Use
Back to Top