Sparse signal recovery using a new class of random matrices
type: Item
instance of: scholarly article
title: Sparse signal recovery using a new class of random matrices
zbMATH Open document ID: 1361.60007
author: Enrico Au-Yeung
published in: Advances in Pure and Applied Mathematics
publication date: 2017-04-06T00:00:00Z
Mathematics Subject Classification ID: 60B20
Mathematics Subject Classification ID: 15B52
zbMATH DE Number: 6701809
zbMATH Keywords: random matrices
zbMATH Keywords: sparse signal recovery
zbMATH Keywords: compressed sensing
MaRDI profile type: Publication
full work available at URL: apam-2016-0039
OpenAlex ID: W2581191450
cites work: A simple proof of the restricted isometry property for random matrices
cites work: Iterative hard thresholding for compressed sensing
cites work: Invertibility of ``large'' submatrices with applications to the geometry of Banach spaces and harmonic analysis
cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
cites work: Operator Khintchine inequality in non-commutative probability
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Compressed sensing and best 𝑘-term approximation
cites work: Compressed sensing
cites work: Counting faces of randomly projected polytopes when the projection radically lowers dimension
cites work: Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
cites work: A mathematical introduction to compressive sensing
cites work: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
cites work: On the best constants in noncommutative Khintchine-type inequalities
cites work: Non commutative Khintchine and Paley inequalities
cites work: Sparsity in time-frequency representations
cites work: Random sampling of sparse trigonometric polynomials
cites work: Q3078293
cites work: Sparse Legendre expansions via \(\ell_1\)-minimization
cites work: On sparse reconstruction from Fourier and Gaussian measurements
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
cites work: Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization
cites work: Just relax: convex programming methods for identifying sparse signals in noise
DOI: 10.1515/APAM-2016-0039
description: scientific article; zbMATH DE number 6701809