• DocumentCode
    51229
  • Title

    Robust Blind Pairwise Kalman Algorithms Using QR Decompositions

  • Author

    Némesin, Valérian ; Derrode, Stéphane

  • Author_Institution
    Inst. Fresnel, Aix-Marseilles Univ., Marseille, France
  • Volume
    61
  • Issue
    1
  • fYear
    2013
  • fDate
    Jan.1, 2013
  • Firstpage
    5
  • Lastpage
    9
  • Abstract
    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.
  • Keywords
    Gaussian processes; Kalman filters; blind source separation; speech processing; Hong Kong; QR decompositions; pairwise Gaussian models; propagation equations; robust PKF; robust blind pairwise Kalman filter algorithms; time consuming simulations; unsupervised off-lined parameter estimation; Covariance matrix; Equations; Kalman filters; Mathematical model; Robustness; Smoothing methods; Tin; Estimation-maximization; Kalman filter; QR decomposition; pairwise Kalman filter;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/TSP.2012.2222383
  • Filename
    6320702