New Algorithms and Improved Guarantees for One-Bit Compressed Sensing on Manifolds

We study the problem of approximately recovering signals on a manifold from one-bit linear measurements drawn from either a Gaussian ensemble, partial circulant ensemble, or bounded orthonormal ensemble and quantized using Σ∆ or distributed noise shaping schemes. We assume we are given a Geometric Multi-Resolution Analysis, which approximates the manifold, and we propose a convex optimization algorithm for signal recovery. We prove an upper bound on the recovery error which outperforms prior works that use memoryless scalar quantization, requires a simpler analysis, and extends the class of measurements beyond Gaussians. Finally, we illustrate our results with numerical experiments.

[1]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[2]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[3]  Mauro Maggioni,et al.  Approximation of Points on Low-Dimensional Manifolds Via Random Linear Projections , 2012, ArXiv.

[4]  C. Sinan Güntürk,et al.  Distributed Noise-Shaping Quantization: I. Beta Duals of Finite Frames and Near-Optimal Quantization of Random Measurements , 2014, ArXiv.

[5]  Rayan Saab,et al.  Sigma delta quantization for compressed sensing , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[6]  M. Maggioni,et al.  Multi-scale geometric methods for data sets II: Geometric Multi-Resolution Analysis , 2012 .

[7]  Yaniv Plan,et al.  One‐Bit Compressed Sensing by Linear Programming , 2011, ArXiv.

[8]  Laurent Jacques,et al.  Quantization and Compressive Sensing , 2014, ArXiv.

[9]  Felix Krahmer,et al.  On Recovery Guarantees for One-Bit Compressed Sensing on Manifolds , 2018, Discrete & Computational Geometry.

[10]  Rongrong Wang,et al.  From Compressed Sensing to Compressed Bit-Streams: Practical Encoders, Tractable Decoders , 2016, IEEE Transactions on Information Theory.

[11]  Laurent Jacques,et al.  Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.

[12]  Rayan Saab,et al.  Quantization for Low-Rank Matrix Recovery , 2017, ArXiv.

[13]  Rayan Saab,et al.  Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices , 2018, Communications on Pure and Applied Mathematics.

[14]  Vivek K. Goyal,et al.  Quantization of overcomplete expansions , 1995, Proceedings DCC '95 Data Compression Conference.