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. A seminal result of Beurling shows that sample points give rise to a classical Fourier frame provided they are relatively separated and of sufficient density. However, this result does not allow for arbitrary cluster-ing of sample points, as is often the case in practice. Whilst keeping the density condition sharp and dimension independent, our first result removes the separation condition and shows that density alone suffices. However, this result does not lead to estimates for the frame bounds. A known...
AbstractNowadays the topic of sampling in a shift-invariant space is having a significant impact: it...
We prove that any stable method for resolving the Gibbs phenomenon—that is, recover-ing high-order a...
A straightforward discretisation of high-dimensional problems often leads to a curse of dimensions a...
In this paper, we consider the problem of recovering a compactly-supported multivariate function fro...
We study the problem of recovering an unknown compactly-supported multivariate function from samples...
AbstractIn this paper, we investigate frames for L2[−π,π]d consisting of exponential functions in co...
In several applications, data are collected in the frequency (Fourier) domain non-uniformly, either ...
and Anders C. Hansen Abstract In this paper, we consider the problem of reconstructing piecewise smo...
We give an algorithm for `2/`2 sparse recovery from Fourier measurements using O(k logN) sam-ples, m...
In this paper we analyze two-dimensional wavelet reconstructions from Fourier samples within the fra...
Abstract. Based on Beurling’s theory of balayage, we develop the theory of non-uniform sampling in t...
We derive a new relation between the discrete Fourier transform of a discrete sampling set of a comp...
Abstract. This article discusses modern techniques for nonuniform sampling and reconstruction of fun...
We consider the problem of “algebraic reconstruction ” of linear combi-nations of shifts of several ...
In several scientific areas, such as radio astronomy, computed tomography, and magnetic resonance im...
AbstractNowadays the topic of sampling in a shift-invariant space is having a significant impact: it...
We prove that any stable method for resolving the Gibbs phenomenon—that is, recover-ing high-order a...
A straightforward discretisation of high-dimensional problems often leads to a curse of dimensions a...
In this paper, we consider the problem of recovering a compactly-supported multivariate function fro...
We study the problem of recovering an unknown compactly-supported multivariate function from samples...
AbstractIn this paper, we investigate frames for L2[−π,π]d consisting of exponential functions in co...
In several applications, data are collected in the frequency (Fourier) domain non-uniformly, either ...
and Anders C. Hansen Abstract In this paper, we consider the problem of reconstructing piecewise smo...
We give an algorithm for `2/`2 sparse recovery from Fourier measurements using O(k logN) sam-ples, m...
In this paper we analyze two-dimensional wavelet reconstructions from Fourier samples within the fra...
Abstract. Based on Beurling’s theory of balayage, we develop the theory of non-uniform sampling in t...
We derive a new relation between the discrete Fourier transform of a discrete sampling set of a comp...
Abstract. This article discusses modern techniques for nonuniform sampling and reconstruction of fun...
We consider the problem of “algebraic reconstruction ” of linear combi-nations of shifts of several ...
In several scientific areas, such as radio astronomy, computed tomography, and magnetic resonance im...
AbstractNowadays the topic of sampling in a shift-invariant space is having a significant impact: it...
We prove that any stable method for resolving the Gibbs phenomenon—that is, recover-ing high-order a...
A straightforward discretisation of high-dimensional problems often leads to a curse of dimensions a...