A mathematical introduction to compressive sensing
From MaRDI portal
Publication:351503
DOI10.1007/978-0-8176-4948-7zbMath1315.94002OpenAlexW143004564MaRDI QIDQ351503
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
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)
Related Items (only showing first 100 items - show all)
Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data ⋮ Refined analysis of sparse MIMO radar ⋮ Average-case complexity without the black swans ⋮ Global sensitivity analysis based on high-dimensional sparse surrogate construction ⋮ Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames ⋮ One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations ⋮ Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares ⋮ Computing a quantity of interest from observational data ⋮ Book Review: A mathematical introduction to compressive sensing ⋮ Uncertainty Propagation; Intrusive Kinetic Formulations of Scalar Conservation Laws ⋮ Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data ⋮ Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property ⋮ Error bounds for compressed sensing algorithms with group sparsity: A unified approach ⋮ Explicit universal sampling sets in finite vector spaces ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ A theoretical result of sparse signal recovery via alternating projection method ⋮ A new bound on the block restricted isometry constant in compressed sensing ⋮ Compressed sensing for finite-valued signals ⋮ Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing ⋮ A provably convergent scheme for compressive sensing under random generative priors ⋮ Entropy numbers of embeddings of Schatten classes ⋮ Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE ⋮ High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ When does OMP achieve exact recovery with continuous dictionaries? ⋮ \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? ⋮ A novel regularization based on the error function for sparse recovery ⋮ A multi-parameter regularization model for deblurring images corrupted by impulsive noise ⋮ A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness ⋮ Compressive statistical learning with random feature moments ⋮ Statistical learning guarantees for compressive clustering and compressive mixture modeling ⋮ Convex optimization in sums of Banach spaces ⋮ A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization ⋮ Sparse signal recovery from phaseless measurements via hard thresholding pursuit ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ On randomized trace estimates for indefinite matrices with an application to determinants ⋮ Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ Generic error bounds for the generalized Lasso with sub-exponential data ⋮ A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery ⋮ Newton-type optimal thresholding algorithms for sparse optimization problems ⋮ Iteratively reweighted \(\ell _1\) algorithms with extrapolation ⋮ Sparse Hanson-Wright inequalities for subgaussian quadratic forms ⋮ A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ Interior reconstruction in tomography via prior support constrained compressed sensing ⋮ Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1 ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Misspecified nonconvex statistical optimization for sparse phase retrieval ⋮ The geometry of off-the-grid compressed sensing ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Compressed sensing of low-rank plus sparse matrices ⋮ Covering point-sets with parallel hyperplanes and sparse signal recovery ⋮ Erasure Coding for Fault-Oblivious Linear System Solvers ⋮ Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting) ⋮ Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures ⋮ Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing ⋮ BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING ⋮ Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization ⋮ Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D ⋮ A compressed sensing approach to interpolation of fractional Brownian trajectories for a single particle tracking experiment ⋮ Paved with good intentions: analysis of a randomized block Kaczmarz method ⋮ A simple proof of the Grünbaum conjecture ⋮ On the sparsity of Lasso minimizers in sparse data recovery ⋮ A unifying representer theorem for inverse problems and machine learning ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures ⋮ Worst-case recovery guarantees for least squares approximation using random samples ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ On the computation of sparse solutions to the controllability problem for discrete-time linear systems ⋮ Moment inequalities for matrix-valued U-statistics of order 2 ⋮ An extremal problem for integer sparse recovery ⋮ Relevant sampling of band-limited functions ⋮ Convex Cardinal Shape Composition ⋮ Estimation in High Dimensions: A Geometric Perspective ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems ⋮ Fast and RIP-optimal transforms ⋮ Multi-kernel unmixing and super-resolution using the modified matrix pencil method ⋮ On sparse beamformer design with reverberation ⋮ Erasure recovery matrices for encoder protection ⋮ Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements ⋮ New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization ⋮ Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix ⋮ Sparse reconstruction with multiple Walsh matrices ⋮ A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs ⋮ Truncated sparse approximation property and truncated \(q\)-norm minimization ⋮ Lattices from tight frames and vertex transitive graphs ⋮ Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization ⋮ Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit ⋮ Quantized compressed sensing for random circulant matrices ⋮ Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines ⋮ Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case ⋮ A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids ⋮ Concave Mirsky Inequality and Low-Rank Recovery ⋮ On some aspects of approximation of ridge functions ⋮ Finding sparse solutions of systems of polynomial equations via group-sparsity optimization ⋮ Combined first and second order variational approaches for image processing
Uses Software
This page was built for publication: A mathematical introduction to compressive sensing
