Sparse Decomposition of Two Dimensional Signals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Sparse Decomposition of Two Dimensional Signals

Résumé

In this paper, we consider sparse decomposition (SD) of twodimensional (2D) signals on overcomplete dictionaries with separable atoms. Although, this problem can be solved by converting it to the SD of one-dimensional (1D) signals, this approach requires a tremendous amount of memory and computational cost. Moreover, the uniqueness constraint obtained by this approach is too restricted. Then in the paper, we present an algorithm to be used directly for sparse decomposition of 2D signals on dictionaries with separable atoms. Moreover, we will state another uniqueness constraint for this class of decomposition. Our algorithm is obtained by modifying the Smoothed L0 (SL0) algorithm, and hence we call it two-dimensional SL0 (2D-SL0).
Fichier principal
Vignette du fichier
ICASSP2009_2DSD_GhaffariBJ.pdf (228.82 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00400464 , version 1 (30-06-2009)

Identifiants

  • HAL Id : hal-00400464 , version 1

Citer

A. Ghafari, Massoud Babaie-Zadeh, Christian Jutten. Sparse Decomposition of Two Dimensional Signals. ICASSP 2009 - IEEE International Conference on Acoustics, Speech and Signal Processing, Apr 2009, Taipei, Taiwan. pp.3157-3160. ⟨hal-00400464⟩
187 Consultations
605 Téléchargements

Partager

Gmail Facebook X LinkedIn More