An Introduction to the Kalman Filter
Greg WelchGary Bishop
Explains the mechanics of discrete and extended Kalman filters by pairing accessible mathematical derivations with a concrete, step-by-step numerical example.
The document introduces the Kalman filter as a practical computational tool for estimating the state of a process from noisy measurements. First published in 1960, the method gained wide use in navigation and control once digital computers made recursive calculations routine. The core challenge it addresses is estimating unknown quantities in real time when only incomplete or noisy observations are available and when running a full batch solution on all past data is impractical.
The authors set out to supply a clear, self-contained derivation and explanation of the basic discrete Kalman filter, its extension to nonlinear problems, and a worked numerical example that shows how the equations behave.
They derive the filter from the goal of minimizing posterior error covariance, present the resulting time-update and measurement-update equations in matrix form, and illustrate their use on a simple scalar problem of estimating a fixed random voltage from fifty noisy readings. The same structure is then generalized to the extended Kalman filter by linearizing the process and measurement models with Jacobian matrices at each step.
The analysis shows that the filter converges reliably once the measurement-noise covariance R is known and the process-noise covariance Q is chosen to reflect model uncertainty. In the example, setting R to its true value produced an estimate whose variance settled near 0.0002 after fifty steps; increasing R by a factor of one hundred slowed response and reduced estimate variance, while decreasing R had the opposite effect. The extended form preserves the same predictor-corrector cycle but approximates optimality through local linearization.
These results matter because the recursive structure allows real-time state estimation on modest hardware without storing or reprocessing all prior data, a decisive advantage for autonomous navigation, tracking, and sensor fusion. Proper tuning of Q and R directly trades off tracking speed against smoothness, giving designers explicit control over performance.
The paper recommends measuring R from off-line samples of the sensor, selecting Q to inject realistic process uncertainty, and, when dynamics change, allowing Q to vary during operation. For strongly nonlinear problems the extended filter remains usable, yet users should verify observability; divergence occurs quickly if measurements do not adequately constrain the state. Further work is advisable to test the filter on the target hardware with actual sensor statistics before deployment.
The derivations rest on assumptions of Gaussian white noise and either linear or locally linear models. The single scalar example is deliberately simple; performance on higher-dimensional or poorly observable systems is not demonstrated. The authors note that the extended filter is an approximation whose error statistics are no longer exactly Gaussian after nonlinear transformations.
- Book: Introduction to Probability, Charles M. Grinstead et al. (1997). Mastering the rules of probability and random variables from this textbook is essential for understanding the stochastic noise models underpinning the discrete Kalman filter.
- Book: Mathematics for Machine Learning, Garrett Thomas. A firm grasp of matrix operations, orthogonal projections, and linear transformations from this linear algebra review is required to follow the algebraic derivations of the Kalman update equations.
No sufficiently relevant recommendations were found.
