4.7 Article

Sparse Reconstruction Using Distribution Agnostic Bayesian Matching Pursuit

期刊

IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 61, 期 21, 页码 5298-5309

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2013.2278814

关键词

Basis selection; Bayesian; compressed sensing; greedy algorithm; linear regression; matching pursuit; minimum mean-square error (MMSE) estimate; sparse reconstruction

资金

  1. Office of Competitive Research (OCRF) at King Abdullah University of Science and Technology (KAUST) [CRG\_R2\_13\_ALOU\_KAUST\_2]
  2. King Abdulaziz City for Science and Technology (KACST) through the Science & Technology Unit at King Fahd University of Petroleum & Minerals (KFUPM) [09-ELE763-04]
  3. National Science, Technology and Innovation Plan

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据