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)
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Sparsest piecewise-linear regression of one-dimensional data
- Enhancing matrix completion using a modified second-order total variation
- The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Moving horizon estimation for ARMAX processes with additive output noise
- 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
- Greedy subspace pursuit for joint sparse recovery
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Sparse approximate reconstruction decomposed by two optimization problems
- Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction
- Approximation spaces of deep neural networks
- Proximal Gradient Methods for Machine Learning and Imaging
- A simple proof of the GrĂźnbaum conjecture
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
- A Novel Compressed Sensing Scheme for Photoacoustic Tomography
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Column normalization of a random measurement matrix
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Computing a quantity of interest from observational data
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
- On randomized trace estimates for indefinite matrices with an application to determinants
- Stochastic greedy algorithms for multiple measurement vectors
- Quantized compressed sensing for random circulant matrices
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Erasure Coding for Fault-Oblivious Linear System Solvers
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Inpainting via high-dimensional universal shearlet systems
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator
- Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
- Norm-minimized scattering data from intensity spectra
- Concave Mirsky Inequality and Low-Rank Recovery
- Regularization: From Inverse Problems to Large-Scale Machine Learning
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- Gelfand numbers of embeddings of Schatten classes
- Well-Posed Bayesian Inverse Problems: Priors with Exponential Tails
- Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization
- Learning the invisible: a hybrid deep learning-shearlet framework for limited angle computed tomography
- Joint Sparse Recovery Based on Variances
- Banach spaces for which the space of operators has 2đ closed ideals
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Density theorems for nonuniform sampling of bandlimited functions using derivatives or bunched measurements
- Compressed sensing with structured sparsity and structured acquisition
- Robust and stable region-of-interest tomographic reconstruction using a robust width prior
- Title not available (Why is that?)
- Well-Posed Bayesian Inverse Problems with Infinitely Divisible and Heavy-Tailed Prior Measures
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
- A hierarchical framework for recovery in compressive sensing
- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization
- Lower bounds on the low-distortion embedding dimension of submanifolds of \(\mathbb{R}^n\)
- Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere
- A Rice method proof of the null-space property over the Grassmannian
- A new bound on the block restricted isometry constant in compressed sensing
- An analysis of the SPARSEVA estimate for the finite sample data case
- Accelerated first-order methods for hyperbolic programming
- A note on the invertibility of the Gabor frame operator on certain modulation spaces
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- An Introduction to Compressed Sensing
- Newton-type optimal thresholding algorithms for sparse optimization problems
- An unbiased approach to compressed sensing
- PhaseMax: Stable guarantees from noisy sub-Gaussian measurements
- 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
- Robust and resource-efficient identification of two hidden layer neural networks
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Complex phase retrieval from subgaussian measurements
- On Multiplier Processes Under Weak Moment Assumptions
- One-bit sensing, discrepancy and Stolarsky's principle
- Hyperspherical Sparse Approximation Techniques for High-Dimensional Discontinuity Detection
- Title not available (Why is that?)
- Stability analysis of a class of sparse optimization problems
- Persistent homology for low-complexity models
- Pooled Testing and Its Applications in the COVID-19 Pandemic
- $l_p$ Regularization for Ensemble Kalman Inversion
- A null-space-based weightedl1minimization approach to compressed sensing
- Sparse random matrices have simple spectrum
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- Sparse recovery from extreme eigenvalues deviation inequalities
- Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function
- Robust recovery of signals with partially known support information using weighted BPDN
- Approximation Analysis of Convolutional Neural Networks
- 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
- Data-driven algorithm selection and tuning in optimization and signal processing
- A Laplacian approach to \(\ell_1\)-norm minimization
- On the geometry of polytopes generated by heavy-tailed random vectors
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
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)
