Fast basis selection methods

Shane F. Cotter, Manohar N. Murthi, B. D. Rao

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


In this paper three methods of basis selection are considered: Basic Matching Pursuit (BMP), Order Recursive Matching Pursuit (ORMP) and Modified Matching Pursuit (MMP). These algorithms are briefly described and particular attention is paid, in the formulation of these algorithms, to the computation required. Fast versions of the algorithms are developed. The algorithms are evaluated in terms of their ability to produce a sparse solution and also in terms of their computational complexity and the storage necessary to implement them. Complexity-wise, BMP and MMP are shown to be comparable while ORMP is the most complex. In terms of their ability to select basis vectors, ORMP was the best followed by MMP and then BMP.

Original languageEnglish (US)
Pages (from-to)1474-1478
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
StatePublished - Jan 1 1998
Externally publishedYes
EventProceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) - Pacific Grove, CA, USA
Duration: Nov 2 1997Nov 5 1997

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications


Dive into the research topics of 'Fast basis selection methods'. Together they form a unique fingerprint.

Cite this