Translator Disclaimer
Paper
15 April 2010 The JPDAF in practical systems: approximations
Author Affiliations +
Abstract
In this paper we look at various algorithms for approximating the target-measurement association probabilities of the Joint Probabilistic Data Association Filter (JPDAF). We consider their computational complexity and compare their performance with respect to the Mean Optimal Subpattern Assignment (MOSPA) statistic in a scenario involving closely-spaced targets.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kevin Romeo, David F. Crouse, Yaakov Bar-Shalom, and Peter Willett "The JPDAF in practical systems: approximations", Proc. SPIE 7698, Signal and Data Processing of Small Targets 2010, 76981I (15 April 2010); https://doi.org/10.1117/12.862932
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A fast coalescence-avoiding JPDAF
Proceedings of SPIE (May 15 2012)
Cramer-Rao bound for multiple-target tracking
Proceedings of SPIE (August 01 1991)
Improvements to parameter extraction from noisy signals
Proceedings of SPIE (March 08 1995)
Time-recursive number-of-tracks estimation for MHT
Proceedings of SPIE (July 13 2000)

Back to Top