DocumentCode
1661022
Title
Adaptive selection of search space in look ahead orthogonal matching pursuit
Author
Ambat, Sooraj K. ; Chatterjee, Saikat ; Hari, K.V.S.
Author_Institution
Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India
fYear
2012
Firstpage
1
Lastpage
5
Abstract
Compressive Sensing theory combines the signal sampling and compression for sparse signals resulting in reduction in sampling rate and computational complexity of the measurement system. In recent years, many recovery algorithms were proposed to reconstruct the signal efficiently. Look Ahead OMP (LAOMP) is a recently proposed method which uses a look ahead strategy and performs significantly better than other greedy methods. In this paper, we propose a modification to the LAOMP algorithm to choose the look ahead parameter L adaptively, thus reducing the complexity of the algorithm, without compromising on the performance. The performance of the algorithm is evaluated through Monte Carlo simulations.
Keywords
Monte Carlo methods; computational complexity; search problems; signal sampling; Monte Carlo simulations; adaptive selection; compressive sensing theory; computational complexity; greedy methods; look ahead OMP; look ahead orthogonal matching pursuit; look ahead strategy; measurement system; recovery algorithms; sampling rate; search space; signal sampling; sparse signal compression; Atomic measurements; Computational complexity; Indexes; Matching pursuit algorithms; Noise measurement; Signal processing; Signal processing algorithms; Compressed sensing; Matching Pursuit Algorithms; Sparse Recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (NCC), 2012 National Conference on
Conference_Location
Kharagpur
Print_ISBN
978-1-4673-0815-1
Type
conf
DOI
10.1109/NCC.2012.6176852
Filename
6176852
Link To Document