Structure-Based Bayesian Sparse Reconstruction

DOI10.1109/TSP.2012.2215029MaRDI QIDQ4574187zbMATH OpenOpenAlexDBLPWikidataFDO

Authors A. A. Quadeer, Tareq Y. Al-Naffouri

Publication date 18 July 2018

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

Full work available at URL https://arxiv.org/abs/1207.3847

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11)

Abstract: Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical information (Gaussian or otherwise) to obtain near optimal estimates. In addition, we make use of the rich structure of the sensing matrix encountered in many signal processing applications to develop a fast sparse recovery algorithm. The computational complexity of the proposed algorithm is relatively low compared with the widely used convex relaxation methods as well as greedy matching pursuit techniques, especially at a low sparsity rate.

Recommendations

• Generalized Sparse Bayesian Learning and Application to Image Reconstruction
• Hierarchical Bayesian Sparse Image Reconstruction With Application to MRFM
• Sparse Bayesian learning approach for discrete signal reconstruction
• Sparse Reconstruction by Separable Approximation
• Simultaneous Bayesian Sparse Approximation With Structured Sparse Models
• Sparsity-promoting Bayesian inversion
• On the Bayesian approach to image reconstruction
• Sequential Bayesian Sparse Signal Reconstruction Using Array Data
• Sparse structure selection and estimation

This page was built for publication: Structure-Based Bayesian Sparse Reconstruction

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