A fast orthogonal matching pursuit algorithm

Mohammad Gharavi-Alkhansari; Thomas S Huang

doi:10.1109/ICASSP.1998.681706

A fast orthogonal matching pursuit algorithm

Mohammad Gharavi-Alkhansari, Thomas S Huang

Coordinated Science Lab

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has a computational complexity very close to that of the nonorthogonal version.

Original language	English (US)
Title of host publication	Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998
Pages	1389-1392
Number of pages	4
DOIs	https://doi.org/10.1109/ICASSP.1998.681706
State	Published - Dec 1 1998
Event	1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 - Seattle, WA, United States Duration: May 12 1998 → May 15 1998

Publication series

Name	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	3
ISSN (Print)	1520-6149

Other

Other	1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998
Country	United States
City	Seattle, WA
Period	5/12/98 → 5/15/98

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

Access to Document

10.1109/ICASSP.1998.681706

Fingerprint Dive into the research topics of 'A fast orthogonal matching pursuit algorithm'. Together they form a unique fingerprint.

Cite this

Gharavi-Alkhansari, M., & Huang, T. S. (1998). A fast orthogonal matching pursuit algorithm. In Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 (pp. 1389-1392). [681706] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 3). https://doi.org/10.1109/ICASSP.1998.681706

A fast orthogonal matching pursuit algorithm. / Gharavi-Alkhansari, Mohammad; Huang, Thomas S.

Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998. 1998. p. 1389-1392 681706 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gharavi-Alkhansari, M & Huang, TS 1998, A fast orthogonal matching pursuit algorithm. in Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998., 681706, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, vol. 3, pp. 1389-1392, 1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998, Seattle, WA, United States, 5/12/98. https://doi.org/10.1109/ICASSP.1998.681706

@inproceedings{591e11f24c0d478ea4b94f3ef233e75c,

title = "A fast orthogonal matching pursuit algorithm",

abstract = "The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has a computational complexity very close to that of the nonorthogonal version.",

author = "Mohammad Gharavi-Alkhansari and Huang, {Thomas S}",

year = "1998",

month = dec,

day = "1",

doi = "10.1109/ICASSP.1998.681706",

language = "English (US)",

isbn = "0780344286",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

pages = "1389--1392",

booktitle = "Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998",

note = "1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 ; Conference date: 12-05-1998 Through 15-05-1998",

}

TY - GEN

T1 - A fast orthogonal matching pursuit algorithm

AU - Gharavi-Alkhansari, Mohammad

AU - Huang, Thomas S

PY - 1998/12/1

Y1 - 1998/12/1

N2 - The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has a computational complexity very close to that of the nonorthogonal version.

AB - The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has a computational complexity very close to that of the nonorthogonal version.

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

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

U2 - 10.1109/ICASSP.1998.681706

DO - 10.1109/ICASSP.1998.681706

M3 - Conference contribution

AN - SCOPUS:0031625503

SN - 0780344286

SN - 9780780344280

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 1389

EP - 1392

BT - Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998

T2 - 1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998

Y2 - 12 May 1998 through 15 May 1998

ER -

A fast orthogonal matching pursuit algorithm

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this