Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Tomer Peleg, Yonina C. Eldar, Michael Elad

TL;DR
This paper introduces a Bayesian model for sparse signal recovery that accounts for dependencies between atoms using a Boltzmann machine, leading to improved denoising performance on natural image patches.
Contribution
It develops a statistical dependency model for sparse representations, proposes greedy and exact algorithms for signal recovery, and introduces a parameter learning scheme for adaptive denoising.
Findings
Enhanced denoising performance on natural images
Efficient message passing algorithm for structured dictionaries
Adaptive parameter learning improves recovery accuracy
Abstract
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in which the signal is assumed to be generated as a combination of a few atoms from a given dictionary. In this work we consider a Bayesian setting and go beyond the classic assumption of independence between the atoms. The main goal of this paper is to introduce a statistical model that takes such dependencies into account and show how this model can be used for sparse signal recovery. We follow the suggestion of two recent works and assume that the sparsity pattern is modeled by a Boltzmann machine, a commonly used graphical model. For general dependency models, exact MAP and MMSE estimation of the sparse representation becomes computationally complex. To simplify the computations, we propose greedy…
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.
