SPARSE APPROXIMATION WITH BLOCK INCOHERENT DICTIONARIES

Abstract: this paper, we basically relax some of these strong hypotheses by allowing more redundancy in the dictionaries, through theconcept of block incoherence, which basically describes a dictionary that can be represented as the union of incoherent blocks.We show that even pure greedy algorithms can strongly benefit from such design by proving a recovery condition under whichMatching Pursuit will always pick up correct atoms during the signal expansion. Based on this result, we design an...