We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing structured approximately
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 hidden Markov tree (HMT).
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 employ
a max-product algorithm to implement the maximization (M) step of our EM iteration. The noise variance is
a regularization parameter that controls signal sparsity. We select the noise variance so that the corresponding
estimated signal and state variables (obtained upon convergence of the EM iteration) have the largest marginal
posterior distribution. Our numerical examples show that the proposed algorithm achieves better reconstruction
performance compared with the state-of-the-art methods.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.