High Resolution Pursuit for Feature Extraction

  • Jaggi S
  • Karl W
  • Mallat S
 et al. 
  • 31


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Recently, adaptive approximation techniques have become popular for ob-taining parsimonious representations of large classes of signals. These methods include method of frames, matching pursuit, and, most recently, basis pursuit. In this work, high resolution pursuit (HRP) is developed as an alternative to existing function approximation techniques. Existing techniques do not always efficiently yield representations which are sparse and physically interpretable. HRP is an enhanced version of the matching pursuit algorithm and overcomes the shortcomings of the traditional matching pursuit algorithm by emphasizing local fit over global fit at each stage. Further, the HRP algorithm has the same order of complexity as matching pursuit. In this paper, the HRP algorithm is

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in


  • Seema Jaggi

  • William C Karl

  • Stéphane Mallat

  • Alan S Willsky

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free