One-bit compressive sensing of dictionary-sparse signals

DOI10.1093/IMAIAI/IAX009MaRDI QIDQ5229762zbMATH OpenOpenAlexFDO

Authors Richard G. Baraniuk, Simon Foucart, D. Needell, Mary Wootters, Y. Plan

Publication date 19 August 2019

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

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

zbMATH Keywords

compressive sensingconvex optimizationone-bit compressive sensingquantizationthresholdingtight frames

Mathematics Subject Classification ID

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

Abstract: One-bit compressive sensing has extended the scope of sparse recovery by showing that sparse signals can be accurately reconstructed even when their linear measurements are subject to the extreme quantization scenario of binary samples---only the sign of each linear measurement is maintained. Existing results in one-bit compressive sensing rely on the assumption that the signals of interest are sparse in some fixed orthonormal basis. However, in most practical applications, signals are sparse with respect to an overcomplete dictionary, rather than a basis. There has already been a surge of activity to obtain recovery guarantees under such a generalized sparsity model in the classical compressive sensing setting. Here, we extend the one-bit framework to this important model, providing a unified theory of one-bit compressive sensing under dictionary sparsity. Specifically, we analyze several different algorithms---based on convex programming and on hard thresholding---and show that, under natural assumptions on the sensing matrix (satisfied by Gaussian matrices), these algorithms can efficiently recover analysis-dictionary-sparse signals in the one-bit model.

Recommendations

• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• One-bit compressed sensing with non-Gaussian measurements
• One-bit compressed sensing by linear programming
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• Noisy 1-bit compressive sensing: models and algorithms

Cited in

(22)

• On recovery guarantees for one-bit compressed sensing on manifolds
• Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
• AdaBoost and robust one-bit compressed sensing
• New challenges in covariance estimation: multiple structures and coarse quantization
• Stability of 1-bit compressed sensing in sparse data reconstruction
• One-bit compressed sensing with non-Gaussian measurements
• One-bit compressed sensing by linear programming
• Quantized compressed sensing: a survey
• Statistical mechanics approach to 1-bit compressed sensing
• Bayesian signal reconstruction for 1-bit compressed sensing
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• Quantization and compressive sensing
• Sparse recovery from saturated measurements
• 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
• Analysis of hard-thresholding for distributed compressed sensing with one-bit measurements
• On fast decoding of high-dimensional signals from one-bit measurements
• One-bit compressed sensing by greedy algorithms
• Robust decoding from binary measurements with cardinality constraint least squares
• Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements
• Noisy 1-bit compressive sensing: models and algorithms

This page was built for publication: One-bit compressive sensing of dictionary-sparse signals

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