Skip to Main content Skip to Navigation
Journal articles

Computational methods for hidden Markov tree models - An application to wavelet trees.

Abstract : The hidden Markov tree models were introduced by Crouse et al. in 1998 for modeling nonindependent, non-Gaussian wavelet transform coefficients. In their paper, they developed the equivalent of the forward-backward algorithm for hidden Markov tree models and called it the 'upward-downward algorithm'. This algorithm is subject to the same numerical limitations as the forward-backward algorithm for hidden Markov chains (HMCs). In this paper, adapting the ideas of Devijver from 1985, we propose a new 'upward-downward' algorithm, which is a true smoothing algorithm and is immune to numerical underflow. Furthermore, we propose a Viterbi-like algorithm for global restoration of the hidden state tree. The contribution of those algorithms as diagnosis tools is illustrated through the modeling of statistical dependencies between wavelet coefficients with a special emphasis on local regularity changes.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00830078
Contributor : Christophe Godin <>
Submitted on : Tuesday, June 4, 2013 - 1:48:21 PM
Last modification on : Saturday, September 11, 2021 - 3:17:06 AM
Long-term archiving on: : Thursday, September 5, 2013 - 4:22:04 AM

File

hmt.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Baptiste Durand, Paulo Goncalvès, Yann Guédon. Computational methods for hidden Markov tree models - An application to wavelet trees.. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2004, 52 (9), pp.2551-2560. ⟨10.1109/TSP.2004.832006⟩. ⟨hal-00830078⟩

Share

Metrics

Record views

1088

Files downloads

1876