Fast basis selection methods

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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)
Title of host publicationConference Record of the Asilomar Conference on Signals, Systems and Computers
EditorsM.P. Farques, R.D. Hippenstiel
PublisherIEEE Comp Soc
Pages1474-1478
Number of pages5
Volume2
StatePublished - 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

Other

OtherProceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2)
CityPacific Grove, CA, USA
Period11/2/9711/5/97

Fingerprint

Computational complexity

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Cotter, S. F., Murthi, M., & Rao, B. D. (1998). Fast basis selection methods. In M. P. Farques, & R. D. Hippenstiel (Eds.), Conference Record of the Asilomar Conference on Signals, Systems and Computers (Vol. 2, pp. 1474-1478). IEEE Comp Soc.

Fast basis selection methods. / Cotter, Shane F.; Murthi, Manohar; Rao, B. D.

Conference Record of the Asilomar Conference on Signals, Systems and Computers. ed. / M.P. Farques; R.D. Hippenstiel. Vol. 2 IEEE Comp Soc, 1998. p. 1474-1478.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cotter, SF, Murthi, M & Rao, BD 1998, Fast basis selection methods. in MP Farques & RD Hippenstiel (eds), Conference Record of the Asilomar Conference on Signals, Systems and Computers. vol. 2, IEEE Comp Soc, pp. 1474-1478, Proceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2), Pacific Grove, CA, USA, 11/2/97.
Cotter SF, Murthi M, Rao BD. Fast basis selection methods. In Farques MP, Hippenstiel RD, editors, Conference Record of the Asilomar Conference on Signals, Systems and Computers. Vol. 2. IEEE Comp Soc. 1998. p. 1474-1478
Cotter, Shane F. ; Murthi, Manohar ; Rao, B. D. / Fast basis selection methods. Conference Record of the Asilomar Conference on Signals, Systems and Computers. editor / M.P. Farques ; R.D. Hippenstiel. Vol. 2 IEEE Comp Soc, 1998. pp. 1474-1478
@inproceedings{17c8d9adf585421883fda3677fa747f6,
title = "Fast basis selection methods",
abstract = "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.",
author = "Cotter, {Shane F.} and Manohar Murthi and Rao, {B. D.}",
year = "1998",
language = "English (US)",
volume = "2",
pages = "1474--1478",
editor = "M.P. Farques and R.D. Hippenstiel",
booktitle = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - Fast basis selection methods

AU - Cotter, Shane F.

AU - Murthi, Manohar

AU - Rao, B. D.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031676933&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031676933&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 1474

EP - 1478

BT - Conference Record of the Asilomar Conference on Signals, Systems and Computers

A2 - Farques, M.P.

A2 - Hippenstiel, R.D.

PB - IEEE Comp Soc

ER -