Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 27 Jan 2020 in cs.IT and math.IT | (2001.09952v2)

Abstract: This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform recovery of all ss-gradient-sparse signals in Rn\mathbb{R}^n is only possible with m≳sn⋅PolyLog(n)m \gtrsim \sqrt{s n} \cdot \text{PolyLog}(n) measurements. Such a condition is especially prohibitive for high-dimensional problems, where ss is much smaller than nn. However, previous empirical findings seem to indicate that this sampling rate does not reflect the typical behavior of total variation minimization. The present work provides a rigorous analysis that breaks the sn\sqrt{s n}-bottleneck for a large class of "natural" signals. The main result shows that non-uniform recovery succeeds with high probability for m≳s⋅PolyLog(n)m \gtrsim s \cdot \text{PolyLog}(n) measurements if the jump discontinuities of the signal vector are sufficiently well separated. In particular, this guarantee allows for signals arising from a discretization of piecewise constant functions defined on an interval. The key ingredient of the proof is a novel upper bound for the associated conic Gaussian mean width, which is based on a signal-dependent, non-dyadic Haar wavelet transform. Furthermore, a natural extension to stable and robust recovery is addressed.

Citations (53)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.