Greedy algorithm that selects atoms with the highest energy from residual signal components and iteratively decomposes them into linear combinations through removal
Matching pursuit variants
Matching pursuit
Matching pursuit (MP) is a sparse approximation algorithm which finds the "best matching" projections of multidimensional data onto the span of an over-complete dictionary . The basic idea is to approximately represent a signal from Hilbert space as a weighted sum of finitely many functions taken from . An approximation with atoms has the form
https://en.wikipedia.org/wiki/Matching_pursuit


Seonglae Cho