Kalman Filter - Information Filter

Information Filter

In the information filter, or inverse covariance filter, the estimated covariance and estimated state are replaced by the information matrix and information vector respectively. These are defined as:

Similarly the predicted covariance and state have equivalent information forms, defined as:

as have the measurement covariance and measurement vector, which are defined as:

The information update now becomes a trivial sum.

The main advantage of the information filter is that N measurements can be filtered at each timestep simply by summing their information matrices and vectors.

To predict the information filter the information matrix and vector can be converted back to their state space equivalents, or alternatively the information space prediction can be used.

$\textbf{M}_{k} = ^{\text{T}} \textbf{Y}_{k-1|k-1} \textbf{F}_{k}^{-1}$

$\textbf{C}_{k} = \textbf{M}_{k} ^{-1}$

$\textbf{L}_{k} = I - \textbf{C}_{k}$

$\textbf{Y}_{k|k-1} = \textbf{L}_{k} \textbf{M}_{k} \textbf{L}_{k}^{\text{T}} + \textbf{C}_{k} \textbf{Q}_{k}^{-1} \textbf{C}_{k}^{\text{T}}$

$\hat{\textbf{y}}_{k|k-1} = \textbf{L}_{k} ^{\text{T}}\hat{\textbf{y}}_{k-1|k-1}$

Note that if F and Q are time invariant these values can be cached. Note also that F and Q need to be invertible.

Read more about this topic: Kalman Filter

Famous quotes containing the word information:

“Computers are good at swift, accurate computation and at storing great masses of information. The brain, on the other hand, is not as efficient a number cruncher and its memory is often highly fallible; a basic inexactness is built into its design. The brain’s strong point is its flexibility. It is unsurpassed at making shrewd guesses and at grasping the total meaning of information presented to it.”
—Jeremy Campbell (b. 1931)