Share Email Print

Proceedings Paper

Time-recursive number-of-tracks estimation for MHT
Author(s): Jessica Bradley; Kevin M. Buckley; Richard Perry
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 13 July 2000
PDF: 11 pages
Proc. SPIE 4048, Signal and Data Processing of Small Targets 2000, (13 July 2000); doi: 10.1117/12.392003
Show Author Affiliations
Jessica Bradley, Villanova Univ. (United States)
Kevin M. Buckley, Villanova Univ. (United States)
Richard Perry, Villanova Univ. (United States)

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

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?