Binary Sparse Bayesian Learning Algorithm for One-bit Compressed Sensing

05/08/2018
by   Jiang Zhu, et al.
0

In this letter, a binary sparse Bayesian learning (BSBL) algorithm is proposed to slove the one-bit compressed sensing (CS) problem in both single measurement vector (SMV) and multiple measurement vectors (MMVs). By utilising the Bussgang-like decomposition, the one-bit CS problem can be approximated as a standard linear model. Consequently, the standard SBL algorithm can be naturally incorporated. Numerical results demonstrate the effectiveness of the BSBL algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2016

Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks

This letter proposes a sparse diffusion steepest-descent algorithm for o...
research
08/18/2019

Greedy Algorithms for Hybrid Compressed Sensing

Compressed sensing (CS) is a technique which uses fewer measurements tha...
research
04/10/2019

Compressed sensing reconstruction using Expectation Propagation

Many interesting problems in fields ranging from telecommunications to c...
research
11/18/2015

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

This letter proposes a low-computational Bayesian algorithm for noisy sp...
research
05/05/2021

AdaBoost and robust one-bit compressed sensing

This paper studies binary classification in robust one-bit compressed se...
research
11/25/2017

Multivariate Copula Spatial Dependency in One Bit Compressed Sensing

In this letter, the problem of sparse signal reconstruction from one bit...
research
10/22/2017

An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory

In this paper, the problem of one-bit compressed sensing (OBCS) is formu...

Please sign up or login with your details

Forgot password? Click here to reset