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

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 algor...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on signal processing Vol. 52; no. 9; pp. 2551 - 2560
Main Authors:	Durand, J.-B., Goncalves, P., Guedon, Y.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.09.2004 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Applied sciences Computer Science Context modeling Equivalence Exact sciences and technology Hidden Markov models Image restoration Image segmentation Information, signal and communications theory Markov processes Mathematical methods Mathematical models Modeling and Simulation Regularity Signal processing algorithms Signal restoration Smoothing methods Telecommunications and information theory Trees Viterbi algorithm Wavelet Wavelet coefficients Wavelet transforms Change detection upward-downward algorithm wavelet decomposition Scaling law hidden Markov tree model Viterbi detection Wavelet transformation hidden state tree restoration Hidden Markov models scaling laws Diagnosis EM algorithm Computing method Signal detection
ISSN:	1053-587X, 1941-0476
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!