Step-by-step description of a computationally efficient version of multiple hypothesis tracking

John R. Werthmann

doi:10.1117/12.139379

25 August 1992 Step-by-step description of a computationally efficient version of multiple hypothesis tracking

John R. Werthmann

Proceedings Volume 1698, Signal and Data Processing of Small Targets 1992; (1992) https://doi.org/10.1117/12.139379
Event: Aerospace Sensing, 1992, Orlando, FL, United States

Abstract

Under the recently completed Covert Air Combat Definition Study, a form of multiple hypothesis tracking, known as structured branching (SB/MHT), was developed and tested by Hughes Radar Systems Group. SB/MHT offers significant computational savings compared to other approaches, enabling it to maintain a great number of hypothesized tracks, initiated in high false alarm environments without overwhelming current generation tactical processors. Under the recently initiated Advanced Tracking Algorithms Program, the SB/MHT algorithm will be further developed and hosted on a tactical airborne processor to demonstrate realtime performance. This paper walks through the algorithm sequence of operations in order to give the reader an intuitive understanding of SB/MHT. The paper begins with a description of the basic idea of MHT algorithms; i.e., to carry hypotheses when there is doubt about which tracks to associate with new observations. The primary differences between SB/MHT and `classical' MHT are briefly discussed. Each operation in the SB/MHT block diagram is explained by stepping through the operations that would take place given an assumed set of tracks, and a set of observations to be processed. Operations to be discussed include: observation filtering and prediction, gate formation and observation-to-track association, track branching and initiation, initial track scoring and pruning, track clustering, hypothesis generation and scoring, and finally, global track scoring and pruning. Methods for controlling track-file growth and its resultant computational load are also discussed. Although high level in terms of the amount of detail covered, this description should provide the reader with a good understanding of the fundamental characteristics of a streamlined MHT algorithm envisioned to operate in real time on a current generation airborne tactical processor.

Citation Download Citation

John R. Werthmann "Step-by-step description of a computationally efficient version of multiple hypothesis tracking", Proc. SPIE 1698, Signal and Data Processing of Small Targets 1992, (25 August 1992); https://doi.org/10.1117/12.139379

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available