article

Bobrovsky–Zakai-Type Bound for Periodic Stochastic Filtering

  • IEEE Signal Processing Letters
  • Institute of Electrical and Electronics Engineers
Research footprint

At a glance

الاستشهادات
7
المراجع
43
Comments
0
Paper overview

Abstract

Mean-squared-error (MSE) lower bounds are commonly used for performance analysis and system design. Recursive algorithms have been derived for computation of Bayesian bounds in stochastic filtering problems. In this letter, we consider stochastic filtering with a mixture of periodic and nonperiodic states. For periodic states, the modulo- T estimation error is of interest and the MSE lower bounds are inappropriate. Therefore, in this case, the mean-cyclic error and the MSE risks are used for estimation of the periodic and nonperiodic states, respectively. We derive a Bobrovsky-Zakai-type bound for mixed periodic and nonperiodic stochastic filtering. Then, we derive a recursive computation method for this bound in order to allow its computation in dynamic settings. The proposed recursively-computed mixed Bobrovsky-Zakai bound is useful for the design and performance analysis of filters in stochastic filtering problems with both periodic and nonperiodic states. This bound is evaluated for a target tracking example and is shown to be a valid and informative bound for particle filtering performance.

Record transparency

Publication details

DOI
10.1109/lsp.2018.2861464
OpenAlex
W2888234510
Document type
article
Language
EN
Source
IEEE Signal Processing Letters
Last metadata update
المجتمع

Comments

تسجيل الدخول للانضمام إلى النقاش.

  1. لا توجد تعليقات بعد. ابدأ النقاش.