New l2- and l1-based greedy algorithms derived from a solution characterization outperform classical OMP and basis pursuit on synthetic and image data.
Greed is good: Algorithmic results for sparse approximation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On A Class of Greedy Sparse Recovery Algorithms
New l2- and l1-based greedy algorithms derived from a solution characterization outperform classical OMP and basis pursuit on synthetic and image data.