z-logo
Premium
Adaptive kernels in approximate filtering of state‐space models
Author(s) -
Dedecius Kamil
Publication year - 2017
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.2739
Subject(s) - particle filter , weighting , computer science , kernel (algebra) , algorithm , state space , bayesian probability , conditional probability distribution , similarity (geometry) , auxiliary particle filter , probability density function , mathematics , artificial intelligence , data mining , kalman filter , statistics , ensemble kalman filter , discrete mathematics , medicine , extended kalman filter , image (mathematics) , radiology
Summary Standard Bayesian algorithms used for online filtering of states of hidden Markov models from noisy measurements assume an accurate knowledge of the measurement model in the form of a conditional probability density function. However, this knowledge is often unreachable in practice, and the used models are more or less misspecified, or it is too complex, making the resulting models intractable. This paper focuses on these issues from the particle filtering perspective. It adopts the principles of the approximate Bayesian filtering, where the particle weights are based on the (dis)similarity of the true measurements and the pseudo‐measurements obtained by plugging the state particles directly into the measurement equation. Specifically, a new robust method for online tuning of the weighting kernel is proposed. Copyright © 2016 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here