Matching pursuit

This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (June 2023) (Learn how and when to remove this message)

Matching pursuit (MP) is a sparse approximation algorithm which finds the "best matching" projections of multidimensional data onto the span of an over-complete (i.e., redundant) dictionary ${\displaystyle D}$. The basic idea is to approximately represent a signal ${\displaystyle f}$ from Hilbert space ${\displaystyle H}$ as a weighted sum of finitely many functions ${\displaystyle g_{\gamma _{n}}}$ (called atoms) taken from ${\displaystyle D}$. An approximation with ${\displaystyle N}$ atoms has the form

${\displaystyle f(t)\approx {\hat {f}}_{N}(t):=\sum _{n=1}^{N}a_{n}g_{\gamma _{n}}(t)}$

where ${\displaystyle g_{\gamma _{n}}}$ is the ${\displaystyle \gamma _{n}}$th column of the matrix ${\displaystyle D}$ and ${\displaystyle a_{n}}$ is the scalar weighting factor (amplitude) for the atom ${\displaystyle g_{\gamma _{n}}}$. Normally, not every atom in ${\displaystyle D}$ will be used in this sum. Instead, matching pursuit chooses the atoms one at a time in order to maximally (greedily) reduce the approximation error. This is achieved by finding the atom that has the highest inner product with the signal (assuming the atoms are normalized), subtracting from the signal an approximation that uses only that one atom, and repeating the process until the signal is satisfactorily decomposed, i.e., the norm of the residual is small, where the residual after calculating ${\displaystyle \gamma _{N}}$ and ${\displaystyle a_{N}}$ is denoted by

${\displaystyle R_{N+1}=f-{\hat {f}}_{N}}$.

If ${\displaystyle R_{n}}$ converges quickly to zero, then only a few atoms are needed to get a good approximation to ${\displaystyle f}$. Such sparse representations are desirable for signal coding and compression. More precisely, the sparsity problem that matching pursuit is intended to approximately solve is

${\displaystyle \min _{x}\|f-Dx\|_{2}^{2}\ {\text{ subject to }}\ \|x\|_{0}\leq N,}$

where ${\displaystyle \|x\|_{0}}$ is the ${\displaystyle L_{0}}$ pseudo-norm (i.e. the number of nonzero elements of ${\displaystyle x}$). In the previous notation, the nonzero entries of ${\displaystyle x}$ are ${\displaystyle x_{\gamma _{n}}=a_{n}}$. Solving the sparsity problem exactly is NP-hard, which is why approximation methods like MP are used.

For comparison, consider the Fourier transform representation of a signal - this can be described using the terms given above, where the dictionary is built from sinusoidal basis functions (the smallest possible complete dictionary). The main disadvantage of Fourier analysis in signal processing is that it extracts only the global features of the signals and does not adapt to the analysed signals ${\displaystyle f}$. By taking an extremely redundant dictionary, we can look in it for atoms (functions) that best match a signal ${\displaystyle f}$.

If ${\displaystyle D}$ contains a large number of vectors, searching for the most sparse representation of ${\displaystyle f}$ is computationally unacceptable for practical applications. In 1993, Mallat and Zhang^[1] proposed a greedy solution that they named "Matching Pursuit." For any signal ${\displaystyle f}$ and any dictionary ${\displaystyle D}$, the algorithm iteratively generates a sorted list of atom indices and weighting scalars, which form the sub-optimal solution to the problem of sparse signal representation.

