Binary generalized orthogonal matching pursuit
From MaRDI portal
Publication:6139330
DOI10.1007/s13160-023-00585-8zbMath1530.94007OpenAlexW4365815086MaRDI QIDQ6139330
No author found.
Publication date: 18 January 2024
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-023-00585-8
Ill-posedness and regularization problems in numerical linear algebra (65F22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Sampling theory in information and communication theory (94A20) Numerical solution to inverse problems in abstract spaces (65J22)
Cites Work
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Iterative hard thresholding for compressed sensing
- The restricted isometry property and its implications for compressed sensing
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Performance of Orthogonal Multi-Matching Pursuit under the Restricted Isometry Property
- 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
- Uncertainty principles and ideal atomic decomposition
- Generalized Orthogonal Matching Pursuit
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- Sparse Activity Detection for Massive Connectivity
- Binary sparse signal recovery with binary matching pursuit *
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Compressed sensing
This page was built for publication: Binary generalized orthogonal matching pursuit
