On sparse recovery algorithms in unions of orthonormal bases
From MaRDI portal
Publication:2696630
DOI10.1016/j.jat.2023.105886OpenAlexW4323351176MaRDI QIDQ2696630
Publication date: 17 April 2023
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2023.105886
Cites Work
- Unnamed Item
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- On the stability of the basis pursuit in the presence of noise
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- Atomic Decomposition by Basis Pursuit
- UNITARY OPERATOR BASES
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- ON MUTUALLY UNBIASED BASES
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Uncertainty principles and ideal atomic decomposition
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- A generalized uncertainty principle and sparse representation in pairs of bases
- On sparse representation in pairs of bases
- Sparse Approximate Solutions to Linear Systems
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- An Open Problem on Sparse Representations in Unions of Bases
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Compressed sensing
- Adaptive greedy approximations
This page was built for publication: On sparse recovery algorithms in unions of orthonormal bases
