Random time-frequency Subdictionary design for sparse representation with greedy algorithms - IMT - Institut Mines-Télécom Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

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

Résumé

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.
Fichier principal
Vignette du fichier
moussall_icassp12.pdf (522.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00696187 , version 1 (11-05-2012)

Identifiants

  • HAL Id : hal-00696187 , version 1

Citer

Manuel Moussallam, Laurent Daudet, Gael Richard. Random time-frequency Subdictionary design for sparse representation with greedy algorithms. ICASSP, Mar 2012, Kyoto, Japan. pp.3577-3580. ⟨hal-00696187⟩
217 Consultations
158 Téléchargements

Partager

Gmail Facebook X LinkedIn More