11 citations · 16 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.IT2018★ 4 cited
Robust one-bit compressed sensing with partial circulant matrices
Sjoerd Dirksen, Shahar Mendelson
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 circu…
cs.IT2018
Non-Gaussian Hyperplane Tessellations and Robust One-Bit Compressed Sensing
Sjoerd Dirksen, Shahar Mendelson
We show that a tessellation generated by a small number of random affine hyperplanes can be used to approximate Euclidean distances between any two points in an arbitrary bounded s…