A mathematical introduction to compressive sensing
From MaRDI portal
Publication:351503
DOI10.1007/978-0-8176-4948-7zbMATH Open1315.94002OpenAlexW143004564MaRDI QIDQ351503FDOQ351503
Publication date: 5 July 2013
Published in: Applied and Numerical Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-8176-4948-7
Recommendations
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Cited In (only showing first 100 items - show all)
- Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck
- Tensor Completion in Hierarchical Tensor Representations
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Empirical average-case relation between undersampling and sparsity in X-ray CT
- A Survey of Compressed Sensing
- Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Dimensionality reduction with subgaussian matrices: a unified theory
- Computing and analyzing recoverable supports for sparse reconstruction
- Long gaps between primes
- Randomized numerical linear algebra: Foundations and algorithms
- Guarantees of total variation minimization for signal recovery
- Theoretical frame properties of wave-packet matrices over prime fields
- Sparse recovery under weak moment assumptions
- Optimally Sparse Data Representations
- Generalized sampling and infinite-dimensional compressed sensing
- Sensitivity of low-rank matrix recovery
- On tensor product approximation of analytic functions
- A geometrical stability condition for compressed sensing
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- Compressive Imaging and Characterization of Sparse Light Deflection Maps
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Tensor theta norms and low rank recovery
- Fast Phase Retrieval from Local Correlation Measurements
- Gaussian approximations in high dimensional estimation
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Control of multi-agent systems: results, open problems, and applications
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Stable low-rank matrix recovery via null space properties
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
- Average best \(m\)-term approximation
- Quasi-linear Compressed Sensing
- Phase retrieval from Gabor measurements
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Hellmann-Feynman connection for the relative Fisher information
- Carl's inequality for quasi-Banach spaces
- A unified approach to uniform signal recovery from nonlinear observations
- A unified framework for linear dimensionality reduction in L1
- Sparse solutions of linear complementarity problems
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- A class of deterministic sensing matrices and their application in harmonic detection
- Low rank tensor recovery via iterative hard thresholding
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- The uniform sparse FFT with application to PDEs with random coefficients
- Sparse reconstruction with multiple Walsh matrices
- Sparse recovery with integrality constraints
- Deterministic bounds for restricted isometry in compressed sensing matrices
- On maximal relative projection constants
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Orthogonal matching pursuit under the restricted isometry property
- Robust sparse phase retrieval made easy
- TV-based reconstruction of periodic functions
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Interpolation via weighted \(\ell_{1}\) minimization
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Regularity properties of non-negative sparsity sets
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Complexity of linear ill-posed problems in Hilbert space
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Low rank matrix recovery from rank one measurements
- Recovery of low-rank matrices based on the rank null space properties
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- The geometry of off-the-grid compressed sensing
- Improved bounds for the RIP of Subsampled Circulant matrices
- Low-rank matrix recovery via rank one tight frame measurements
- Compressed sensing of low-rank plus sparse matrices
- Recovery of sparse integer vectors from linear measurements
- Title not available (Why is that?)
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Sparse linear regression from perturbed data
- On the optimal constants in the two-sided Stechkin inequalities
- New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization
- Sketched learning for image denoising
- On some aspects of approximation of ridge functions
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- The numerics of phase retrieval
- Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Minimizers of sparsity regularized Huber loss function
- On Reconstructing Functions from Binary Measurements
- Large deviations for uniform projections of $p$-radial distributions on $\ell_p^n$-balls
- Minimal numerical differentiation formulas
- Sparsest representations and approximations of an underdetermined linear system
- On the volume of unit balls of finite-dimensional Lorentz spaces
- Entropy numbers of finite-dimensional embeddings
- Sampling numbers of smoothness classes via \(\ell^1\)-minimization
- Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Recovery under side constraints
- Signal recovery under cumulative coherence
- A general null space property for sparse principal component analysis
- On the post selection inference constant under restricted isometry properties
- Sparse recovery from inaccurate saturated measurements
- Nonlinear approximation with nonstationary Gabor frames
- Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness
- Sampling schemes and recovery algorithms for functions of few coordinate variables
- Title not available (Why is that?)
Uses Software
This page was built for publication: A mathematical introduction to compressive sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351503)
