Author
Listed:
- Badong Chen
(National Engineering Research Center for Visual Information and Applications, and Institute of Artificial Intelligence and Robotics, Xi’an Jiaotong University, National Key Laboratory of Human-Machine Hybrid Augmented Intelligence)
- Lujuan Dang
(National Engineering Research Center for Visual Information and Applications, and Institute of Artificial Intelligence and Robotics, Xi’an Jiaotong University, National Key Laboratory of Human-Machine Hybrid Augmented Intelligence)
- Nanning Zheng
(National Engineering Research Center for Visual Information and Applications, and Institute of Artificial Intelligence and Robotics, Xi’an Jiaotong University, National Key Laboratory of Human-Machine Hybrid Augmented Intelligence)
- Jose C. Principe
(University of Florida, Electrical and Computer Engineering Department)
Abstract
Generally, the traditional Kalman filter (KF) is derived under the well-known minimum mean square error (MMSE) criterion, which is optimal under the Gaussian assumption. However, when the signals are non-Gaussian, especially when the system is disturbed by some heavy-tailed impulsive noises, the performance of KF will deteriorate seriously. To improve the robustness of KF to non-Gaussian noises, several robust Kalman filters are derived in this chapter based on a batch-regression model presented in Chap. 2 and information theoretic criteria in Chap. 3. The first is the maximum correntropy Kalman filter (MCKF), which is developed based on the maximum correntropy criterion (MCC) and a fixed-point iterative algorithm. Some other approaches for MCC-based Kalman filtering are also briefly presented. To further improve the performance of MCKF, a Kalman filter algorithm based on the generalized maximum correntropy criterion (GMCKF) is also derived. The GMCKF is more general and flexible, which includes the MCKF with Gaussian kernel as a special case. In addition, to better deal with more complicated non-Gaussian noises such as noises from multimodal distributions, the minimum error entropy Kalman filter (MEE-KF) is also developed in this chapter, by using MEE criterion.
Suggested Citation
Badong Chen & Lujuan Dang & Nanning Zheng & Jose C. Principe, 2023.
"Kalman Filtering Under Information Theoretic Criteria,"
Springer Books, in: Kalman Filtering Under Information Theoretic Criteria, chapter 0, pages 89-126,
Springer.
Handle:
RePEc:spr:sprchp:978-3-031-33764-2_4
DOI: 10.1007/978-3-031-33764-2_4
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-031-33764-2_4. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.