Sparse signal recovery using a new class of random matrices

DOI10.1515/APAM-2016-0039zbMATH Open1361.60007OpenAlexW2581191450MaRDI QIDQ520894FDOQ520894

Authors: Enrico Au-Yeung 

Publication date: 6 April 2017

Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/apam-2016-0039

Recommendations

• Nonuniform sparse recovery with subgaussian matrices
• Sparse reconstruction with multiple Walsh matrices
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Lower bounds for sparse recovery
• Sparse recovery with pre-Gaussian random matrices

zbMATH Keywords

compressed sensingrandom matricessparse signal recovery

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)

Cites Work

• Just relax: convex programming methods for identifying sparse signals in noise
• Stable signal recovery from incomplete and inaccurate measurements
• A simple proof of the restricted isometry property for random matrices
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Compressed sensing
• Iterative hard thresholding for compressed sensing
• Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
• Compressed sensing and best \(k\)-term approximation
• A mathematical introduction to compressive sensing
• Greed is Good: Algorithmic Results for Sparse Approximation
• Sparse Legendre expansions via \(\ell_1\)-minimization
• On sparse reconstruction from Fourier and Gaussian measurements
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• The restricted isometry property and its implications for compressed sensing
• Operator Khintchine inequality in non-commutative probability
• Counting faces of randomly projected polytopes when the projection radically lowers dimension
• Compressive sensing and structured random matrices
• Random sampling of sparse trigonometric polynomials
• Non commutative Khintchine and Paley inequalities
• On the best constants in noncommutative Khintchine-type inequalities
• Sparsity in time-frequency representations
• Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants

Cited In (13)

• PROMP: a sparse recovery approach to lattice-valued signals
• Support Recovery for Sparse Signals With Unknown Non-Stationary Modulation
• A Framework for Clustered and Skewed Sparse Signal Recovery
• Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
• Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
• A Scale-Invariant Approach for Sparse Signal Recovery
• Super-sparse tri-value circulant measurement matrices design
• Robust sparse recovery with sparse Bernoulli matrices via expanders
• Recursive Recovery of Sparse Signal Sequences From Compressive Measurements: A Review
• Note on sparsity in signal recovery and in matrix identification
• Tail bounds for gaps between eigenvalues of sparse random matrices
• An Information-Theoretic Study for Joint Sparsity Pattern Recovery With Different Sensing Matrices
• Sparse representations of random signals

This page was built for publication: Sparse signal recovery using a new class of random matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520894)