{'fraction_non_alphanumeric': 0.020451339915373765, 'fraction_numerical': 0.0021156558533145277, 'mean_word_length': 5.306666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Total variation minimization for stable multidimensional signal recovery

Consider the problem of reconstructing a multidimensional signal from partial information. Without any additional assumptions, this problem is ill-posed. However, for signals such as natural images or movies, the minimal total variation estimate consistent with the measurements often produces a good approximation to the underlying signal, even if the number of measurements is far smaller than the ambient dimensionality. While reconstruction guarantees and optimal measurement designs have been established for related l1-minimization problems, the theory for total variation minimization has remained elusive until recently, when guarantees for two-dimensional images x ∈ C N 2 were established. This paper extends the recent theoretical results to signals x ∈ C N d of arbitrary dimension d ≥ 2. To be precise, we show that a multidimensional signal x ∈ C N d can be reconstructed from O(sdlog(N d )) linear measurements y = Ax using total variation minimization to within a factor of the best s-term approximation of its gradient. The reconstruction guarantees we provide are necessarily optimal up to polynomial factors in the spatial dimension d and a logarithmic factor in the signal dimension N d . The proof relies on bounds in approximation theory concerning the compressibility of wavelet expansions of bounded-variation functions.