Comparison of Orthogonal Matching Pursuit Implementations

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

37 Citationer (Scopus)
456 Downloads (Pure)

Resumé

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.
OriginalsprogEngelsk
TidsskriftProceedings of the European Signal Processing Conference
Vol/bind2012
Sider (fra-til)220-224
Antal sider5
ISSN2076-1465
StatusUdgivet - 2012
BegivenhedEUSIPCO2012 - Bucharest, Rumænien
Varighed: 27 aug. 2012 → …

Konference

KonferenceEUSIPCO2012
LandRumænien
ByBucharest
Periode27/08/2012 → …

Fingerprint

Decomposition

Citer dette

@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)",

}

Comparison of Orthogonal Matching Pursuit Implementations. / Sturm, Bob L.; Christensen, Mads Græsbøll.

I: Proceedings of the European Signal Processing Conference, Bind 2012, 2012, s. 220-224.

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

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

VL - 2012

SP - 220

EP - 224

JO - Proceedings of the European Signal Processing Conference

JF - Proceedings of the European Signal Processing Conference

SN - 2076-1465

ER -