Description: A matching pursuit algorithm. It fits data from a set of dictionary
elements by orthogonally projecting the data onto elements of the
dictionary of vectors such that the energy in each projection is
maximized. In constrast to G-S, the residual is orthogonalized, not
the basis vectors
File list (Check if you may need any files):
matchingpursuit.m