Wavelet-domain hidden Markov model
Model Families AIMech:WaveletHiddenMarkovModel DRAFT
Aliases: Wavelet hidden Markov model, Wavelet-domain HMM
A statistical wavelet-coefficient model family using latent mixture states to represent coefficient distributions and Markov dependencies among those states to capture within-scale clustering or cross-scale persistence.
Identity Notes & Concept Scope
This is the wavelet-domain framework of Crouse, Nowak and Baraniuk, including independent-mixture, within-scale hidden-chain and cross-scale hidden-tree constructions. The independent mixture is its no-dependence special case. The source also discusses richer hidden graphs; a generic family member is not necessarily a sequential HMM or a Bayesian network with the same graph. Generic hidden Markov trees and chains provide structural components, while wavelet coefficients, mixture emissions and scale organization specify this family. A trained parameter instance, a wavelet transform alone, wavelet shrinkage in general and a neural hidden layer are different identities. No normalized identity match was found across all 442 pinned AIO labels and all scoped synonyms and 397 preceding native IDs, names and aliases for these three concepts. Full-checkout fixed-string searches included ignored and hidden files in worktree and main, yielding 12 and 12 matched lines; all 9 unique contents were read. Hits represent citations and discovery leads rather than records of these identities. All 161 semantic label/synonym hits were read. Forty fully annotated exact CLASS nodes and outgoing edges were inspected:24 byte-verified after prior full reading and 16 freshly read. Fifty contextual YAMLs comprise 40 generated and 10 native records:28 byte-verified after prior reading and 22 freshly read. Any truncated display was reread in smaller batches. Short acronyms were included in the complete normalized identity comparison. Absence is bounded to the pin, native collection and inspected semantic neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
Transform a signal into wavelet coefficients W_i and assign each coefficient a finite hidden mixture state S_i. Given all states, the coefficient emissions factor by site. The canonical two-state emission uses zero-mean Gaussian components with a narrow and a wide variance. A hidden chain models within-scale dependence; a hidden tree models parent-to-child persistence across scales. For a rooted tree, p(s,w)=pi(s_root)*product_edges A_child(s_child|s_parent)*product_i N(w_i;mu_i(s_i),v_i(s_i)), with normalized root and transition laws and positive emission variances. Upward subtree likelihoods and a downward pass yield exact node and edge state posteriors for a tree; chains admit the corresponding forward/backward inference. Those expectations support EM updates and optional parameter tying over explicitly selected sites or scales. In the source’s orthonormal-wavelet additive white Gaussian noise model, noise variance adds to each conditional coefficient variance. For zero-mean signal components, the posterior-mean coefficient estimate averages the state-specific gain v_signal/(v_signal+v_noise) times the noisy coefficient using state probabilities conditioned on all observed coefficients in the modeled dependency component.
⚠️ Curated Limitations & Negative Results
- Wavelet decorrelation does not imply independence. Zero-mean conditional Gaussian coefficients can be uncorrelated while their squared magnitudes remain dependent through hidden states. Marginalizing the states does not generally leave an observed Markov process.
- The two zero-mean states and chosen graph are modeling choices, not universal properties of wavelets. More states, nonzero means and alternative emissions are possible. Scaling coefficients may be modeled separately or left unchanged in a particular application. Directed dependence does not establish intervention causality.
- With K states and dense transitions, exact chain/tree message cost is O(edges*K^2). Richer or loopy graphs need separate inference and complexity analysis; linearity in graph size for chordal models also depends on bounded clique and state sizes. Parameter tying imposes equality constraints and requires pooled sufficient statistics with proper normalization.
- Exact EM under suitable model and optimization conditions does not ensure a global likelihood optimum. Empty posterior components, zero transition occupancy, singular Gaussian variances and constrained parameters need explicit handling. The record does not certify an author implementation or fit any parameters.
- Appendix A in the inspected 1997 preprint contains inconsistent parent/child epsilon indices in Equations (19) and(22), a finest/coarsest initialization typo and missing or inconsistent state indices in the downward recursion. This record uses the stated normalized model factorization; an asymmetric three-node finite example verifies consistent messages against complete enumeration rather than copying those displays literally.
- The denoising formula assumes the stated orthonormal transform and independent white Gaussian noise. Subtracting a noise estimate from fitted noisy variances and clipping at zero is a plug-in procedure, not a general constrained-maximum-likelihood theorem. The zero signal-variance boundary is degenerate. Estimated parameters and noise are treated as fixed, rather than integrated out.
- Reported denoising, classification and change-detection examples do not establish universal superiority. Table 1 does not make the tree best for every signal, and selected comparator numbers are imported from other work. Comparing class likelihoods alone assumes the appropriate prior-and-cost threshold is one; unequal priors or costs generally change that threshold.
- The fully inspected source is the 31-page author preprint revised August 1997. The 1998 journal article DOI 10.1109/78.668544 is corroborating bibliographic context, not an assertion that those journal PDF bytes were read. No first-invention date, benchmark reproduction or author-code execution is asserted.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:Model
Model
|
broad_match | The family specifies mathematical probability models of wavelet coefficients using latent mixture states and specified dependency graphs. The pinned Model class is broader than this wavelet-domain family. A BayesianNetwork target would not uniformly preserve graph scope across the richer hidden graphs discussed by the source. |
AIO:ProbabilisticGraphicalModel
Probabilistic Graphical Model
|
related_match | The hidden-state graphs and conditional emissions connect this family to probabilistic graphical modeling. The pinned target is defined as a machine-learning task, so this connection is related rather than an is-a mapping from a model family to a task. |
Evidence Sources & Primary Literature
1 Source| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
Matthew S. Crouse, Robert D. Nowak, Richard G. Baraniuk
|
primary paper
full_text
|
sha256:957ff225f570…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T21:41:53Z
Updated: 2026-10-11T21:43:16Z
Source File:
data/curated/WaveletHiddenMarkovModel.yaml