Cart (Loading....) | Create Account
Close category search window

Cramer-Rao bound for nonlinear filtering with Pd<1 and its application to target tracking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Farina, Alfonso ; Alenia Marconi Syst., Rome, Italy ; Ristic, B. ; Timmoneri, L.

The paper investigates the Cramer-Rao bound for discrete-time nonlinear filtering in the case where the probability of detection of a sensor is less than unity. The theoretical formula involves the evaluation of exponentially growing number of possible miss/detection sequences. An approximation of the theoretical bound for practical applications, such as target tracking, where the number of sensor scans is large, is proposed. An application of the developed techniques to the well-known filtering problem of tracking a re-entry ballistic object is also presented

Published in:

Signal Processing, IEEE Transactions on  (Volume:50 ,  Issue: 8 )

Date of Publication:

Aug 2002

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.