Statistical Inference for Hidden Markov Tree Models and Application to Wavelet Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Statistical Inference for Hidden Markov Tree Models and Application to Wavelet Trees

Abstract

The hidden Markov tree model was introduced by Crouse, Nowak and Baraniuk (1998) for modeling non-independent, non-Gaussian wavelet transform coefficien- ts. In their article, they developed an inductive algorithm, called «upward-do- wnward» algorithm, for likelihood computation. They also introduced Expectatio- n Maximization algorithms for likelihood maximization. These algorithms are subject to the same numerical limitations as the «forward-backward» procedure for hidden Markov chains. In this report, we develop efficient variants of the «upward-downward» and EM algorithms, inspired by Devijver's «conditional forward-backward» recursion (1985). Thus, the inference algorithm- s limitations for hidden Markov trees are considerably reduced. Moreover, as the hidden states restoration problem has no known solution for hidden Markov trees, we present the MAP algorithm for this model. The interest of those algorithms is illustrated by an application to signal processing.
Fichier principal
Vignette du fichier
RR-4248.pdf (355.1 Ko) Télécharger le fichier

Dates and versions

inria-00072339 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072339 , version 1

Cite

Jean-Baptiste Durand, Paulo Gonçalves. Statistical Inference for Hidden Markov Tree Models and Application to Wavelet Trees. [Research Report] RR-4248, INRIA. 2001. ⟨inria-00072339⟩
156 View
225 Download

Share

Gmail Facebook X LinkedIn More