Fetching the paper…
Reading the bibliography…
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-sparse signal with band-limit $[-F, F]$.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Herman Chernoff · 1952
Earlier work this paper cites.
An algorithm for the machine calculation of complex fourier series
James W Cooley and John W Tukey · 1965
Earlier work this paper cites.
Information technology - digital compression and coding of continuous - tone still images - requirements and guidelines
ITU · 1992
Earlier work this paper cites.
Image compression using the discrete cosine transform
Andrew B. Watson · 1994
Earlier work this paper cites.
Modern computer algebra
Joachim Von Zur Gathen and Jürgen Gerhard · 1999
Earlier work this paper cites.
Jpeg2000: Image compression fundamentals, standards and practice
Majid Rabbani · 2002
Earlier work this paper cites.
Improved time bounds for near-optimal sparse fourier representations
Anna C Gilbert, Shan Muthukrishnan, and Martin Strauss · 2005
Earlier work this paper cites.
Nikolskii-type inequalities for shift invariant function spaces
Peter Borwein and Tamás Erdélyi · 2006
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
Emmanuel J Candes, Justin K Romberg, and Terence Tao · 2006
Earlier work this paper cites.
Near-optimal signal recovery from random projections: Universal encoding strategies?
Emmanuel J Candes and Terence Tao · 2006
Earlier work this paper cites.
Two turán type inequalities
Géza Kós · 2008
Earlier work this paper cites.
On sparse reconstruction from fourier and gaussian measurements
Mark Rudelson and Roman Vershynin · 2008
Cited alongside, same era.
Efficient sketches for the set query problem
Eric Price · 2011
Cited alongside, same era.
Nearly optimal sparse fourier transform
Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price · 2012
Cited alongside, same era.
Simple and practical algorithm for sparse fourier transform
Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price · 2012
Cited alongside, same era.
Multiplying matrices faster than coppersmith-winograd
Virginia Vassilevska Williams · 2012
Cited alongside, same era.
An improved estimate in the restricted isometry problem
Jean Bourgain · 2014
Cited alongside, same era.
Michael Kapralov · 2016
Later among the works it cites.
The restricted isometry property of subsampled fourier matrices
Ishay Haviv and Oded Regev · 2017
Later among the works it cites.
Sample efficient estimation and recovery in sparse FFT via isolation on average
Michael Kapralov · 2017
Later among the works it cites.
Active regression via linear-sample sparsification
Xue Chen and Eric Price · 2019
Later among the works it cites.
Estimating the frequency of a clustered signal
Xue Chen and Eric Price · 2019
Later among the works it cites.
(nearly) sample-optimal sparse fourier transform in any dimension; ripless and filterless
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sample-optimal Fourier sampling in any constant dimension
Piotr Indyk and Michael Kapralov · 2014
Cited alongside, same era.
(nearly) sample-optimal sparse fourier transform
Piotr Indyk, Michael Kapralov, and Eric Price · 2014
Cited alongside, same era.
Super-resolution, extremal functions and the condition number of vandermonde matrices
Ankur Moitra · 2015
Cited alongside, same era.
A robust sparse Fourier transform in the continuous setting
Eric Price and Zhao Song · 2015
Cited alongside, same era.
Fourier-sparse interpolation without a frequency gap
Xue Chen, Daniel M Kane, Eric Price, and Zhao Song · 2016
Cited alongside, same era.
Essai experimental et analytique: sur les lois de la dilatabilite des fluides elastique et sur celles de la force expansive de la vapeur de l’eau et de la vapeur de l’alkool, a differentes temperatures
Gaspard Riche de Prony
Cited in the paper.
Vasileios Nakos, Zhao Song, and Zhengyu Wang · 2019
Later among the works it cites.
Matrix Theory: Optimization, Concentration and Algorithms
Zhao Song · 2019
Later among the works it cites.
A refined laser method and faster matrix multiplication
Josh Alman and Virginia Vassilevska Williams · 2021
Later among the works it cites.
Sparse fourier transform over lattices: A unified approach to signal reconstruction
Zhao Song, Baocheng Sun, Omri Weinstein, and Ruizhe Zhang · 2022
Closest in time.
Super-resolution and robust sparse continuous fourier transform in any constant dimension: Nearly linear time and sample complexity
Yaonan Jin, Daogao Liu, and Zhao Song · 2023
Closest in time.