Related papers: Quantitative Robust Uncertainty Principles and Opt…
Learning optimal dictionaries for sparse coding has exposed characteristic sparse features of many natural signals. However, universal guarantees of the stability of such features in the presence of noise are lacking. Here, we provide very…
We consider the rate-distortion function for lossy source compression, as well as the channel capacity for error correction, through the lens of distributional robustness. We assume that the distribution of the source or of the additive…
This article introduces a new signal analysis method, which can be interpreted as a principal component analysis in sparse decomposition of the signal. The method, called principal basis analysis, is based on a novel criterion:…
Decoded Quantum Interferometry (DQI) is a recently proposed quantum optimization algorithm that exploits sparsity in the Fourier spectrum of objective functions, with the potential for exponential speedups over classical algorithms on…
For the additive white Gaussian noise channel with average codeword power constraint, new coding methods are devised in which the codewords are sparse superpositions, that is, linear combinations of subsets of vectors from a given design,…
We prove that the weak-$L^{p}$ norms, and in fact the sparse $(p,1)$-norms, of the Carleson maximal partial Fourier sum operator are $\lesssim (p-1)^{-1}$ as $p\to 1^+$. This is an improvement on the Carleson-Hunt theorem, where the same…
Blind deconvolution is a ubiquitous problem of recovering two unknown signals from their convolution. Unfortunately, this is an ill-posed problem in general. This paper focuses on the {\em short and sparse} blind deconvolution problem,…
This paper studies the problem of robust signal detection in Gaussian noise under quadratically convex orthosymmetric (QCO) constraints. We consider a minimax testing framework where the signal belongs to a QCO set and is separated from…
The standard quadratic optimization problem (StQP), i.e. the problem of minimizing a quadratic form $\bold x^TQ\bold x$ on the standard simplex $\{\bold x\ge\bold 0: \bold x^T\bold e=1\}$, is studied. The StQP arises in numerous…
The theory of Compressed Sensing (CS) asserts that an unknown signal $x\in\mathbb{R}^p$ can be accurately recovered from an underdetermined set of $n$ linear measurements with $n\ll p$, provided that $x$ is sufficiently sparse. However, in…
We construct global-in-time singular dynamics for the (renormalized) cubic fourth order nonlinear Schr\"odinger equation on the circle, having the white noise measure as an invariant measure. For this purpose, we introduce the…
Let $f: {\mathbb Z}_N^d \to {\mathbb C}$ be a signal with the Fourier transform $\widehat{f}: \Bbb Z_N^d\to \Bbb C$. A classical result due to Matolcsi and Szucs (\cite{MS73}), and, independently, to Donoho and Stark (\cite{DS89}) states if…
This paper extends the sample complexity theory for ill-posed inverse problems developed in a recent work by the authors [`Compressed sensing for inverse problems and the sample complexity of the sparse Radon transform', J. Eur. Math. Soc.,…
We introduce a continuous analog of the Fourier ratio for compactly supported Borel measures. For a measure \(\mu\) on \(\mathbb{R}^d\) and \(f\in L^2(\mu)\), the Fourier ratio compares \(L^1\) and \(L^2\) norms of a regularized Fourier…
The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system. Super-resolution is a class of techniques that can enhance the resolution of an imaging system and even…
This note complements the paper "The quest for optimal sampling: Computationally efficient, structure-exploiting measurements for compressed sensing" [2]. Its purpose is to present a proof of a result stated therein concerning the recovery…
This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…
For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…
We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…
The three dimensional cubic defocusing nonlinear wave equation is known to be ill-posed for general low regularity initial data. However, well-posedness can be recovered globally in time on a probabilistic level when considering random…