Making Do with Less: An Introduction to Compressed Sensing

DOI10.1137/110837681zbMath1306.94009OpenAlexW1974499748MaRDI QIDQ2848611

Kurt Bryan, Tanya Leise

Publication date: 26 September 2013

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: http://epubs.siam.org/doi/abs/10.1137/110837681

zbMATH Keywords

linear programmingrandom matricescompressed sensingrestricted isometry propertysparse signal recovery

Mathematics Subject Classification ID

Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Random matrices (algebraic aspects) (15B52)

Related Items (10)

Sparse solutions to an underdetermined system of linear equations via penalized Huber loss ⋮ Minimizers of sparsity regularized Huber loss function ⋮ Variable Projection Methods for an Optimized Dynamic Mode Decomposition ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) ⋮ What is a Frame? Theory and Applications of Frames ⋮ Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ ⋮ A New Optimization Approach to Sparse Reconstruction of Log-Conductivity in Acousto-Electric Tomography ⋮ Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines ⋮ Identifiability and convergence analysis of the MINLIP estimator

This page was built for publication: Making Do with Less: An Introduction to Compressed Sensing