Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Variational Bayesian Approximations Kalman Filter Based on Threshold Judgment (2309.02789v2)

Published 6 Sep 2023 in eess.SY, cs.SY, and eess.SP

Abstract: The estimation of non-Gaussian measurement noise models is a significant challenge across various fields. In practical applications, it often faces challenges due to the large number of parameters and high computational complexity. This paper proposes a threshold-based Kalman filtering approach for online estimation of noise parameters in non-Gaussian measurement noise models. This method uses a certain amount of sample data to infer the variance threshold of observation parameters and employs variational Bayesian estimation to obtain corresponding noise variance estimates, enabling subsequent iterations of the Kalman filtering algorithm. Finally, we evaluate the performance of this algorithm through simulation experiments, demonstrating its accurate and effective estimation of state and noise parameters.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. R. E. Kalman, “A new approach to linear filtering and prediction problems,” Journal of Basic Engineering, vol. 82D, pp. 35–45, 1960.
  2. D Middleton, “Non-gaussian noise models in signal processing for telecommunications: new methods an results for class a and class b noise models,” Information Theory IEEE Transactions on, vol. 45, no. 4, pp. 1129–1149, 1999.
  3. Matthew James. Beal, “Variational algorithms for approximate bayesian inference /,” Phd Thesis University of London, 2003.
  4. S. Sarkka and A. Nummenmaa, “Recursive noise adaptive kalman filtering by variational bayesian approximations,” IEEE Transactions on Automatic Control, vol. 54, no. 3, pp. 596–600, 2009.
  5. “Performance analysis of kalman filter as an equalizer in a non-gaussian environment,” in 2022 IEEE Integrated STEM Education Conference (ISEC), 2022, pp. 433–438.
  6. “Bridging the ensemble kalman filter and particle filters: the adaptive gaussian mixture filter,” Computational Geosciences, 2010.
  7. “A background-impulse kalman filter with non-gaussian measurement noises.,” IEEE Trans. Syst. Man Cybern. Syst., April 2023.
  8. A. P. Dempster, “Maximum likelihood from incomplete data via the em algorithm,” Journal of the Royal Statistical Society, vol. 39, 1977.
  9. “Maximum correntropy kalman filter,” AUTOMATICA, vol. 76, pp. 70–77, 2017.
  10. “Complex-valued adaptive networks based on entropy estimation,” Signal Processing, vol. 149, pp. 124–134, 2018.
  11. “Projected kernel recursive maximum correntropy,” Circuits and Systems II: Express Briefs, IEEE Transactions on, pp. 1–1, 2017.
  12. “Gaussian state estimation with non-gaussian measurement noise,” in 2018 Sensor Data Fusion: Trends, Solutions, Applications (SDF), 2018, pp. 1–5.
  13. “Consensus of multi-agent systems with faults and mismatches under switched topologies using a delta operator method,” Neurocomputing, vol. 315, no. NOV.13, pp. 198–209, 2018.
  14. “An efficient semi-blind source extraction algorithm and its applications to biomedical signal extraction,” Science in China Series F: Information Sciences, vol. 52, no. 10, pp. 1863–1874, 2009.
  15. Akaike and H., “A new look at the statistical model identification.,” IEEE Transactions on Automatic Control, vol. 19, no. 6, pp. 716–723, 1974.
  16. “Distributed minimum error entropy kalman filter,” Information Fusion, vol. 91, pp. 556–565, 2023.
  17. “Generalized minimum error entropy for robust learning,” Pattern Recognition, vol. 135, pp. 109188, 2023.
  18. “Switching criterion for sub-and super-gaussian additive noise in adaptive filtering,” Signal Processing, vol. 150, no. SEP., pp. 166–170, 2018.

Summary

We haven't generated a summary for this paper yet.