Comparison of Orthogonal Matching Pursuit Implementations

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

58 Citationer (Scopus)
500 Downloads (Pure)

Abstrakt

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 → …

Fingeraftryk Dyk ned i forskningsemnerne om 'Comparison of Orthogonal Matching Pursuit Implementations'. Sammen danner de et unikt fingeraftryk.

Citationsformater