Time-recursive number-of-tracks estimation for MHT

Jessica Bradley; Kevin M. Buckley; Richard Perry

doi:10.1117/12.392003

Translator Disclaimer

13 July 2000 Time-recursive number-of-tracks estimation for MHT

Jessica Bradley, Kevin M. Buckley, Richard Perry

Author Affiliations +

Proceedings Volume 4048, Signal and Data Processing of Small Targets 2000; (2000) https://doi.org/10.1117/12.392003
Event: AeroSense 2000, 2000, Orlando, FL, United States

Abstract

In this paper we address the issue of measurement-to-track association within the framework of multiple hypothesis tracking (MHT). Specifically, we generate a maximum a posterior (MAP) cost as a function of the number of tracks K. This cost is generated, for each K, as a marginalization over the set of hypothesized track-sets. The proposed algorithm is developed based on a trellis diagram representation of MHT, and a generalized list-Viterbi algorithm for pruning and merging hypotheses. Compared to methods of pruning hypotheses for either MHT or Bayesian multitarget tracking, the resulting Viterbi MHT algorithm is less likely to incorrectly drop tracks in high clutter and high missed- detection scenarios. The proposed number-of-tracks estimation algorithm provides a time-recursive estimate of the number of tracks. It also provides track estimates, allows for the deletion and addition of tracks, and accounts for false alarms and missed detections.

Citation Download Citation

Jessica Bradley, Kevin M. Buckley, and Richard Perry "Time-recursive number-of-tracks estimation for MHT", Proc. SPIE 4048, Signal and Data Processing of Small Targets 2000, (13 July 2000); https://doi.org/10.1117/12.392003

ACCESS THE FULL ARTICLE