Orthogonal-Matching-Pursuit-Algorithm

Matching pursuit (MP) is a sparse approximation algorithm which involves finding the "best matching" projections of multidimensional data onto the span of an over-complete (i.e., redundant) dictionary {\displaystyle D} D. The cole is written in Matlab.