The Marginal Enumeration Bayesian Cramér–Rao Bound for Jump Markov Systems
Year: 2014
Type: article
Abstract: A marginal version of the enumeration Bayesian Cramér-Rao Bound (EBCRB) for jump Markov systems is proposed. It is shown that the proposed bound is at least as tight as EBCRB and the improvement stems from better handling of the nonlinearities. The new bound is illustrated to yield tighter results than BCRB and EBCRB on a benchmark example.
Source: IEEE Signal Processing Letters
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1999577353
