In this paper, we introduce a new support recovery algorithm from noisy measurements called Bayesian hypothesis test via belief propagation (BHT-BP). BHT-BP focuses on sparse support recovery rather than sparse signal estimation. The key idea behind BHT-BP is to detect the support set of a sparse vector using hypothesis test where the posterior densities used in the test are obtained by aid of belief propagation (BP). Since BP provides precise posterior information using the noise statistic, BHT-BP can recover the support with robustness against the measurement noise. In addition, BHT-BP has low computational cost compared to the other algorithms by the use of BP. We show the support recovery performance of BHT-BP on the parameters (N; M; K...
Compressive sensing theory has demonstrated that sparse signals can be re-covered from a small numbe...
Abstract-We use the approximate message passing framework (AMP) [1] to address the problem of recove...
We consider the problem of recovering the common support of a set of k-sparse signals {X-i}(i=1)(L) ...
Abstract—In this paper, we propose a sparse recovery al-gorithm called detection-directed (DD) spars...
A novel block Bayesian hypothesis testing algorithm (BBHTA) is presented for reconstructing block-sp...
Abstract—This paper investigates the problem of sparse sup-port detection (SSD) via a detection-orie...
In this paper, we develop a low-complexity message passing algorithm for joint support and signal re...
Image reconstruction based on indirect, noisy, or incomplete data remains an important yet challengi...
This paper concerns message passing based approaches to sparse Bayesian learning (SBL) with a linear...
Solving the inverse problem of compressive sensing in the context of single measurement vector (SMV)...
Abstract—We apply Guo and Wang’s relaxed belief propaga-tion (BP) method to the estimation of a rand...
The field of compressive sensing deals with the recovery of a sparse signal from a small set of me...
This thesis builds upon the problem of sparse signal recovery from the Bayesian standpoint. The adva...
A new framework for the problem of sparse support recovery is proposed, which exploits statistical i...
Abstract—We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tre...
Compressive sensing theory has demonstrated that sparse signals can be re-covered from a small numbe...
Abstract-We use the approximate message passing framework (AMP) [1] to address the problem of recove...
We consider the problem of recovering the common support of a set of k-sparse signals {X-i}(i=1)(L) ...
Abstract—In this paper, we propose a sparse recovery al-gorithm called detection-directed (DD) spars...
A novel block Bayesian hypothesis testing algorithm (BBHTA) is presented for reconstructing block-sp...
Abstract—This paper investigates the problem of sparse sup-port detection (SSD) via a detection-orie...
In this paper, we develop a low-complexity message passing algorithm for joint support and signal re...
Image reconstruction based on indirect, noisy, or incomplete data remains an important yet challengi...
This paper concerns message passing based approaches to sparse Bayesian learning (SBL) with a linear...
Solving the inverse problem of compressive sensing in the context of single measurement vector (SMV)...
Abstract—We apply Guo and Wang’s relaxed belief propaga-tion (BP) method to the estimation of a rand...
The field of compressive sensing deals with the recovery of a sparse signal from a small set of me...
This thesis builds upon the problem of sparse signal recovery from the Bayesian standpoint. The adva...
A new framework for the problem of sparse support recovery is proposed, which exploits statistical i...
Abstract—We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tre...
Compressive sensing theory has demonstrated that sparse signals can be re-covered from a small numbe...
Abstract-We use the approximate message passing framework (AMP) [1] to address the problem of recove...
We consider the problem of recovering the common support of a set of k-sparse signals {X-i}(i=1)(L) ...