Random time-frequency Subdictionary design for sparse representation with greedy algorithms

Abstract :

Sparse signal approximation can be used to design efficient low bit-rate coding schemes. It heavily relies on the ability to design appropriate dictionaries and corresponding decomposition algorithms. The size of the dictionary, and therefore its resolution, is a key parameter that handles the tradeoff between sparsity and tractability. This work proposes the use of a non adaptive random sequence of subdictionaries in a greedy decomposition process, thus browsing a larger dictionary space in a probabilistic fashion with no additional projection cost nor parameter estimation. This technique leads to very sparse decompositions, at a controlled computational complexity. Experimental evaluation is provided as proof of concept for low bit rate compression of audio signals.

Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal-imt.archives-ouvertes.fr/hal-00696187
Contributeur : Admin Télécom Paristech <>
Soumis le : vendredi 11 mai 2012 - 13:19:54
Dernière modification le : jeudi 11 janvier 2018 - 06:23:39
Document(s) archivé(s) le : dimanche 12 août 2012 - 02:22:17

Fichier

moussall_icassp12.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00696187, version 1

Collections

Citation

Manuel Moussallam, Laurent Daudet, Gaël Richard. Random time-frequency Subdictionary design for sparse representation with greedy algorithms. ICASSP, Mar 2012, Kyoto, Japan. pp.3577-3580, 2012. 〈hal-00696187〉

Partager

Métriques

Consultations de la notice

373

Téléchargements de fichiers

131