English
Related papers

Related papers: A Local Fourier Slice Theorem

200 papers

We study the impact of sampling theorems on the fidelity of sparse image reconstruction on the sphere. We discuss how a reduction in the number of samples required to represent all information content of a band-limited signal acts to…

Information Theory · Computer Science 2013-04-17 J. D. McEwen , G. Puy , J. -Ph. Thiran , P. Vandergheynst , D. Van De Ville , Y. Wiaux

Signal processing on graph is attracting more and more attentions. For a graph signal in the low-frequency subspace, the missing data associated with unsampled vertices can be reconstructed through the sampled data by exploiting the…

Information Theory · Computer Science 2015-06-23 Xiaohan Wang , Pengfei Liu , Yuantao Gu

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…

Functional Analysis · Mathematics 2014-06-17 Ben Adcock , Anders C. Hansen , Bogdan Roman

In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…

Numerical Analysis · Mathematics 2020-06-24 Lutz Kämmerer , Felix Krahmer , Toni Volkmer

In this paper we analyze two-dimensional wavelet reconstructions from Fourier samples within the framework of generalized sampling. For this, we consider both separable compactly-supported wavelets and boundary wavelets. We prove that the…

Functional Analysis · Mathematics 2014-03-25 Ben Adcock , Anders C. Hansen , Gitta Kutyniok , Jackie Ma

Recently, it has been shown that incoherence is an unrealistic assumption for compressed sensing when applied to many inverse problems. Instead, the key property that permits efficient recovery in such problems is so-called local…

Information Theory · Computer Science 2015-07-09 Alex D. Jones , Ben Adcock , Anders C. Hansen

A generalized sampling theorem for frequency localized signals is presented. The generalization in the proposed model of sampling is twofold: (1) It applies to various prefilters effecting a "soft" bandlimitation, (2) an approximate…

Information Theory · Computer Science 2009-08-30 Edwin Hammerich

In analogy with steerable wavelets, we present a general construction of adaptable tight wavelet frames, with an emphasis on scaling operations. In particular, the derived wavelets can be "dilated" by a procedure comparable to the operation…

Computer Vision and Pattern Recognition · Computer Science 2017-06-20 Zsuzsanna Püspöki , John Paul Ward , Daniel Sage , Michael Unser

In this paper we study the general reconstruction of a compactly supported function from its Fourier coefficients using compactly supported shearlet systems. We assume that only finitely many Fourier samples of the function are accessible…

Functional Analysis · Mathematics 2015-07-31 Jackie Ma

We describe S2LET, a fast and robust implementation of the scale-discretised wavelet transform on the sphere. Wavelets are constructed through a tiling of the harmonic line and can be used to probe spatially localised, scale-depended…

Information Theory · Computer Science 2013-10-29 B. Leistedt , J. D. McEwen , P. Vandergheynst , Y. Wiaux

We give a proof of Fourier extension conjecture on the paraboloid in all dimensions bigger than 2 that begins with a decomposition suggested in Sawyer [Saw8] of writing a smooth Alpert projection as a sum of pieces whose Fourier extensions…

Classical Analysis and ODEs · Mathematics 2026-05-19 Cristian Rios , Eric T. Sawyer

The special affine Fourier transform (SAFT) is a promising tool for analyzing non-stationary signals with more degrees of freedom. However, the SAFT fails in obtaining the local features of non-transient signals due to its global kernel and…

Functional Analysis · Mathematics 2020-06-11 Firdous A. Shah , Azhar Y. Tantary , Aajaz A. Teali

For any given set $E\subset [1,2]$, we discuss a fractal frequency-localized version of the $L^p$ local smoothing estimates for the half-wave propagator with times in $E$. A conjecture is formulated in terms of a quantity involving the…

Classical Analysis and ODEs · Mathematics 2026-01-09 David Beltran , Joris Roos , Alex Rutar , Andreas Seeger

We propose a patchwise local Fourier extension method for approximating smooth functions on general two dimensional domains with curved boundaries. The domain is embedded into a Cartesian background grid and decomposed into rectangular…

Numerical Analysis · Mathematics 2026-05-12 Zhenyu Zhao , Yanfei Wang

In this paper an approach for decreasing the computational effort required for the split-step Fourier method (SSFM) is introduced. It is shown that using the sparsity property of the simulated signals, the compressive sampling algorithm can…

Computational Physics · Physics 2015-12-15 Cihan Bayindir

Synchronization of coupled oscillators is observed at multiple levels of neural systems, and has been shown to play an important function in visual perception. We propose a computing system based on locally coupled oscillator networks for…

Computer Vision and Pattern Recognition · Computer Science 2014-09-24 Yan Fang , Matthew J. Cotter , Donald M. Chiarulli , Steven P. Levitan

We introduce a new multi-dimensional nonlinear embedding -- Piecewise Flat Embedding (PFE) -- for image segmentation. Based on the theory of sparse signal recovery, piecewise flat embedding with diverse channels attempts to recover a…

Computer Vision and Pattern Recognition · Computer Science 2018-08-13 Chaowei Fang , Zicheng Liao , Yizhou Yu

We introduce a new method of Bayesian wavelet shrinkage for reconstructing a signal when we observe a noisy version. Rather than making the common assumption that the wavelet coefficients of the signal are independent, we allow for the…

Methodology · Statistics 2009-03-17 Graeme K. Ambler , Bernard W. Silverman

We propose a sampling scheme that can perfectly reconstruct a collection of spikes on the sphere from samples of their lowpass-filtered observations. Central to our algorithm is a generalization of the annihilating filter method, a tool…

Information Theory · Computer Science 2016-01-20 Ivan Dokmanic , Yue M. Lu

This article introduces an effective generalization of the polar flavor of the Fourier Theorem based on a new method of analysis. Under the premises of the new theory an ample class of functions become viable as bases, with the further…

Sound · Computer Science 2013-11-26 Sossio Vergara