One-bit compressed sensing with partial Gaussian circulant matrices
From MaRDI portal
Abstract: In this paper we consider memoryless one-bit compressed sensing with randomly subsampled Gaussian circulant matrices. We show that in a small sparsity regime and for small enough accuracy , measurements suffice to reconstruct the direction of any -sparse vector up to accuracy via an efficient program. We derive this result by proving that partial Gaussian circulant matrices satisfy an RIP-property. Under a slightly worse dependence on , we establish stability with respect to approximate sparsity, as well as full vector recovery results.
Recommendations
Cited in
(13)- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
- On recovery guarantees for one-bit compressed sensing on manifolds
- Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Quantized compressed sensing for random circulant matrices
- One-bit compressed sensing with non-Gaussian measurements
- Design of an ordered Gaussian circular measurement matrix and analysis of its property
- Sigma Delta Quantization for Images
- A unified approach to uniform signal recovery from nonlinear observations
- Robust one-bit compressed sensing with partial circulant matrices
- Fast Metric Embedding into the Hamming Cube
- Compressed data separation under _p bounded noise
- Tensor recovery from quantized measurements based on modewise operators
This page was built for publication: One-bit compressed sensing with partial Gaussian circulant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006532)