On recovery guarantees for one-bit compressed sensing on manifolds

DOI10.1007/s00454-020-00267-zzbMath1462.94013arXiv1807.06490OpenAlexW3153846036MaRDI QIDQ2022611

Johannes Maly, Felix Krahmer, Sara Krause-Solberg, Mark A. Iwen

Publication date: 29 April 2021

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

digital representationcompressed sensingone-bit quantizationmanifold datageometric multi-resolution analysis

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Modulation and demodulation in information and communication theory (94A14)

Related Items (2)

On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary ⋮ One-bit sigma-delta modulation on the circle

Uses Software

• MNIST
• PhaseLift
• Fashion-MNIST

Cites Work

• Unnamed Item
• Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
• Fast subspace approximation via greedy least-squares
• Second-order sigma-delta (\(\Sigma \Delta\)) quantization of finite frame expansions
• Random projections of smooth manifolds
• Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
• Dimension reduction by random hyperplane tessellations
• Quantized compressed sensing for random circulant matrices
• New analysis of manifold embeddings and signal recovery from compressive measurements
• Quantization of compressive samples with stable and robust recovery
• One-bit compressed sensing with non-Gaussian measurements
• Multiscale Dictionary Learning: Non-Asymptotic Bounds and Robustness
• A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• One-Bit Compressed Sensing by Linear Programming
• V.N. Sudakov’s Work on Expected Suprema of Gaussian Processes
• Blind Deconvolution Using Convex Programming
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Curvature Measures
• Quantization and Compressive Sensing
• Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Oversampled Sigma-Delta Modulation
• Quantization on the Grassmann Manifold
• Low-Complexity Massive MIMO Subspace Estimation and Tracking From Low-Dimensional Projections
• High-Dimensional Probability
• Robust Recovery of Signals From a Structured Union of Subspaces
• Approximation of points on low-dimensional manifolds via random linear projections
• One-bit compressed sensing with partial Gaussian circulant matrices
• Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing
• Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices
• Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: On recovery guarantees for one-bit compressed sensing on manifolds