Translator Disclaimer
13 July 2000 Time-recursive number-of-tracks estimation for MHT
Author Affiliations +
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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);


A fast coalescence-avoiding JPDAF
Proceedings of SPIE (May 15 2012)
Comparison of PMHT and S-D assignment trackers
Proceedings of SPIE (July 27 1999)
Fast Mapping Of A Kalman Filter On Warp
Proceedings of SPIE (December 16 1989)

Back to Top