Cramer-Rao bound for multiple-target tracking

Frederick E. Daum

doi:10.1117/12.45667

1 August 1991 Cramer-Rao bound for multiple-target tracking

Frederick E. Daum

Proceedings Volume 1481, Signal and Data Processing of Small Targets 1991; (1991) https://doi.org/10.1117/12.45667
Event: Orlando '91, 1991, Orlando, FL, United States

Abstract

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.

Citation Download Citation

Frederick E. Daum "Cramer-Rao bound for multiple-target tracking", Proc. SPIE 1481, Signal and Data Processing of Small Targets 1991, (1 August 1991); https://doi.org/10.1117/12.45667

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available