Abstract
A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data if not available. The method utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean-square error (MMSE) estimate of the sparse signal. Simulation results demonstrate the power and robustness of our proposed estimator.
| Original language | English |
|---|---|
| Article number | 6581876 |
| Pages (from-to) | 5298-5309 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 61 |
| Issue number | 21 |
| DOIs | |
| State | Published - 2013 |
Keywords
- Basis selection
- Bayesian
- compressed sensing
- greedy algorithm
- linear regression
- matching pursuit
- minimum mean-square error (MMSE) estimate
- sparse reconstruction
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering