A mathematical introduction to compressive sensing
From MaRDI portal
(Redirected from Publication:351503)
Recommendations
Cited in
(only showing first 100 items - show all)- Self-calibration and biconvex compressive sensing
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Compressed sensing for finite-valued signals
- Robust sparse recovery via a novel convex model
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Sparse high-dimensional linear regression. Estimating squared error and a phase transition
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- A simple tool for bounding the deviation of random matrices on geometric sets
- Fast and RIP-optimal transforms
- Relevant sampling of band-limited functions
- Compressive sensing with redundant dictionaries and structured measurements
- Estimation in high dimensions: a geometric perspective
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- Optical compressive imaging
- PROMP: a sparse recovery approach to lattice-valued signals
- The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- A multi-parameter regularization model for deblurring images corrupted by impulsive noise
- Cosparsity in Compressed Sensing
- Orthogonal matching pursuit under the restricted isometry property
- Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control
- Fusion frames and distributed sparsity
- Uncertainty propagation; intrusive kinetic formulations of scalar conservation laws
- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- Hard thresholding pursuit algorithms: number of iterations
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- On the optimal constants in the two-sided Stechkin inequalities
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- Flavors of compressive sensing
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
- Hierarchical isometry properties of hierarchical measurements
- Stochastic collocation algorithms using \(l_1\)-minimization for Bayesian solution of inverse problems
- Nonlinear frames and sparse reconstructions in Banach spaces
- Signal recovery under mutual incoherence property and oracle inequalities
- Average-case complexity without the black swans
- Discrete uncertainty principles and sparse signal processing
- Improved bounds for sparse recovery from subsampled random convolutions
- Noise folding in completely perturbed compressed sensing
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- Estimation of block sparsity in compressive sensing
- Algebraic cubature on polygonal elements with a circular edge
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Solution of linear ill-posed problems using random dictionaries
- Covering compact metric spaces greedily
- Convergence of Halpern’s Iteration Method with Applications in Optimization
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Dimensionality-reduced subspace clustering
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Random sampling of bandlimited signals on graphs
- Sparse signal recovery using a new class of random matrices
- Uniform recovery of fusion frame structured sparse signals
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- On uniqueness guarantees of solution in convex regularized linear inverse problems
- Polynomials with bounds and numerical approximation
- Compressed sensing for quaternionic signals
- On the uniqueness of solutions for the basis pursuit in the continuum
- Compressive sensing in signal processing: algorithms and transform domain formulations
- Near-optimal encoding for sigma-delta quantization of finite frame expansions
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Entropy numbers of embeddings of Schatten classes
- On Dvoretzky's theorem for subspaces of \(L_p\)
- Random sampling and reconstruction of concentrated signals in a reproducing kernel space
- Tight bounds on the mutual coherence of sensing matrices for Wigner d-functions on regular grids
- Learning general sparse additive models from point queries in high dimensions
- Single snapshot DOA estimation by minimizing the fraction function in sparse recovery
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressive imaging and characterization of sparse light deflection maps
- Refined analysis of sparse MIMO radar
- Nonlinear approximation spaces for inverse problems
- Infinite-dimensional compressed sensing and function interpolation
- Compressed sensing: a survey
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
- CLOT norm minimization for continuous hands-off control
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Algebraic compressed sensing
- Dimensionality reduction for \(k\)-distance applied to persistent homology
- Newton-type optimal thresholding algorithms for sparse optimization problems
- An Introduction to Compressed Sensing
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
- Data-driven algorithm selection and tuning in optimization and signal processing
- A Laplacian approach to \(\ell_1\)-norm minimization
- Quantized compressed sensing for random circulant matrices
- An introduction to compressed sensing
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Low-rank matrix recovery via regularized nuclear norm minimization
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- Pooled Testing and Its Applications in the COVID-19 Pandemic
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Sparse recovery using the discrete cosine transform
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures
- Stochastic greedy algorithms for multiple measurement vectors
- Sparse random matrices have simple spectrum
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
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)
