Share Email Print
cover

Proceedings Paper

Reducing MHT computational requirements through use of cheap JPDA methods
Author(s): Hector A. Quevedo; Samuel S. Blackman; T. Nichols; Robert J. Dempster; R. Wenski
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Hypothesis formation is a major computational burden for any multiple hypotheses tracking (MHT) method. In particular, a track-oriented MHT method defines compatible tracks to be tracks not sharing common observations and then re-forms hypotheses from compatible tracks after each new scan of data is received. The Cheap Joint Probabilistic Data Association (CJPDA) method provides an efficient means for computing approximate hypothesis probabilities. This paper presents a method of extending CJPDA calculations in order to eliminate low probability track branches in a track-oriented MHT method. The method is tested using IRST data. This approach reduces the number of tracks in a cluster and the resultant computations required for hypothesis formation. It is also suggested that the use of CJPDA methods can reduce assignment matrix sizes and resultant computations for the hypothesis-oriented (Reid’s algorithm) MHT implementation.

Paper Details

Date Published: 26 November 2001
PDF: 12 pages
Proc. SPIE 4473, Signal and Data Processing of Small Targets 2001, (26 November 2001); doi: 10.1117/12.492775
Show Author Affiliations
Hector A. Quevedo, Raytheon Co. (United States)
Samuel S. Blackman, Raytheon Co. (United States)
T. Nichols, Raytheon Co. (United States)
Robert J. Dempster, Raytheon Co. (United States)
R. Wenski, Raytheon Co. (United States)


Published in SPIE Proceedings Vol. 4473:
Signal and Data Processing of Small Targets 2001
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top