DocumentCode
1685477
Title
Knowledge-enhanced Matching Pursuit
Author
Yuejie Chi ; Calderbank, R.
Author_Institution
Electr. & Comput. Eng., Ohio State Univ., Columbus, OH, USA
fYear
2013
Firstpage
6576
Lastpage
6580
Abstract
Compressive Sensing is possible when the sensing matrix acts as a near isometry on signals of interest that can be sparsely or compressively represented. The attraction of greedy algorithms such as Orthogonal Matching Pursuit is their simplicity. However they fail to take advantage of both the structure of the sensing matrix and any prior information about the sparse signal. This paper introduces an oblique projector to matching pursuit algorithms to enhance detection of a component that is present in the signal by reducing interference from other candidate components based on prior information about the signal as well as the structure of the sensing matrix. Numerical examples demonstrate that performance as a function of SNR is superior to conventional matching pursuit.
Keywords
compressed sensing; greedy algorithms; interference suppression; matrix algebra; pattern matching; signal representation; SNR; component detection enhancement; compressive representation; compressive sensing; greedy algorithms; interference reduction; knowledge-enhanced matching pursuit; matching pursuit algorithms; oblique projector; orthogonal matching pursuit; sensing matrix; sparse representation; sparse signal; Coherence; Matching pursuit algorithms; Optimization; Sensors; Signal to noise ratio; Sparse matrices; matching pursuit; oblique projection; sparsity; support recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on
Conference_Location
Vancouver, BC
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2013.6638933
Filename
6638933
Link To Document