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)
Computing and analyzing recoverable supports for sparse reconstruction ⋮ Minimal numerical differentiation formulas ⋮ Sketched learning for image denoising ⋮ Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing ⋮ On tensor product approximation of analytic functions ⋮ Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ A geometrical stability condition for compressed sensing ⋮ Gaussian approximations in high dimensional estimation ⋮ Signal recovery under cumulative coherence ⋮ Minimizers of sparsity regularized Huber loss function ⋮ Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets ⋮ On the post selection inference constant under restricted isometry properties ⋮ Sparse recovery from inaccurate saturated measurements ⋮ Phase retrieval from Gabor measurements ⋮ Improved bounds for sparse recovery from subsampled random convolutions ⋮ 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 framework for linear dimensionality reduction in L1 ⋮ Sparse solutions of linear complementarity problems ⋮ A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints ⋮ Global optimization for low-dimensional switching linear regression and bounded-error estimation ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ A class of deterministic sensing matrices and their application in harmonic detection ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Deterministic bounds for restricted isometry in compressed sensing matrices ⋮ On maximal relative projection constants ⋮ Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Regularity properties of non-negative sparsity sets ⋮ On Dvoretzky's theorem for subspaces of \(L_p\) ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ 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 ⋮ Robust sparse phase retrieval made easy ⋮ Compressed sensing for real measurements of quaternion signals ⋮ A novel probabilistic approach for vehicle position prediction in free, partial, and full GPS outages ⋮ On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis ⋮ Expander \(\ell_0\)-decoding ⋮ PROMP: a sparse recovery approach to lattice-valued signals ⋮ Nonlinear approximation with nonstationary Gabor frames ⋮ An LP empirical quadrature procedure for parametrized functions ⋮ Polynomials with bounds and numerical approximation ⋮ Sparse disjointed recovery from noninflating measurements ⋮ Estimation of functionals of sparse covariance matrices ⋮ Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization ⋮ Random sampling of bandlimited signals on graphs ⋮ Stability of the elastic net estimator ⋮ Density theorems for nonuniform sampling of bandlimited functions using derivatives or bunched measurements ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Sampling in the analysis transform domain ⋮ Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization ⋮ Analysis \(\ell_1\)-recovery with frames and Gaussian measurements ⋮ A Rice method proof of the null-space property over the Grassmannian ⋮ Interpolation via weighted \(\ell_{1}\) minimization ⋮ Average best \(m\)-term approximation ⋮ Compressed sensing with structured sparsity and structured acquisition ⋮ An analysis of the SPARSEVA estimate for the finite sample data case ⋮ Accelerated first-order methods for hyperbolic programming ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ Moving horizon estimation for ARMAX processes with additive output noise ⋮ Signal recovery under mutual incoherence property and oracle inequalities ⋮ Near-optimal encoding for sigma-delta quantization of finite frame expansions ⋮ Low-rank matrix recovery via rank one tight frame measurements ⋮ Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\) ⋮ Greedy subspace pursuit for joint sparse recovery ⋮ Discrete uncertainty principles and sparse signal processing ⋮ A new generalized shrinkage conjugate gradient method for sparse recovery ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Noise folding in completely perturbed compressed sensing ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ On uniqueness guarantees of solution in convex regularized linear inverse problems ⋮ Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations ⋮ Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) ⋮ 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 ⋮ Nonlinear frames and sparse reconstructions in Banach spaces ⋮ Orthogonal matching pursuit under the restricted isometry property ⋮ Generalized sampling and infinite-dimensional compressed sensing ⋮ Dimensionality reduction with subgaussian matrices: a unified theory ⋮ Sparse recovery under weak moment assumptions ⋮ Sparse signal recovery using a new class of random matrices ⋮ Rapidly computing sparse Legendre expansions via sparse Fourier transforms ⋮ Compressed sensing for quaternionic signals ⋮ Inpainting via high-dimensional universal shearlet systems ⋮ Solution of linear ill-posed problems using random dictionaries ⋮ Covering compact metric spaces greedily ⋮ Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods ⋮ Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness ⋮ Approximately normalized iterative hard thresholding for nonlinear compressive sensing ⋮ Compressive sensing in signal processing: algorithms and transform domain formulations ⋮ Norm-minimized scattering data from intensity spectra ⋮ Efficient dictionary learning with sparseness-enforcing projections ⋮ Uniform recovery of fusion frame structured sparse signals ⋮ Hard thresholding pursuit algorithms: number of iterations ⋮ Preserving injectivity under subgaussian mappings and its application to compressed sensing ⋮ Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control ⋮ Empirical average-case relation between undersampling and sparsity in X-ray CT
Uses Software
This page was built for publication: A mathematical introduction to compressive sensing
