Title: Graphical Kalman Filter
Author(s): Boxian Dong, Thomas Burgess, Hans-Bernd Neuner
Published in: Proceedings of IEEE/ION PLANS 2018
April 23 - 26, 2018
Hyatt Regency Hotel
Monterey, CA
Pages: 234 - 245
Cite this article: Dong, Boxian, Burgess, Thomas, Neuner, Hans-Bernd, "Graphical Kalman Filter," Proceedings of IEEE/ION PLANS 2018, Monterey, CA, April 2018, pp. 234-245.
Full Paper: ION Members/Non-Members: 1 Download Credit
Sign In
Abstract: The Extended Kalman Filter is a proven method for efficient Markov Chain inference. It is ubiquitous in indoor localization applications, and typically applied to combine relative motion with absolute positioning. However, an unmodified Extended Kalman Filter struggles to handle common problems in indoor applications. For instance, the presence of large and hard to estimate noise terms, large correlated outliers, and other non-linear effects. Typically, these problems necessitates the introduction of large smoothing propagation errors to ensure stability and to avoid converging on false results. As a result, the memory of the filter rapidly decays so that estimates only are influenced by the last few observations. This work introduces the Graphic Model Kalman Filter. It combines an Adaptive Kalman Filter with a probabilistic Graphical Model. In the filter, the adaptive component uses historical data to dynamically estimate observation and propagation uncertainty. Earlier and later states around a target state are predicted by the filter, and the relations between predictions and each observation are used to form the graphical model. The Kalman update step is then replaced by an optimization of the graphical model, which improves trajectory smoothness as well as robustness to outliers. Extensive simulations are used to show that this design outperforms regular Extended or Adaptive Kalman Filters.