Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors
Authors:
- 17 October 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
In 1-bit compressive sensing, each measurement is quantized to a single bit, namely the sign of a linear function of an unknown vector, and the goal is to accurately recover the vector. While it is most popular to assume a standard Gaussian sensing matrix for 1-bit compressive sensing, using structured sensing matrices such as partial Gaussian circulant matrices is of significant practical importance due to their faster matrix operations. In this paper, we provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing with partial Gaussian circulant matrices (with random column sign flips) under a generative prior, where the signal to estimate is assumed to belong to the range of a Lipschitz continuous generative model with bounded inputs. Under suitable assumptions, we match guarantees that were previously only known to hold for i.i.d. Gaussian matrices that require significantly more computation.Keywords
All Related Versions
Funding Information
- National Research Foundation
- Ministry of Education
This publication has 26 references indexed in Scilit:
- Limits on Support Recovery With Probabilistic Models: An Information-Theoretic FrameworkIEEE Transactions on Information Theory, 2016
- One-Bit Compressive Sensing With Norm EstimationIEEE Transactions on Information Theory, 2016
- Living on the edge: phase transitions in convex programs with random dataInformation and Inference: A Journal of the IMA, 2014
- One-bit compressed sensing with non-Gaussian measurementsLinear Algebra and its Applications, 2014
- How well can we estimate a sparse vector?Applied and Computational Harmonic Analysis, 2013
- A variant of the Johnson–Lindenstrauss lemma for circulant matricesJournal of Functional Analysis, 2011
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)IEEE Transactions on Information Theory, 2009
- Compressive Sensing by Random ConvolutionSIAM Journal on Imaging Sciences, 2009
- 1-Bit compressive sensing2008
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random VariablesThe Annals of Mathematical Statistics, 1971