We give an algorithm for ℓ 2/ℓ 2 sparse recovery from Fourier measurements using O (k log
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …

We consider the problem of computing ak-sparse approximation to the Fourier transform of a
length N signal. Our main result is a randomized algorithm for computing such an …

We revisit the classical problem of band-limited signal reconstruction--a variant of the\emph
{Set Query} problem--which asks to efficiently reconstruct (a subset of) a $ d $-dimensional …

We consider the problem of estimating a Fourier-sparse signal from noisy samples, where
the sampling is done over some interval [0, T] and the frequencies can be" off-grid". Previous …

In recent years, a number of works have studied methods for computing the Fourier
transform in sublinear time if the output is sparse. Most of these have focused on the discrete …

We design a sublinear Fourier sampling algorithm for a case of sparse off-grid frequency
recovery. These are signals with the form f (t)= ∑ _ j= 1^ k a_j e^ i ω _j t+ ∫ ν (ω) e^ i ω td μ …

(MATH) We give an algorithm for finding a Fourier representation R of B terms for a given
discrete signal signal A of length N, such that ‖\signal-\repn‖_2^2 is within the factor (1+ ε) …

This paper proves best known guarantees for exact reconstruction of a sparse signal f from
few non-adaptive universal linear measurements. We consider Fourier measurements …

An approximate sparse recovery system in ℓ1 norm makes a small number of measurements
of a noisy vector with at most k large entries and recovers those heavy hitters approximately …

We study the problem of interpolating a noisy Fourier-sparse signal in the time duration 0,T
from noisy samples in the same range, where the ground truth signal can be any k-Fourier …