1 August 1991 Cramer-Rao bound for multiple-target tracking
Author Affiliations +
Proceedings Volume 1481, Signal and Data Processing of Small Targets 1991; (1991); doi: 10.1117/12.45667
Event: Orlando '91, 1991, Orlando, FL, United States
This paper describes a new theoretical bound on performance for tracking in a dense multiple target environment with clutter, false alarms, missed detections, target maneuvers, etc. It is a Cramer-Rao bound on the estimation error covariance matrix. In contrast to the recent bound reported elsewhere, the bound described in this paper requires no Monte Carlo simulation. The new bound is based on Kamen's formulation of the multiple target tracking (MTT) problem as a nonlinear estimation problem. Kamen's model of MTT eliminates the combinatorial aspect of the problem, and replaces it with an analytical problem, which allows the use of the Cramer-Rao bound.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Frederick E. Daum, "Cramer-Rao bound for multiple-target tracking", Proc. SPIE 1481, Signal and Data Processing of Small Targets 1991, (1 August 1991); doi: 10.1117/12.45667; https://doi.org/10.1117/12.45667

Nonlinear filtering

Target detection

Detection and tracking algorithms

Error analysis

Information operations

Data processing

Mathematical modeling

Back to Top