Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
DOI10.1007/s10208-021-09501-3OpenAlexW3139287065MaRDI QIDQ2696571
Ben Adcock, Matthew King-Roskamp, Simone Brugiapaglia
Publication date: 14 April 2023
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10028
compressed sensingoptimal sampling strategiesFourier samplingpiecewise \(\alpha\)-Hölder functionswavelet approximation theory
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Sampling theory in information and communication theory (94A20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Generalized sampling and infinite-dimensional compressed sensing
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder
- The restricted isometry property and its implications for compressed sensing
- Extensions of compressed sensing
- Compressed sensing with structured sparsity and structured acquisition
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Stability and instance optimality for Gaussian measurements in compressed sensing
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Correcting for unknown errors in sparse high-dimensional function approximation
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- A Practical Guide to the Recovery of Wavelet Coefficients from Fourier Measurements
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Compressed sensing and best 𝑘-term approximation
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Ten Lectures on Wavelets
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- Structured Compressed Sensing: From Theory to Applications
- Stable and Robust Sampling Strategies for Compressive Imaging
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Robustness to Unknown Error in Sparse Regularization
- Optimal Compressive Imaging of Fourier Data
- Compressive Imaging: Structure, Sampling, Learning
- Variable Density Sampling with Continuous Trajectories
- Compressive light field photography using overcomplete dictionaries and optimized projections
- On the Role of Total Variation in Compressed Sensing
- Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements
- A Probabilistic and RIPless Theory of Compressed Sensing
- Model-Based Compressive Sensing
- Sparsity and incoherence in compressive sampling
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Variable Density Compressed Image Sampling
This page was built for publication: Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
