Article detail · 2014 · article
The Marginal Enumeration Bayesian Cramer Rao Bound for Jump Markov Systems
Journal
IEEE Signal Processing Letters
ISSN1070-9908
YÖKSİS
OpenAlex
Open access · green
Year2014
Citations7OpenAlex
Citations6Semantic Scholar · 1 influential
Percentile%84.5
FWCI1.01.00 = world average
Scopus (SJR)Q1
WoS (JCR)Q2
Data source split
- YÖKSİSYÖKSİS article record
- YÖKSİS venueIEEE Signal Processing Letters
- Catalog match (ISSN)IEEE Signal Processing Letters
- OpenAlexOpenAlex enrichment (abstract, citations, topics)
- Semantic Scholarcitation count (not merged with OpenAlex)
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.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
7citationsOpenAlex · cited_by_count (cache / database)
2 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).