12 citations · 36 across the 13 of their papers we have counts for
1 paper · 1 filter
Zdeněk Průša, Nicki Holighaus, Peter Balazs
Finding the best K-sparse approximation of a signal in a redundant dictionary is an NP-hard problem. Suboptimal greedy matching pursuit (MP) algorithms are generally used for this…