Paper
19 May 2006 Complexity reduction in MHT/MFA tracking, part II: hierarchical implementation and simulation results
Author Affiliations +
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Benjamin J. Slocumb and Aubrey B. Poore "Complexity reduction in MHT/MFA tracking, part II: hierarchical implementation and simulation results", Proc. SPIE 6236, Signal and Data Processing of Small Targets 2006, 62360U (19 May 2006); https://doi.org/10.1117/12.673520
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Radar

Filtering (signal processing)

Detection and tracking algorithms

Doppler effect

Data processing

Monte Carlo methods

Surveillance

Back to Top