Binary sparse signal recovery with binary matching pursuit *
From MaRDI portal
Publication:4993901
DOI10.1088/1361-6420/abf903zbMath1497.94029OpenAlexW3152629386MaRDI QIDQ4993901
Publication date: 11 June 2021
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/abf903
support recoveryrestricted isometry propertymutual coherencebinary matching pursuitbinary sparse signal
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Performance analysis for unconstrained analysis based approaches* ⋮ Binary generalized orthogonal matching pursuit
Uses Software
Cites Work
- A mathematical introduction to compressive sensing
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Iterative hard thresholding for compressed sensing
- Hard thresholding pursuit algorithms: number of iterations
- The restricted isometry property and its implications for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A simple proof of the restricted isometry property for random matrices
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay
- Compressed sensing and best 𝑘-term approximation
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Uncertainty principles and ideal atomic decomposition
- A Tight Bound of Hard Thresholding
- Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- Sparse Activity Detection for Massive Connectivity
- Structure-Aware Bayesian Compressive Sensing for Frequency-Hopping Spectrum Estimation With Missing Observations
- Nearly Optimal Bounds for Orthogonal Least Squares
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal
- Reconstruction from convolution random sampling in local shift invariant spaces
- A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Latent Variable Bayesian Models for Promoting Sparsity
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- New Bounds for Restricted Isometry Constants
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Compressed sensing
