Paper
13 June 2014 Advancement of an algorithm
Author Affiliations +
Abstract
The Probabilistic Multi-Hypothesis Tracker (PMHT) was developed in the early 1990s by Roy Streit and Tod Luginbuhl. Since that time many advances and improvements have been made to this elegant algorithm that is linearly efficient in processing as the number of targets, sensors, and clutter increases. This paper documents the many advances to the PMHT by several different contributors over the past two decades. The history continues and looks as promising as ever for this algorithm as we present the latest advancement—the Maximum Likelihood, Histogram Probabilistic Multi-Hypothesis Tracker (ML-HPMHT)—and the exciting results of this potential game-changer in tracking unresolved, dim targets in highly cluttered environments. This new algorithm, which we are calling the Quanta Tracking algorithm, detects and tracks with high accuracy targets that are unresolved in pixels or range bins.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Darin T. Dunham, Terry L. Ogle, Peter K. Willett, and Balakumar Balasingam "Advancement of an algorithm", Proc. SPIE 9092, Signal and Data Processing of Small Targets 2014, 90920K (13 June 2014); https://doi.org/10.1117/12.2051355
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Expectation maximization algorithms

Algorithm development

Staring arrays

Target detection

Data modeling

Algorithms

RELATED CONTENT

The PMHT: solutions to some of its problems
Proceedings of SPIE (September 25 2007)
Performance assessment of group detection algorithms
Proceedings of SPIE (September 02 2004)
Group assignment problem
Proceedings of SPIE (January 05 2004)
Comparison of PMHT and S-D assignment trackers
Proceedings of SPIE (July 27 1999)

Back to Top