English
Related papers

Related papers: Effective support, Dirac combs, and signal recover…

200 papers

Let $G$ be a finite abelian group. Let $f: G \to {\mathbb C}$ be a signal (i.e. function). The classical uncertainty principle asserts that the product of the size of the support of $f$ and its Fourier transform $\hat f$, $\text{supp}(f)$…

Classical Analysis and ODEs · Mathematics 2023-11-09 Alex Iosevich , Azita Mayeli

Signal recovery from incomplete or partial frequency information is a fundamental problem in harmonic analysis and applied mathematics, with wide-ranging applications in communications, imaging, and data science. Historically, the classical…

We present a novel probabilistic framework for the recovery of discrete signals with missing data, extending classical Fourier-based methods. While prior results, such as those of Donoho and Stark; see also Logan's method, guarantee exact…

This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal $f \in \C^N$ and a randomly chosen set of frequencies $\Omega$ of mean size $\tau N$. Is it possible to…

Numerical Analysis · Mathematics 2007-05-23 Emmanuel Candes , Justin Romberg , Terence Tao

In the work of Donoho and Stark, they study a manifestation of the uncertainty principle in signal recovery. They conjecture that, for a function with support of bounded size T, the maximum concentration of its Fourier transform in the low…

Functional Analysis · Mathematics 2023-07-11 Oriol Baeza-Guasch

We consider the problem of recovering a compactly-supported function from a finite collection of pointwise samples of its Fourier transform taking nonuniformly. First, we show that under suitable conditions on the sampling frequencies -…

Numerical Analysis · Mathematics 2014-04-08 Ben Adcock , Milana Gataric , Anders C. Hansen

Given a signal $f:G\to\mathbb{C}$, where $G$ is a finite abelian group, under what reasonable assumptions can we guarantee the exact recovery of $f$ from a proper subset of its Fourier coefficients? In 1989, Donoho and Stark established a…

Classical Analysis and ODEs · Mathematics 2025-04-22 K. Aldahleh , A. Iosevich , J. Iosevich , J. Jaimangal , A. Mayeli , S. Pack

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

A classical result due to Agranovsky and Narayanan (\cite{AN04}) says that if the support of the Fourier transform of $f: {\mathbb R}^n \to {\mathbb C}$ is carried by a smooth measure on a $d$-dimensional manifold $M$, and $f \in…

Classical Analysis and ODEs · Mathematics 2025-08-19 P. Bhowmik , S. Deodhar , A. Iosevich

The classical Shannon sampling theorem states that a signal f with Fourier transform F in L^2(R) having its support contained in (-\pi,\pi) can be recovered from the sequence of samples (f(n))_{n in Z} via f(t)=\sum_{n in Z} f(n) (sin(\pi…

Functional Analysis · Mathematics 2013-04-25 Amol Sasane

We analyze signal recovery when samples are taken concomitantly from a signal and its Fourier transform. This two-sided sampling framework extends classical one-sided reconstruction and is particularly useful when measurements in either…

Signal Processing · Electrical Eng. & Systems 2026-03-18 Mert Kayaalp , Oleg Szehr

In this paper, we derive a new reconstruction method for real non-harmonic Fourier sums, i.e., real signals which can be represented as sparse exponential sums of the form $f(t) = \sum_{j=1}^{K} \gamma_{j} \, \cos(2\pi a_{j} t + b_{j})$,…

Numerical Analysis · Mathematics 2020-11-30 Markus Petz , Gerlind Plonka , Nadiia Derevianko

One-bit compressed sensing (1bCS) addresses the recovery of sparse signals from highly quantized measurements, retaining only the sign of each linear measurement. In the support recovery setting, the goal is to identify $\text{supp}(x)$,…

Information Theory · Computer Science 2026-04-14 Xiaxin Li , Arya Mazumdar

We study the support recovery problem for a high-dimensional signal observed with additive noise. With suitable parametrization of the signal sparsity and magnitude of its non-zero components, we characterize a phase-transition phenomenon…

Statistics Theory · Mathematics 2019-04-16 Zheng Gao , Stilian Stoev

We study generative compressed sensing when the measurement matrix is randomly subsampled from a unitary matrix (with the DFT as an important special case). It was recently shown that $\textit{O}(kdn\| \boldsymbol{\alpha}\|_{\infty}^{2})$…

Information Theory · Computer Science 2023-11-21 Aaron Berk , Simone Brugiapaglia , Yaniv Plan , Matthew Scott , Xia Sheng , Ozgur Yilmaz

We prove a result on approximate recovery, with high probability, of subgroups of a finite nonabelian group $\Gamma$ from their random perturbations. We use this for ad-hoc sequences of $\Gamma_n$ while passing to the continuum limit, in…

Probability · Mathematics 2023-08-16 Mircea Petrache , Rodolfo Viera

The generalized phase retrieval problem over compact groups aims to recover a set of matrices -- representing an unknown signal -- from their associated Gram matrices. This framework generalizes the classical phase retrieval problem, which…

Signal Processing · Electrical Eng. & Systems 2025-11-20 Tal Amir , Tamir Bendory , Nadav Dym , Dan Edidin

In this paper, we consider the problem of recovering a compactly supported multivariate function from a collection of pointwise samples of its Fourier transform taken nonuniformly. We do this by using the concept of weighted Fourier frames.…

Numerical Analysis · Mathematics 2015-09-08 Ben Adcock , Milana Gataric , Anders C. Hansen

We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary.…

Information Theory · Computer Science 2011-12-08 Christoph Studer , Patrick Kuppinger , Graeme Pope , Helmut Bölcskei

In this note we show that stable recovery of complex-valued signals $x\in\mathbb{C}^n$ up to global sign can be achieved from the magnitudes of $4n-1$ Fourier measurements when a certain "symmetrization and zero-padding" is performed before…

Information Theory · Computer Science 2013-10-23 Philipp Walk , Peter Jung
‹ Prev 1 2 3 10 Next ›