This research demonstrates recovery of block sparse vectors using greedy algorithms, indicating new conditions for solution sparsity.
This article looks at the non-uniform block versions of the orthogonal and threshold greedy algorithms for non-uniform finite wavelet frame transforms. A sufficient condition for greedy methods to recover a block No sparse vector is given. In addition, Bspark, a block form of a matrix’s spark, is also defined and provides a sufficient condition for the sparsest solution.
No takes yet. Share an insight, caveat, or question.
Deep et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: