On Recovery Guarantees for One-Bit Compressed Sensing on Manifolds

07/17/2018
by   Mark A. Iwen, et al.
0

This paper studies the problem of recovering a signal from one-bit compressed sensing measurements under a manifold model; that is, assuming that the signal lies on or near a manifold of low intrinsic dimension. We provide a convex recovery method based on the Geometric Multi-Resolution Analysis and prove recovery guarantees with a near-optimal scaling in the intrinsic manifold dimension. Our method is the first tractable algorithm with such guarantees for this setting. The results are complemented by numerical experiments confirming the validity of our approach.

READ FULL TEXT
research
02/11/2019

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

We study the problem of approximately recovering signals on a manifold f...
research
06/19/2015

Enhanced Lasso Recovery on Graph

This work aims at recovering signals that are sparse on graphs. Compress...
research
04/13/2020

Analysis of The Ratio of ℓ_1 and ℓ_2 Norms in Compressed Sensing

We first propose a novel criterion that guarantees that an s-sparse sign...
research
07/07/2020

One-Bit Compressed Sensing via One-Shot Hard Thresholding

This paper concerns the problem of 1-bit compressed sensing, where the g...
research
09/02/2020

Thermal Source Localization Through Infinite-Dimensional Compressed Sensing

We propose a scheme utilizing ideas from infinite dimensional compressed...
research
09/21/2020

Optimal Stable Nonlinear Approximation

While it is well known that nonlinear methods of approximation can often...

Please sign up or login with your details

Forgot password? Click here to reset