Dictionary preconditioning for greedy algorithms

This article presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries. These algorithms can be split into a sensing and a reconstruction step, and the former will fail to identify correct atoms if the cumulative coherence of the dictionary is too high. We thus modify the sensing step by introducing a special sensing matrix, also referred to as a measurement ensemble. The correct selection of components is then determined by the


Published in:
IEEE Transactions on Signal Processing, 56, 5, 1994-2002
Year:
2008
Keywords:
Other identifiers:
Laboratories:




 Record created 2006-10-27, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)