liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Bayesian Bhattacharyya bound for discrete-time filtering revisited
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-3270-171X
2017 (English)In: Proc. of 2017 IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2017, p. 719-723Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, the derivation of the Bayesian Bhattacharyya bound for discrete-time filtering as proposed ina paper by Reece and Nicholson is revisited. It turns out that the results presented in the aforementioned contribution are incorrect, as some expectations appearing in the information matrix recursions are missing. This paper gives a generalized derivation of the N-th order Bayesian Bhattacharyya bound and presents corrected expressions for the case N = 2. A nonlinear toy example is used to illustrate the results

Place, publisher, year, edition, pages
2017. p. 719-723
Keywords [en]
Bhattacharyya bound, nonlinear filtering, mean square error inequality
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:liu:diva-144022DOI: 10.1109/CAMSAP.2017.8313201ISI: 000428438100145ISBN: 9781538612514 (electronic)ISBN: 9781538612507 (electronic)ISBN: 9781538612521 (electronic)OAI: oai:DiVA.org:liu-144022DiVA, id: diva2:1170435
Conference
2017 IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), Curacao, Dutch Antilles, Dec. 10-13, 2017
Funder
ELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsAvailable from: 2018-01-03 Created: 2018-01-03 Last updated: 2018-06-11Bibliographically approved

Open Access in DiVA

Bayesian Bhattacharyya bound for discrete-time filtering revisited(299 kB)8 downloads
File information
File name FULLTEXT01.pdfFile size 299 kBChecksum SHA-512
8fdc2a68ad856e6e4f40ac2d5f57ba11f9a4168b34f1740a459e408153a155e7e372c8caa0904d33b62fd40989f7d4016958e03c2c211cbdb28c841ff0ab55ff
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Fritsche, CarstenGustafsson, Fredrik

Search in DiVA

By author/editor
Fritsche, CarstenGustafsson, Fredrik
By organisation
Automatic ControlFaculty of Science & Engineering
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 8 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 61 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf