A Max-Product EM Algorithm for Reconstructing Markov-tree Sparse Signals from Compressive Samples
Zhao Song, Aleksandar Dogandzic

TL;DR
This paper introduces a Bayesian EM algorithm utilizing belief propagation for reconstructing Markov-tree sparse signals from underdetermined linear measurements, effectively modeling signal structure and noise variance.
Contribution
It presents a novel EM-based reconstruction method that combines belief propagation with Markov-tree models for improved sparse signal recovery from compressive samples.
Findings
Outperforms existing methods in signal reconstruction accuracy.
Effectively models hierarchical signal structures.
Demonstrates robustness to noise in experiments.
Abstract
We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tree sparse signals via belief propagation. The measurements follow an underdetermined linear model where the regression-coefficient vector is the sum of an unknown approximately sparse signal and a zero-mean white Gaussian noise with an unknown variance. The signal is composed of large- and small-magnitude components identified by binary state variables whose probabilistic dependence structure is described by a Markov tree. Gaussian priors are assigned to the signal coefficients given their state variables and the Jeffreys' noninformative prior is assigned to the noise variance. Our signal reconstruction scheme is based on an EM iteration that aims at maximizing the posterior distribution of the signal and its state variables given the noise variance. We construct the missing data for the EM…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
