Fast basis selection methods

S.F Cotter; M.N Murthi; B.D Rao

doi:10.1109/ACSSC.1997.679149

Back

Conference proceeding

Fast basis selection methods

S.F Cotter, M.N Murthi and B.D Rao

Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136), Vol.2, pp.1474-1478 vol.2

1997

DOI: https://doi.org/10.1109/ACSSC.1997.679149

Abstract

Video coding

Algorithm design and analysis

Filters

Speech coding

Matching pursuit algorithms

Time frequency analysis

Vectors

Computational complexity

Pursuit algorithms

Signal design

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.

Metrics

12 Record Views

Details

Title: Fast basis selection methods
Creators: S.F Cotter - Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
M.N Murthi
B.D Rao
Publication Details: Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136), Vol.2, pp.1474-1478 vol.2
Publisher: IEEE
Academic Unit: College of Engineering; CoE - Electrical & Computer Engineering
Language: English
Resource Type: Conference proceeding
Record Identifier: 991031600184202976