Fast Kalman Filter

The fast Kalman filter (FKF), devised by Antti Lange (born 1941), is an extension of the Helmert–Wolf blocking (HWB) method from geodesy to safety-critical real-time applications of Kalman filtering (KF) such as GNSS navigation up to the centimeter-level of accuracy and
satellite imaging of the Earth including atmospheric tomography.

Motivation

Kalman filters are an important filtering technique for building fault-tolerance into a wide range of systems, including real-time imaging.
The ordinary Kalman filter is an optimal filtering algorithm for linear systems. However, an optimal Kalman filter is not stable (i.e. reliable) if Kalman's observability and controllability conditions are not continuously satisfied. These conditions are very challenging to maintain for any larger system. This means that even optimal Kalman filters may start diverging towards false solutions. Fortunately, the stability of an optimal Kalman filter can be controlled by monitoring its error variances if only these can be reliably estimated (e.g. by MINQUE). Their precise computation is, however, much more demanding than the optimal Kalman filtering itself. The FKF computing method often provides the required speed-up also in this respect.

Optimum calibration

Calibration parameters are a typical example of those state parameters that may create serious observability problems if a narrow window of data (i.e. too few measurements) is continuously used by a Kalman filter. Observing instruments onboard orbiting satellites gives an example of optimal Kalman filtering where their calibration is done indirectly on ground. There may also exist other state parameters that are hardly or not at all observable if too small samples of data are processed at a time by any sort of a Kalman filter.

Inverse problem

The computing load of the inverse problem of an ordinary Kalman recursion is roughly proportional to the cube of the number of the measurements processed simultaneously. This number can always be set to 1 by processing each scalar measurement independently and (if necessary) performing a simple pre-filtering algorithm to de-correlate these measurements. However, for any large and complex system this pre-filtering may need the HWB computing. Any continued use of a too narrow window of input data weakens observability of the calibration parameters and, in the long run, this may lead to serious controllability problems totally unacceptable in safety-critical applications.

Even when many measurements are processed simultaneously, it is not unusual that the linearized equation system becomes sparse, because some measurements turn out to be independent of some state or calibration parameters.
In problems of Satellite Geodesy, the computing load of the HWB (and FKF) method is roughly proportional to the square of the total number of the state and calibration parameters only and not of the measurements that are billions.

Reliable solution

Reliable operational Kalman filtering requires continuous fusion of data in real-time. Its optimality depends essentially on the use of exact variances and covariances between all measurements and the estimated state and calibration parameters. This large error covariance matrix is obtained by matrix inversion from the respective system of Normal Equations. Its coefficient matrix is usually sparse and the exact solution of all the estimated parameters can be computed by using the HWB (and FKF) method. The optimal solution may also be obtained by Gauss elimination using other sparse-matrix techniques or some iterative methods based e.g. on Variational Calculus.
However, these latter methods may solve the large matrix of all the error variances and covariances only approximately and the data fusion would not be performed in a strictly optimal fashion. Consequently, the long-term stability of Kalman filtering becomes uncertain even if Kalman's observability and controllability conditions were permanently satisfied.

Description

The Fast Kalman filter applies only to systems with sparse matrices, since HWB is an inversion method to solve sparse linear equations (Wolf, 1978).

The sparse coefficient matrix to be inverted may often have either a bordered block- or band-diagonal (BBD) structure. If it is band-diagonal it can be transformed into a block-diagonal form e.g. by means of a generalized Canonical Correlation Analysis (gCCA).

Such a large matrix can thus be most effectively inverted in a blockwise manner by using the following
analytic inversion formula:
:$\begin A & B \\ C & D \end^ = \begin A^+A^B(D-CA^B)^CA^ & -A^B(D-CA^B)^ \\ -(D-CA^B)^CA^ & (D-CA^B)^ \end$
of Frobenius where
:$A =$ a large block- or band-diagonal (BD) matrix to be easily inverted, and,
:$(D-CA^B) =$ a much smaller matrix called the Schur complement of $A$.

This is the FKF method that may make it computationally possible to estimate a much larger number of state and calibration parameters than an ordinary Kalman recursion can do. Their operational accuracies may also be reliably estimated from the theory of Minimum-Norm Quadratic Unbiased Estimation (MINQUE) of C. R. Rao and used for controlling the stability of this optimal fast Kalman filtering.

Applications

The FKF method extends the very high accuracies of Satellite Geodesy to Virtual Reference Station (VRS) Real Time Kinematic (RTK) surveying, mobile positioning and ultra-reliable navigation. First important applications will be real-time optimum calibration of global observing systems in Meteorology, Geophysics, Astronomy etc.

For example, a Numerical Weather Prediction (NWP) system can now forecast observations with confidence intervals and their operational quality control can thus be improved. A sudden increase of uncertainty in predicting observations would indicate that important observations are missing (observability problem) or an unpredictable change of weather is taking place (controllability problem). Remote sensing and imaging from satellites are partly based on forecasted information. Controlling stability of the feedback between these forecasts and the satellite images requires a sensor fusion technique that is both fast and robust, which the FKF fulfills.

The computational advantage of FKF is marginal for applications using only small amounts of data in real-time. Therefore, improved built-in calibration and data communication infrastructures need to be developed first and introduced to public use before personal gadgets and machine-to-machine devices can make the best out of FKF.

References

External links

BBD
- software


- formulas


- formulas


- formulas
* There are other Fast Kalman Algorithms designed for special signal processing purposes, see e.g
Stabilizing the Fast Kalman Algorithms
on IEEE Xplore
Kalman filter recipes for real-time image processing

{{DEFAULTSORT:Fast Kalman Filter
Signal estimation
Linear filters