By Topic

Robust Blind Pairwise Kalman Algorithms Using QR Decompositions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nemesin, V. ; Inst. Fresnel, Aix-Marseilles Univ., Marseille, France ; Derrode, S.

The Pairwise Kalman Filter (PKF) [W. Pieczynski and F. Desbouvries, “Kalman Filtering Using Pairwise Gaussian Models,” in Proc. Int. Conf. Acoust., Speech, Signal Process. (ICASSP), Hong Kong, Apr. 2003] is an extension of the classical Kalman filter that keeps propagation equations explicit, i.e. it does not require time consuming simulations. The contribution of this note is twofold. First, new robust equations for filtering, smoothing and unsupervised off-lined parameters estimation based on QR decompositions are presented. Second, since the model is over-parametrized, we give a simple condition to uniquely characterize a filter of interest when the dimension of observations is equal to the dimension of states. Unsupervised experiments based on simulated data confirm the nice behavior of the robust PKF, even for a limited number of observations.

Published in:

Signal Processing, IEEE Transactions on  (Volume:61 ,  Issue: 1 )