A mathematical introduction to compressive sensing
From MaRDI portal
(Redirected from Publication:351503)
Recommendations
Cited in
(only showing first 100 items - show all)- A note on the invertibility of the Gabor frame operator on certain modulation spaces
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Sketched learning for image denoising
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Empirical average-case relation between undersampling and sparsity in X-ray CT
- Recovery guarantees for polynomial coefficients from weakly dependent data with outliers
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- Bayesian approach with extended support estimation for sparse linear regression
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Endpoint results for Fourier integral operators on noncompact symmetric spaces
- A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
- Sparsest piecewise-linear regression of one-dimensional data
- Norms of structured random matrices
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Data-driven methods for quantitative imaging
- On some aspects of approximation of ridge functions
- An Introduction to Compressed Sensing
- Fusion frames and distributed sparsity
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Tight bounds on the mutual coherence of sensing matrices for Wigner d-functions on regular grids
- Jointly low-rank and bisparse recovery: questions and partial answers
- Tensor sparse representation via Einstein product
- Accelerating the Lawson-Hanson NNLS solver for large-scale Tchakaloff regression designs
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- A scale-invariant relaxation in low-rank tensor recovery with an application to tensor completion
- Near optimal Tchakaloff meshes for compact sets with Markov exponent 2
- On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties
- Gaussian random fields: with and without covariances
- PROMP: a sparse recovery approach to lattice-valued signals
- Nonlinear frames and sparse reconstructions in Banach spaces
- Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
- Efficiently approximating the probability of deadline misses in real-time systems
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Enhancing matrix completion using a modified second-order total variation
- On Dvoretzky's theorem for subspaces of \(L_p\)
- Generalization bounds for sparse random feature expansions
- Analysis of sparse recovery algorithms via the replica method
- Compressed sensing in the spherical near-field to far-field transformation
- Hierarchical compressed sensing
- New challenges in covariance estimation: multiple structures and coarse quantization
- Sparse deterministic and stochastic channels: identification of spreading functions and covariances
- Single-pass randomized QLP decomposition for low-rank approximation
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Theoretical analysis for \(\ell_{1}\)-\(\ell_{2}\) minimization with partial support information.
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing
- Robust and resource-efficient identification of two hidden layer neural networks
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Minimizers of sparsity regularized Huber loss function
- Inverse potential problems for divergence of measures with total variation regularization
- Joint structure-texture low-dimensional modeling for image decomposition with a plug-and-play framework
- Compressed sensing for privacy-preserving data processing
- An unbiased approach to compressed sensing
- The numerics of phase retrieval
- Sparse recovery with fusion frames and bounded orthonormal systems
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Normalizing basis functions: approximate stationary models for large spatial data
- Time-frequency analysis on flat tori and Gabor frames in finite dimensions
- Convergence analysis of the augmented Lagrangian method for _p-norm cone optimization problems with p 2
- LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
- Bounding the restricted isometry constants for a tight frame
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Universal discretization and sparse recovery
- Approximating positive homogeneous functions with scale invariant neural networks
- Complex phase retrieval from subgaussian measurements
- Moving horizon estimation for ARMAX processes with additive output noise
- Signal separation under coherent dictionaries and _p-bounded noise
- Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
- A measure concentration effect for matrices of high, higher, and even higher dimension
- Stable recovery of regularized linear inverse problems
- On the implementation of ADMM with dynamically configurable parameter for the separable _1/_2 minimization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- On the role of total variation in compressed sensing
- Dimensionality reduction with subgaussian matrices: a unified theory
- Nonlinear approximation in bounded orthonormal product bases
- Adaptive coded aperture design for compressive computed tomography
- Effectiveness of the tail-atomic norm in gridless spectrum estimation
- Computing and analyzing recoverable supports for sparse reconstruction
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Entropy numbers of embeddings of Schatten classes
- The recovery of ridge functions on the hypercube suffers from the curse of dimensionality
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
- Structured model selection via ℓ1−ℓ2 optimization
- \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Minimal numerical differentiation formulas
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- Greedy subspace pursuit for joint sparse recovery
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Convergence rates for the joint solution of inverse problems with compressed sensing data
- Infinite-dimensional compressed sensing and function interpolation
- Large deviations for uniform projections of $p$-radial distributions on $\ell_p^n$-balls
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Sparsest representations and approximations of an underdetermined linear system
- A representer theorem for deep neural networks
- A deterministic sparse FFT for functions with structured Fourier sparsity
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)
