Paper
1 October 1990 Applications of MHT to dim moving targets
G. C. Demos
Author Affiliations +
Abstract
This paper discusses the application of a particular implementation of Multiple Hypothesis Tracking (MHT) to the problem of detection and tracking of dim targets in a heavy clutter or false alarm background. The MHT method and the performance improvement associated with MHT for these applications is well documented [1—6], but the actual implementation has been limited due to the computational load and complexity associated with "traditional" implementations. We present an approach (Structured Branching) that offers significant computational savings as compared with alternative approaches, and can maintain hundreds of "possible" tracks that are initiated in a dense clutter or false alarm background without overwhelming computational or memory requirements. Further, this method can be applied to much more limited implementations according to the computational resources available—there is minimal "overhead" associated with Structured Branching (SB) since hypotheses are not propagated explicitly. The SB algorithm is described, highlighting the ways in which computational savings are achieved, and simulation results are presented. Then, approximate techniques are developed for predicting the performance of MHT (any implementation, not just SB), and results comparing predicted performance with simulation results are presented.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
G. C. Demos "Applications of MHT to dim moving targets", Proc. SPIE 1305, Signal and Data Processing of Small Targets 1990, (1 October 1990); https://doi.org/10.1117/12.2321771
Lens.org Logo
CITATIONS
Cited by 24 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Target detection

Computer simulations

Data processing

Signal processing

Detection and tracking algorithms

Error analysis

Logic

Back to Top