Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
From MaRDI portal
Abstract: The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is an inverse relationship between the achievable sampling rate and the bit depth. In this paper, we investigate an alternative CS approach that shifts the emphasis from the sampling rate to the number of bits per measurement. In particular, we explore the extreme case of 1-bit CS measurements, which capture just their sign. Our results come in two flavors. First, we consider ideal reconstruction from noiseless 1-bit measurements and provide a lower bound on the best achievable reconstruction error. We also demonstrate that i.i.d. random Gaussian matrices describe measurement mappings achieving, with overwhelming probability, nearly optimal error decay. Next, we consider reconstruction robustness to measurement errors and noise and introduce the Binary -Stable Embedding (BSE) property, which characterizes the robustness measurement process to sign changes. We show the same class of matrices that provide almost optimal noiseless performance also enable such a robust mapping. On the practical side, we introduce the Binary Iterative Hard Thresholding (BIHT) algorithm for signal reconstruction from 1-bit measurements that offers state-of-the-art performance.
Cited in
(69)- Sparse recovery from inaccurate saturated measurements
- Sigma delta quantization with harmonic frames and partial Fourier ensembles
- Compressive sensing based sampling and reconstruction for wireless sensor array network
- Fast binary embeddings with Gaussian circulant matrices: improved bounds
- On recovery guarantees for one-bit compressed sensing on manifolds
- Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
- Memoryless scalar quantization for random frames
- Sparse classification: a scalable discrete optimization perspective
- AdaBoost and robust one-bit compressed sensing
- Information theory and recovery algorithms for data fusion in Earth observation
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Covariance estimation under one-bit quantization
- Phase retrieval by binary questions: which complementary subspace is closer?
- Bipolar measurement matrix using chaotic sequence
- Dimension reduction by random hyperplane tessellations
- Joint image compression-encryption scheme using entropy coding and compressive sensing
- Binary vectors for fast distance and similarity estimation
- Quantization of compressive samples with stable and robust recovery
- One-bit compressed sensing with non-Gaussian measurements
- Generalized notions of sparsity and restricted isometry property. II: Applications
- On the number of faces and radii of cells induced by Gaussian spherical tessellations
- Estimation in high dimensions: a geometric perspective
- One-bit compressed sensing by linear programming
- Error bounds for consistent reconstruction: random polytopes and coverage processes
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Quantized compressed sensing: a survey
- Classification scheme for binary data with extensions
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Quantization and compressive sensing
- Sparse recovery from saturated measurements
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- Representation and coding of signal geometry
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- High-dimensional estimation with geometric constraints
- Simple classification using binary data
- An approach to one-bit compressed sensing based on probably approximately correct learning theory
- scientific article; zbMATH DE number 7255152 (Why is no real title available?)
- One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- A theoretical perspective on hyperdimensional computing
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
- Endpoint results for Fourier integral operators on noncompact symmetric spaces
- On the atomic decomposition of coorbit spaces with non-integrable kernel
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- One-bit sensing, discrepancy and Stolarsky's principle
- A survey on compressive sensing: classical results and recent advancements
- Iteratively consistent one-bit phase retrieval
- One-bit gridless DOA estimation with multiple measurements exploiting accelerated proximal gradient algorithm
- Sigma Delta Quantization for Images
- A unified approach to uniform signal recovery from nonlinear observations
- Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
- Fast Metric Embedding into the Hamming Cube
- Just least squares: binary compressive sampling with low generative intrinsic dimension
- Democracy in action: quantization, saturation, and compressive sensing
- Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors
- Theoretical guarantees for low-rank compression of deep neural networks
- Tensor recovery from quantized measurements based on modewise operators
- Robust decoding from binary measurements with cardinality constraint least squares
- Noise-robust one-bit diffraction tomography and optimal dose fractionation
- Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
- Optimality conditions and gradient descent Newton pursuit for 0/1-loss and sparsity constrained optimization
- Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing
- Tight bounds for maximum _1-margin classifiers
- Robust tensor completion from uniformly dithered one-bit observations
- Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function
- A resolution of the Gaussian hyperplane tessellation conjecture on the sphere
- Robust instance optimal phase-only compressed sensing
- Tsallis entropy penalized robust 1-bit compressive sensing against sign flips
- Noisy 1-bit compressive sensing: models and algorithms
This page was built for publication: Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989301)
