One-Bit Compressive Sensing With Norm Estimation

DOI10.1109/TIT.2016.2527637MaRDI QIDQ2976862zbMATH OpenFDO

Authors Karin Knudson, Rayan Saab, Rachel Ward

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.6853

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Consider the recovery of an unknown signal $x$ from quantized linear measurements. In the one-bit compressive sensing setting, one typically assumes that $x$ is sparse, and that the measurements are of the form $operatornamesign(langle{a}_i,xangle)inpm1$. Since such measurements give no information on the norm of $x$, recovery methods from such measurements typically assume that $|x{|}_2=1$. We show that if one allows more generally for quantized affine measurements of the form $operatornamesign(langle{a}_i,xangle+b_i)$, and if the vectors $a_i$ are random, an appropriate choice of the affine shifts $b_i$ allows norm recovery to be easily incorporated into existing methods for one-bit compressive sensing. Additionally, we show that for arbitrary fixed $x$ in the annulus $rleq|x{|}_{2}leqR$, one may estimate the norm $|x{|}_2$ up to additive error $delta$ from $mgtrsim{R}^4{r}^{-2}delt{a}^{-2}$ such binary measurements through a single evaluation of the inverse Gaussian error function. Finally, all of our recovery guarantees can be made universal over sparse vectors, in the sense that with high probability, one set of measurements and thresholds can successfully estimate all sparse vectors $x$ within a Euclidean ball of known radius.

Cited in

(27)

• Sigma delta quantization with harmonic frames and partial Fourier ensembles
• Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
• A sparse signal reconstruction algorithm in wireless sensor networks
• Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
• A unified identification algorithm of FIR systems based on binary observations with time-varying thresholds
• AdaBoost and robust one-bit compressed sensing
• New challenges in covariance estimation: multiple structures and coarse quantization
• Covariance estimation under one-bit quantization
• The stochastic geometry of unconstrained one-bit data compression
• Joint image compression-encryption scheme using entropy coding and compressive sensing
• Quantization of compressive samples with stable and robust recovery
• 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
• Flavors of compressive sensing
• An approach to one-bit compressed sensing based on probably approximately correct learning theory
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• 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
• A unified approach to uniform signal recovery from nonlinear observations
• Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
• Signal Reconstruction from Phase-Only Measurements: Uniqueness Condition, Minimal Measurement Number and Beyond
• Robust decoding from binary measurements with cardinality constraint least squares
• Recursive projected filter algorithm with binary-valued observations
• Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing
• Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function

This page was built for publication: One-Bit Compressive Sensing With Norm Estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976862)