Average Case Analysis of Multichannel Thresholding

Rémi Gribonval, Boris Mailhé, Holger Rauhut, Karin Schnass, Pierre Vandergheynst

Abstract

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter results in much weaker conditions on the dictionary. Numerical simulations confirm our theoretical findings and show that p-thresholding is an interesting low complexity alternative to simultaneous greedy, or convex relaxation algorithms for processing sparse multichannel signals with balanced coefficients.
BibTeX
@inproceedings{gribonval2007average,
  author = {Rémi Gribonval and Boris Mailhé and Holger Rauhut and Karin Schnass and Pierre Vandergheynst},
  title = {{Average Case Analysis of Multichannel Thresholding}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2007},
  doi = {10.1109/icassp.2007.366370},
}

Loading related content...

Figure