One-bit compressed sensing with non-Gaussian measurements

DOI10.1016/J.LAA.2013.04.002zbMATH Open1332.94041arXiv1208.6279OpenAlexW2068693086MaRDI QIDQ2437341FDOQ2437341

Authors: Albert Ai, Alex Lapanowski, Y. Plan, Roman Vershynin 

Publication date: 3 March 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to standard compressed sensing, these results are not extendable to natural non-Gaussian distributions without further assumptions, as can be demonstrated by simple counter-examples. We show that approximately sparse signals that are not extremely sparse can be accurately reconstructed from single-bit measurements sampled according to a sub-gaussian distribution, and the reconstruction comes as the solution to a convex program.

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

Recommendations

• One-bit compressed sensing by linear programming
• One-bit compressive sensing of dictionary-sparse signals
• One-bit compressed sensing with partial Gaussian circulant matrices
• Bayesian signal reconstruction for 1-bit compressed sensing
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method

zbMATH Keywords

convex programmingquantizationsignal reconstructionone-bit compressed sensing

Mathematics Subject Classification ID

Convex programming (90C25) Estimation in multivariate analysis (62H12) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Geometric probability and stochastic geometry (60D05) Sampling theory in information and communication theory (94A20)

Cites Work

• Title not available (Why is that?)
• The concentration of measure phenomenon
• Title not available (Why is that?)
• One-bit compressed sensing by linear programming
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Random matrices: The distribution of the smallest singular values
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach

Cited In (38)

• One-bit compressed sensing by greedy algorithms
• Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• Finite sample performance of linear least squares estimation
• Robust one-bit compressed sensing with partial circulant matrices
• Bayesian signal reconstruction for 1-bit compressed sensing
• Statistical mechanics analysis of thresholding 1-bit compressed sensing
• Quantization and compressive sensing
• Sigma delta quantization with harmonic frames and partial Fourier ensembles
• One-bit compressive sensing of dictionary-sparse signals
• On recovery guarantees for one-bit compressed sensing on manifolds
• A unified approach to uniform signal recovery from nonlinear observations
• Fast and reliable parameter estimation from nonlinear observations
• High-dimensional index volatility models via Stein's identity
• On fast decoding of high-dimensional signals from one-bit measurements
• On some aspects of recovery of sparse signals in high dimensions from nonlinear measurements using compressed sensing
• Analysis of hard-thresholding for distributed compressed sensing with one-bit measurements
• Phase retrieval by binary questions: which complementary subspace is closer?
• Convergence guarantee for the sparse monotone single index model
• Quantized compressed sensing: a survey
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• Robust 1-bit compressed sensing via hinge loss minimization
• NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
• Generic error bounds for the generalized Lasso with sub-exponential data
• Memoryless scalar quantization for random frames
• Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
• An approach to one-bit compressed sensing based on probably approximately correct learning theory
• Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
• One-bit compressed sensing with partial Gaussian circulant matrices
• A theory of capacity and sparse neural encoding
• One-bit compressed sensing by linear programming
• Non-Gaussian observations in nonlinear compressed sensing via Stein discrepancies
• The landscape of empirical risk for nonconvex losses
• Sparse recovery from saturated measurements
• Estimation in high dimensions: a geometric perspective
• High-dimensional estimation with geometric constraints
• Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
• AdaBoost and robust one-bit compressed sensing

This page was built for publication: One-bit compressed sensing with non-Gaussian measurements

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