Fast Matching Pursuit with Multi-Gabor Dictionaries

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…