Matching pursuit
From Wikipedia, the free encyclopedia
Matching pursuit is a type of numerical technique which involves finding the most "interesting" possible projections in multidimensional data. It is inspired by Projection pursuit, and projections which deviate more from a Normal distribution are considered to be more interesting.
[edit] References
1. S. G. Mallat and Z. Zhang, "Matching Pursuits with Time-Frequency Dictionaries", IEEE Transactions on Signal Processing, December 1993, pp. 3397-3415.
[edit] See also
- Principal component analysis (PCA)
- Projection pursuit
- Redundancy reduction