Sampling Rates for ℓ^1-Synthesis

by   Maximilian März, et al.

This work investigates the problem of signal recovery from undersampled noisy sub-Gaussian measurements under the assumption of a synthesis-based sparsity model. Solving the ℓ^1-synthesis basis pursuit allows for a simultaneous estimation of a coefficient representation as well as the sought-for signal. However, due to linear dependencies within redundant dictionary atoms it might be impossible to identify a specific representation vector, although the actual signal is still successfully recovered. The present manuscript studies both estimation problems from a non-uniform, signal-dependent perspective. By utilizing recent results on the convex geometry of linear inverse problems, the sampling rates describing the phase transitions of each formulation are identified. In both cases, they are given by the conic Gaussian mean width of an ℓ^1-descent cone that is linearly transformed by the dictionary. In general, this expression does not allow a simple calculation by following the polarity-based approach commonly found in the literature. Hence, two upper bounds involving the sparsity of coefficient representations are provided: The first one is based on a local condition number and the second one on a geometric analysis that makes use of the thinness of high-dimensional polyhedral cones with not too many generators. It is furthermore revealed that both recovery problems can differ dramatically with respect to robustness to measurement noise – a fact that seems to have gone unnoticed in most of the related literature. All insights are carefully undermined by numerical simulations.


page 3

page 19

page 31


Dictionary and prior learning with unrolled algorithms for unsupervised inverse problems

Inverse problems consist in recovering a signal given noisy observations...

Compressed Sensing with 1D Total Variation: Breaking Sample Complexity Barriers via Non-Uniform Recovery

This paper investigates total variation minimization in one spatial dime...

Dictionary LASSO: Guaranteed Sparse Recovery under Linear Transformation

We consider the following signal recovery problem: given a measurement m...

Phase Retrieval via Polytope Optimization: Geometry, Phase Transitions, and New Algorithms

We study algorithms for solving quadratic systems of equations based on ...

Convex Reconstruction of Structured Matrix Signals from Linear Measurements (I): Theoretical Results

We investigate the problem of reconstructing n-by-n structured matrix si...

Close Encounters of the Binary Kind: Signal Reconstruction Guarantees for Compressive Hadamard Sampling with Haar Wavelet Basis

We investigate the problems of 1-D and 2-D signal recovery from subsampl...

Inverse Models for Estimating the Initial Condition of Spatio-Temporal Advection-Diffusion Processes

Inverse problems involve making inference about unknown parameters of a ...

Please sign up or login with your details

Forgot password? Click here to reset