Abstract

The estimation of an unobservable process, x, from an observed process, y, is often performed in the framework of hidden Markov models (HMM). In the linear Gaussian case, the classical recursive solution is given by the Kalman filter. On the other hand, particle filters are Monte Carlo based methods which provide approximate solutions in more complex situations. We consider pairwise Markov models (PMM) by assuming that the pair (x, y) is Markovian. We show that this model is strictly more general than the HMM, and yet still enables particle filtering.

Full Text

Submitted Version (Free)

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.