inria-00544981, version 1
Average case analysis of multichannel sparse approximations using p-thresholding
Karin Schnass 1Pierre Vandergheynst 1Rémi Gribonval
a, 2Holger Rauhut
3
SPIE Optics and Photonics, Wavelet XII, 6701 (2007)
Résumé : 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.
- a – INRIA
- 1 : LTS2 - EPFL
- École Polytechnique Fédérale de Lausanne
- 2 : METISS (INRIA - IRISA)
- CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées (INSA) - Rennes – Université de Rennes 1
- 3 : Faculty of Mathematics
- University of Vienna
- Domaine : Informatique/Traitement du signal et de l'image
Sciences de l'ingénieur/Traitement du signal et de l'image
- Mots-clés : sparse approximations – greedy algorithms – multichannel signal processing – thresholding
- inria-00544981, version 1
- http://hal.inria.fr/inria-00544981
- oai:hal.inria.fr:inria-00544981
- Contributeur : Rémi Gribonval
- Soumis le : Lundi 7 Février 2011, 21:26:31
- Dernière modification le : Mardi 8 Février 2011, 08:21:10