Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem

@article{Adcock2013BeyondCR,
  title={Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem},
  author={Ben Adcock and Anders C. Hansen and Clarice Poon},
  journal={ArXiv},
  year={2013},
  volume={abs/1301.2831}
}
Generalized sampling is a recently developed linear framework for sampling and reconstruction in separable Hilbert spaces. It allows one to recover any element in any finite-dimensional subspace given finitely many of its samples with respect to an arbitrary basis or frame. Unlike more common approaches for this problem, such as the consistent reconstruction technique of Eldar and others, it leads to numerical methods possessing both guaranteed stability and accuracy. The purpose of this paper… 
Generalized sampling: extension to frames and inverse and ill-posed problems
Generalized sampling is a new framework for sampling and reconstruction in infinite-dimensional Hilbert spaces. Given measurements (inner products) of an element with respect to one basis, it allows
A Consistent and Stable Approach to Generalized Sampling
We consider the problem of generalized sampling, in which one seeks to obtain reconstructions in arbitrary finite dimensional spaces from a finite number of samples taken with respect to an arbitrary
Computing reconstructions from nonuniform Fourier samples: Universality of stability barriers and stable sampling rates
We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform
Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients
TLDR
With a system of polynomials that the user is essentially free to choose, one can restore exponential accuracy in n and root-exponential accuracy in m and generalizes a result proved recently for piecewise Legendre polynmials.
Optimal wavelet reconstructions from Fourier samples via generalized sampling
We consider the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling in
On stable reconstructions from univariate nonuniform Fourier measurements
In this paper, we consider the fundamental problem of recovering a univariate function $f$ from a finite collection of pointwise samples of its Fourier transform taking nonuniformly. In the first
On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate
TLDR
Generalized sampling provides a nearly-optimal solution to the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples, and under some mild assumptions it is shown that generalized sampling cannot be outperformed in terms of approximation quality by more than a constant factor.
Sampling and Reconstruction in Distinct Subspaces Using Oblique Projections
We study reconstruction operators on a Hilbert space that are exact on a given reconstruction subspace. Among those the reconstruction operator obtained by the least squares fit has the smallest
Constrained Sampling: Optimum Reconstruction in Subspace With Minimax Regret Constraint
TLDR
Constrained GSRP is proposed, a novel framework that minimizes the reconstruction error for inputs in a subspace, subject to a constraint on the maximum regret-error for any other signal in the entire signal space.
Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 66 REFERENCES
Generalized sampling: extension to frames and inverse and ill-posed problems
Generalized sampling is a new framework for sampling and reconstruction in infinite-dimensional Hilbert spaces. Given measurements (inner products) of an element with respect to one basis, it allows
A Generalized Sampling Theorem for Stable Reconstructions in Arbitrary Bases
We introduce a generalized framework for sampling and reconstruction in separable Hilbert spaces. Specifically, we establish that it is always possible to stably reconstruct a vector in an arbitrary
Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
Abstract We introduce a simple and efficient method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a
A minimum squared-error framework for generalized sampling
We treat the problem of reconstructing a signal from its nonideal samples where the sampling and reconstruction spaces as well as the class of input signals can be arbitrary subspaces of a Hilbert
Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients
TLDR
With a system of polynomials that the user is essentially free to choose, one can restore exponential accuracy in n and root-exponential accuracy in m and generalizes a result proved recently for piecewise Legendre polynmials.
Consistent Sampling and Signal Recovery
TLDR
This paper proposes an extension of consistent sampling that is applicable to those singular cases as well, and that yields a unique and well-defined solution that displays solutions that preserve polynomials or sinusoids, and therefore perform well in practical applications.
REDUCED CONSISTENCY SAMPLING IN HILBERT SPACES
We present a new approach for the problem of reconstructing an element of a Hilbert space in an arbitrary reconstruction basis given its measurements with respect to certain sampling vectors. This
Robust and Consistent Sampling
TLDR
The proposed solution provides geometrical insight into the structure of the problem and extends previous treatments by finding a consistent and simultaneously robust approximation of the signal from its samples.
A Stability Barrier for Reconstructions from Fourier Samples
TLDR
It is proved that any stable method for resolving the Gibbs phenomenon can converge at best root-exponentially fast in $m$ and any method with faster convergence must also be unstable, and in particular, exponential convergence implies exponential ill-conditioning.
A general sampling theory for nonideal acquisition devices
The authors first describe the general class of approximation spaces generated by translation of a function /spl psi/(x), and provide a full characterization of their basis functions. They then
...
1
2
3
4
5
...