Learning Dictionaries as Sums of Kronecker Products - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Documents Associated With Scientific Events Year : 2017

Learning Dictionaries as Sums of Kronecker Products


The choice of an appropriate dictionary is a crucial step in the sparse representation of a given class of signals. Traditional dictionary learning techniques generally lead to unstructured dictionaries which are costly to deploy and do not scale well to higher dimensional signals. In order to overcome such limitation, we propose a learning algorithm that constrains the dictionary to be a sum of Kronecker products of smaller sub-dictionaries. A special case of the proposed structure is the widespread separable dictionary. This approach, named SuKro, is evaluated experimentally on an image denoising application.
Fichier principal
Vignette du fichier
SPARS_abstract.pdf (81.69 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01514044 , version 1 (25-04-2017)


  • HAL Id : hal-01514044 , version 1


Cassio Fraga Dantas, Rémi Gribonval, Renato R Lopes, Michele N da Costa. Learning Dictionaries as Sums of Kronecker Products. SPARS 2017 - Signal Processing with Adaptive Sparse Structured Representations workshop, Jun 2017, Lisbon, Portugal. . ⟨hal-01514044⟩
203 View
291 Download


Gmail Mastodon Facebook X LinkedIn More