pith. sign in

arxiv: 1511.05660 · v1 · pith:KAD247MHnew · submitted 2015-11-18 · 📊 stat.ML · cs.IT· math.IT

Bayesian hypothesis testing for one bit compressed sensing with sensing matrix perturbation

classification 📊 stat.ML cs.ITmath.IT
keywords estimatorsensingalgorithmbayesianamplitudebht-mlecompresseddetector
0
0 comments X
read the original abstract

This letter proposes a low-computational Bayesian algorithm for noisy sparse recovery in the context of one bit compressed sensing with sensing matrix perturbation. The proposed algorithm which is called BHT-MLE comprises a sparse support detector and an amplitude estimator. The support detector utilizes Bayesian hypothesis test, while the amplitude estimator uses an ML estimator which is obtained by solving a convex optimization problem. Simulation results show that BHT-MLE algorithm offers more reconstruction accuracy than that of an ML estimator (MLE) at a low computational cost.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.