Linear reconstructions and the analysis of the stable sampling rate
From MaRDI portal
Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for inverse problems for integral equations (65R32) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Abstract: The theory of sampling and the reconstruction of data has a wide range of applications and a rich collection of techniques. For many methods a core problem is the estimation of the number of samples needed in order to secure a stable and accurate reconstruction. This can often be controlled by the Stable Sampling Rate (SSR). In this paper we discuss the SSR and how it is crucial for two key linear methods in sampling theory: generalized sampling and the recently developed Parametrized Background Data Weak (PBDW) method. Both of these approaches rely on estimates of the SSR in order to be accurate. In many areas of signal and image processing binary samples are crucial and such samples, which can be modelled by Walsh functions, are the core of our analysis. As we show, the SSR is linear when considering binary sampling with Walsh functions and wavelet reconstruction. Moreover, for certain wavelets it is possible to determine the SSR exactly, allowing sharp estimates for the performance of the methods.
Recommendations
- On the stable sampling rate for binary measurements and wavelet reconstruction
- On reconstructing functions from binary measurements
- Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements
- On stable Shannon type reconstruction processes
- Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
Cites work
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- A consistent and stable approach to generalized sampling
- A generalized sampling theorem for stable reconstructions in arbitrary bases
- A Mathematical Theory of Communication
- A parameterized-background data-weak approach to variational data assimilation: formulation, analysis, and application to acoustics
- A practical guide to the recovery of wavelet coefficients from Fourier measurements
- An introduction to X-ray tomography and Radon transforms
- Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
- Convergence analysis of the finite section method and Banach algebras of matrices
- Convergence rates for greedy algorithms in reduced basis methods
- Data assimilation and sampling in Banach spaces
- Data Assimilation in Reduced Modeling
- Electron tomography and multiscale biology
- Generalized sampling and infinite-dimensional compressed sensing
- Greedy algorithms for reduced bases in Banach spaces
- scientific article; zbMATH DE number 48510 (Why is no real title available?)
- scientific article; zbMATH DE number 3510923 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 777383 (Why is no real title available?)
- scientific article; zbMATH DE number 837791 (Why is no real title available?)
- Infinite matrices and their finite sections. An introduction to the limit operator method.
- Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements
- On dyadic analysis based on the pointwise dyadic derivative
- On greedy algorithm approximating Kolmogorov widths in Banach spaces
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate
- On the approximation of spectra of linear operators on Hilbert spaces
- Pseudospectral Fourier reconstruction with the modified inverse polynomial reconstruction method
- Sampling -- 50 years after Shannon
- The Shannon sampling theorem—Its various extensions and applications: A tutorial review
- Wavelets on the interval and fast wavelet transforms
Cited in
(10)- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
- On the stable sampling rate for binary measurements and wavelet reconstruction
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- On reconstructing functions from binary measurements
- Further results on Eitelberg's sampling rate design based on (1 — sT/2)
- Weak-type estimates for the metaplectic representation restricted to the shearing and dilation subgroup of \(\mathrm{SL}(2,\mathbb{R})\)
- Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements
- A frequency based constraint for a multi-frequency linear sampling method
- Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms
This page was built for publication: Linear reconstructions and the analysis of the stable sampling rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631279)
