Greedy sparse decompositions: a comparative study - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue EURASIP Journal on Advances in Signal Processing Année : 2011

Greedy sparse decompositions: a comparative study

Résumé

The purpose of this article is to present a comparative study of sparse greedy algorithms that were separately introduced in speech and audio research communities. It is particularly shown that the Matching Pursuit (MP) family of algorithms (MP, OMP, and OOMP) are equivalent to multi-stage gain-shape vector quantization algorithms previously designed for speech signals coding. These algorithms are comparatively evaluated and their merits in terms of trade-off between complexity and performances are discussed. This article is completed by the introduction of the novel methods that take their inspiration from this unified view and recent study in audio sparse decomposition.
Fichier principal
Vignette du fichier
EURASIP_JASP2011.pdf (562.04 Ko) Télécharger le fichier
Origine Publication financée par une institution
Loading...

Dates et versions

hal-02653068 , version 1 (29-05-2020)

Licence

Identifiants

  • HAL Id : hal-02653068 , version 1

Citer

Przemyslaw Dymarski, Nicolas Moreau, Gael Richard. Greedy sparse decompositions: a comparative study. EURASIP Journal on Advances in Signal Processing, 2011. ⟨hal-02653068⟩
23 Consultations
58 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More