Computational Methods for Hidden Markov Tree Models—An Application to Wavelet Trees

DOI10.1109/TSP.2004.832006MaRDI QIDQ5354150zbMATH OpenFDO

Authors

Publication date 8 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2004.832006

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• scientific article; zbMATH DE number 1774275
• Wavelet transformation on hidden Markov models
• An \textit{EM} algorithm for the model fitting of Markovian binary trees
• Tree wavelet approximations with applications
• Implementation of a Markov model for phylogenetic trees
• Analyzing Markov random fields using t-cherry junction tree structures
• scientific article; zbMATH DE number 2219571

Cited in

(4)

• Localizing the latent structure canonical uncertainty: entropy profiles for hidden Markov models
• Minimum classification error learning for sequential data in the wavelet domain
• Asymptotic properties of the maximum likelihood estimator for hidden Markov models indexed by binary trees
• Denoising and recognition using hidden Markov models with observation distributions modeled by hidden Markov trees

This page was built for publication: Computational Methods for Hidden Markov Tree Models—An Application to Wavelet Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354150)