DocumentCode
1849091
Title
Comparison of orthogonal matching pursuit implementations
Author
Sturm, Bob L. ; Christensen, Mads Græsbøll
Author_Institution
Dept. of Archit., Design & Media Technol., Aalborg Univ., Aalborg, Denmark
fYear
2012
fDate
27-31 Aug. 2012
Firstpage
220
Lastpage
224
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.
Keywords
error analysis; matrix decomposition; signal sampling; Cholesky matrix decomposition; QR matrix decomposition; computational performance; matrix inversion lemma; numerical error accumulation; numerical performance; orthogonal matching pursuit implementations; phase plane; Computational complexity; Dictionaries; Matching pursuit algorithms; Matrix decomposition; Memory management; Signal processing algorithms; Orthogonal matching pursuit; algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
Conference_Location
Bucharest
ISSN
2219-5491
Print_ISBN
978-1-4673-1068-0
Type
conf
Filename
6333943
Link To Document