DeepAI AI Chat
Log In Sign Up

Robust one-bit compressed sensing with partial circulant matrices

by   Sjoerd Dirksen, et al.
Australian National University

We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly sub-sampled circulant matrix) and is robust to analog pre-quantization noise as well as to adversarial bit corruptions in the quantization process. Our results imply that quantization is not a statistically expensive procedure in the presence of nontrivial analog noise: recovery requires the same sample size one would have needed had the measurement matrix been Gaussian and the noisy analog measurements been given as data.


page 1

page 2

page 3

page 4


Robust one-bit compressed sensing with non-Gaussian measurements

We study memoryless one-bit compressed sensing with non-Gaussian measure...

Superset Technique for Approximate Recovery in One-Bit Compressed Sensing

One-bit compressed sensing (1bCS) is a method of signal acquisition unde...

One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibility

One-bit quantization with time-varying sampling thresholds has recently ...

Asymptotic Frame Theory for Analog Coding

Over-complete systems of vectors, or in short, frames, play the role of ...

AdaBoost and robust one-bit compressed sensing

This paper studies binary classification in robust one-bit compressed se...

Harnessing the Power of Sample Abundance: Theoretical Guarantees and Algorithms for Accelerated One-Bit Sensing

One-bit quantization with time-varying sampling thresholds (also known a...

Robust Dequantized Compressive Sensing

We consider the reconstruction problem in compressed sensing in which th...