{'fraction_non_alphanumeric': 0.024669603524229075, 'fraction_numerical': 0.0, 'mean_word_length': 5.454545454545454, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Tracking in a high-clutter environment: simulation results characterizing a bi-level MHT algorithm

As detection processing becomes increasingly advanced, for example, in infrared search and track (IRST) systems, the detection threshold becomes the bottleneck to overall system performance. Significantly reducing this threshold requires the capability to track targets in a high clutter environment. In theory, the multiple hypothesis tracking (MHT) algorithm is a solution to this problem. However, in practice, MHT in its basic form becomes computationally prohibitive for all but low to moderate false alarm densities. In this paper, we evaluate a computationally feasible alternate form, which we call a bi-level MHT algorithm. The basic form of this algorithm has been previously proposed, but results on its performance have been lacking. In addition to describing an implementation of a bi-level MHT algorithm, this paper present Monte Carlo simulation results characterizing the performance of the algorithm, and demonstrates the tradeoff between track acquisition range and false track rate for a simple IRST fly-by scenario.