Two greedy hybrid compressed sensing algorithms are proposed, but their stated success-probability theorems assume an n-th order restricted isometry property that cannot hold when the number of measurements is less than the signal dimension.
Compressed sensing,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Greedy Algorithms for Hybrid Compressed Sensing
Two greedy hybrid compressed sensing algorithms are proposed, but their stated success-probability theorems assume an n-th order restricted isometry property that cannot hold when the number of measurements is less than the signal dimension.