Abstract:The matching pursuit algorithm of Mallat et.al. is discussed in the context of discretized Gabor functions on an interval. Results from frame theory are used to introduce corresponding finite dictionaries. We then proceed to describe two software implementations based on these dictionaries. One implementation allows for users to have great flexibility in the Gabor dictionary to be used. This is a useful improvement over other implementations which only allow for a fixed dictionary. The other implementation takes advantage of the FFT algorithm and is faster. These implementations are written in C++, and can be used in many practical situations given its flexibility and generality.

Keywords: Matching Pursuit. Gabor dictionary. C++. Fast Fourier Transform.