English

Oversampled Adaptive Sensing

Information Theory 2018-02-12 v1 math.IT

Abstract

We develop a Bayesian framework for sensing which adapts the sensing time and/or basis functions to the instantaneous sensing quality measured in terms of the expected posterior mean-squared error. For sparse Gaussian sources a significant reduction in average sensing time and/or mean-squared error is achieved in comparison to non-adaptive sensing. For compression ratio 3, a sparse 10% Gaussian source and equal average sensing times, the proposed method gains about 2 dB over the performance bound of optimum compressive sensing, about 3 dB over non-adaptive 3-fold oversampled orthogonal sensing and about 6 to 7 dB to LASSO-based recovery schemes while enjoying polynomial time complexity. We utilize that in the presence of Gaussian noise the mean-squared error conditioned on the current observation is proportional to the derivative of the conditional mean estimate with respect to this observation.

Keywords

Cite

@article{arxiv.1802.03056,
  title  = {Oversampled Adaptive Sensing},
  author = {Ralf R. Müller and Ali Bereyhi and Christoph F. Mecklenbräuker},
  journal= {arXiv preprint arXiv:1802.03056},
  year   = {2018}
}

Comments

To be presented at the 2018 Information Theory and Applications Workshop

R2 v1 2026-06-23T00:16:28.943Z