Publication View

Cramér-Rao lower bound for tracking multiple targets (2004)

Abstract
The derivation and computation of the theoretical Crame´r–Rao lower bounds for multiple target tracking has traditionally been considered to be a notoriously difficult problem. The authors present a simple and exact solution based on the assumption that raw sensor data (before thresholding) are available. The multi-target tracking problem can then be formulated as recursive Bayesian track-before-detect estimation. The advantage of this formulation is that it is identical to nonlinear filtering, for which the exact posterior Crame´r–Rao bound is already known. The paper presents several numerical examples in support of the theoretical findings.

Publication details
Download http://hdl.handle.net/1947/1897
Contributors ISRD, Intelligence, Surveillance and Reconnaissance Division
Repository Defence Science and Technology Organisation - Australia (Australia)
Language Englisch
Relation http://ieeexplore.ieee.org/iel5/2198/29130/01312053.pdf?tp=&arnumber=1312053&isnumber=29130