Comparison of Orthogonal Matching Pursuit Implementations

Bob L. Sturm; Mads Græsbøll Christensen

Comparison of Orthogonal Matching Pursuit Implementations

Bob L. Sturm, Mads Græsbøll Christensen

Research output: Contribution to journal › Conference article in Journal › Research › peer-review

94 Citations (Scopus)

656 Downloads (Pure)

Abstract

We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane.

Original language	English
Journal	Proceedings of the European Signal Processing Conference
Volume	2012
Pages (from-to)	220-224
Number of pages	5
ISSN	2076-1465
Publication status	Published - 2012
Event	EUSIPCO2012 - Bucharest, Romania Duration: 27 Aug 2012 → …

Conference

Conference	EUSIPCO2012
Country/Territory	Romania
City	Bucharest
Period	27/08/2012 → …

Access to Document

paperAccepted author manuscript, 511 KB

http://www.scopus.com/inward/record.url?eid=2-s2.0-84869778651&partnerID=40&md5=03f164712a4d409cb56ebce8ed0d1c43

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{817c3a19acd247a38141c36ca95f8229,

title = "Comparison of Orthogonal Matching Pursuit Implementations",

abstract = "We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane.",

author = "Sturm, {Bob L.} and Christensen, {Mads Gr{\ae}sb{\o}ll}",

year = "2012",

language = "English",

volume = "2012",

pages = "220--224",

journal = "Proceedings of the European Signal Processing Conference",

issn = "2076-1465",

publisher = "European Association for Signal Processing (EURASIP)",

note = "EUSIPCO2012 ; Conference date: 27-08-2012",

}

TY - GEN

T1 - Comparison of Orthogonal Matching Pursuit Implementations

AU - Sturm, Bob L.

AU - Christensen, Mads Græsbøll

PY - 2012

Y1 - 2012

N2 - We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane.

AB - We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane.

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

M3 - Conference article in Journal

SN - 2076-1465

VL - 2012

SP - 220

EP - 224

JO - Proceedings of the European Signal Processing Conference

JF - Proceedings of the European Signal Processing Conference

T2 - EUSIPCO2012

Y2 - 27 August 2012

ER -

Comparison of Orthogonal Matching Pursuit Implementations

Abstract

Conference

Access to Document

AUB Link

Other files and links

Fingerprint

Greedy Sparse Approximation and the Automatic Description of Audio and Music Data

Cite this

Comparison of Orthogonal Matching Pursuit Implementations

Abstract

Conference

Access to Document

AUB Link

Other files and links

Fingerprint

Projects

Greedy Sparse Approximation and the Automatic Description of Audio and Music Data

Cite this