Algorithm Matching Pursuit  Input: Signal: ${\displaystyle f(t)}$, dictionary ${\displaystyle D}$ with normalized columns ${\displaystyle g_{i}}$.  Output: List of coefficients ${\displaystyle (a_{n})_{n=1}^{N}}$ and indices for corresponding atoms ${\displaystyle (\gamma _{n})_{n=1}^{N}}$.  Initialization:    ${\displaystyle R_{1}\,\leftarrow \,f(t)}$;    ${\displaystyle n\,\leftarrow \,1}$;  Repeat:    Find ${\displaystyle g_{\gamma _{n}}\in D}$ with maximum inner product ${\displaystyle |\langle R_{n},g_{\gamma _{n}}\rangle |}$;    ${\displaystyle a_{n}\,\leftarrow \,\langle R_{n},g_{\gamma _{n}}\rangle }$;    ${\displaystyle R_{n+1}\,\leftarrow \,R_{n}-a_{n}g_{\gamma _{n}}}$;    ${\displaystyle n\,\leftarrow \,n+1}$;  Until stop condition (for example: ${\displaystyle \|R_{n}\|<\mathrm {threshold} }$)  return 

In signal processing, the concept of matching pursuit is related to statistical projection pursuit, in which "interesting" projections are found; ones that deviate more from a normal distribution are considered to be more interesting.

• The algorithm converges (i.e. ${\displaystyle R_{n}\to 0}$) for any ${\displaystyle f}$ that is in the space spanned by the dictionary.
• The error ${\displaystyle \|R_{n}\|}$ decreases monotonically.
• As at each step, the residual is orthogonal to the selected filter, the energy conservation equation is satisfied for each ${\displaystyle N}$:

${\displaystyle \|f\|^{2}=\|R_{N+1}\|^{2}+\sum _{n=1}^{N}{|a_{n}|^{2}}}$.

• In the case that the vectors in ${\displaystyle D}$ are orthonormal, rather than being redundant, then MP is a form of principal component analysis

Matching pursuit has been applied to signal, image^[2] and video coding,^[3][4] shape representation and recognition,^[5] 3D objects coding,^[6] and in interdisciplinary applications like structural health monitoring.^[7] It has been shown that it performs better than DCT based coding for low bit rates in both efficiency of coding and quality of image.^[8] The main problem with matching pursuit is the computational complexity of the encoder. In the basic version of an algorithm, the large dictionary needs to be searched at each iteration. Improvements include the use of approximate dictionary representations and suboptimal ways of choosing the best match at each iteration (atom extraction).^[9] The matching pursuit algorithm is used in MP/SOFT, a method of simulating quantum dynamics.^[10]

MP is also used in dictionary learning.^[11][12] In this algorithm, atoms are learned from a database (in general, natural scenes such as usual images) and not chosen from generic dictionaries.

A very recent application of MP is its use in linear computation coding^[13] to speed-up the computation of matrix-vector products.

A popular extension of Matching Pursuit (MP) is its orthogonal version: Orthogonal Matching Pursuit^[14][15] (OMP). The main difference from MP is that after every step, all the coefficients extracted so far are updated, by computing the orthogonal projection of the signal onto the subspace spanned by the set of atoms selected so far. This can lead to results better than standard MP, but requires more computation. OMP was shown to have stability and performance guarantees under certain restricted isometry conditions.^[16] The incremental multi-parameter algorithm (IMP), published three years before MP, works in the same way as OMP.^[17]

Extensions such as Multichannel MP^[18] and Multichannel OMP^[19] allow one to process multicomponent signals. An obvious extension of Matching Pursuit is over multiple positions and scales, by augmenting the dictionary to be that of a wavelet basis. This can be done efficiently using the convolution operator without changing the core algorithm.^[20]

Matching pursuit is related to the field of compressed sensing and has been extended by researchers in that community. Notable extensions are Orthogonal Matching Pursuit (OMP),^[21] Stagewise OMP (StOMP),^[22] compressive sampling matching pursuit (CoSaMP),^[23] Generalized OMP (gOMP),^[24] and Multipath Matching Pursuit (MMP).^[25]

• CLEAN algorithm
• Image processing
• Least-squares spectral analysis
• Principal component analysis (PCA)
• Projection pursuit
• Signal processing
• Sparse approximation
• Stepwise regression