Kalman filtering in pairwise Markov trees

Research output: Contribution to journalArticlepeer-review

Abstract

An important problem in multiresolution analysis of signals or images consists in estimating hidden random variables x={xs}s∈S from observed ones y={ys}s∈S. This is done classically in the context of hidden Markov trees (HMT). HMT have been extended recently to the more general context of pairwise Markov trees (PMT). In this note, we propose an adaptive filtering algorithm which is an extension to PMT of the Kalman filter (KF).

Original languageEnglish
Pages (from-to)1049-1054
Number of pages6
JournalSignal Processing
Volume86
Issue number5
DOIs
Publication statusPublished - 1 Jan 2006

Keywords

  • Hidden Markov trees
  • Kalman filtering
  • Multiresolution signal and image analysis
  • Multiscale algorithms
  • Pairwise Markov trees

Fingerprint

Dive into the research topics of 'Kalman filtering in pairwise Markov trees'. Together they form a unique fingerprint.

Cite this