Paper Info
Title
Robust one-bit compressed sensing with partial circulant matrices.
Abstract
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.
Year
Venue
DocType
2018
arXiv: Information Theory
Journal
Volume
Citations 
PageRank 
abs/1812.06719
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Sjoerd Dirksen1322.75
Shahar Mendelson227031.53