Dictionary learning with spatio-spectral sparsity constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Dictionary learning with spatio-spectral sparsity constraints


Devising efficient sparse decomposition algorithms in large redundant dictionaries has attracted much attention recently. However, choosing the right dictionary for a given data set remains an issue. An interesting approach is to learn the best dictionary from the data itself. The purpose of this contribution is to describe a new dictionary learning algorithm for multichannel data analysis purposes under specific assumptions. We assume a large number of contiguous channels as in so-called hyperspectral data. In this case it makes sense to consider a priori that the collected data exhibits sparse spectral signatures and sparse spatial morphologies in specified dictionaries of spectral and spatial waveforms. Building on GMCA, the proposed algorithm gives a practical way to enforce the additional a priori spectral sparsity constraint on the dictionary space. Numerical experiments with synthetic and real hyperspectral data illustrate the efficiency of the proposed algorithm.
Fichier principal
Vignette du fichier
24.pdf (566.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00369488 , version 1 (20-03-2009)


  • HAL Id : inria-00369488 , version 1


Yassir Moudden, Jérome Bobin, Jean-Luc Starck, Jalal M. Fadili. Dictionary learning with spatio-spectral sparsity constraints. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France. ⟨inria-00369488⟩
280 View
231 Download


Gmail Facebook X LinkedIn More