Skip to search formSkip to main contentSkip to account menu

Matching pursuit

Matching pursuit (MP) is a sparse approximation algorithm which involves finding the "best matching" projections of multidimensional data onto the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In this paper, we introduce the iterative subspace identification (ISI) algorithm for learning subspaces in which the data may… 
2008
2008
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a… 
2004
2004
We propose methodologies to automatically classify time-varying warning signals from an acoustic monitoring system that indicate… 
2001
2001
In a companion paper [5] we resolved the question of whether cyclic pursuits can exhibit ‘non-mutual’ captures. Although, as we… 
1996
1996
Sound recordings include transients and sustained parts. Their analysis with a basis expansion is not rich enough to represent… 
1994
1994
The by now well-known matching pursuit method of S. Mallat as well as the recently proposed orthogonal matching pursuit work… 
1994
1994
  • P. Phillips
  • 1994
  • Corpus ID: 46949668
A method has been devised of using localized information to detect objects with varying signatures without prior segmentation…