Learning Dictionaries as a sum of Kronecker products - Archive ouverte HAL Access content directly
Journal Articles IEEE Signal Processing Letters Year : 2017

Learning Dictionaries as a sum of Kronecker products

(1, 2) , (1) , (1)


The choice of an appropriate frame, or 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 train, 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. This approach, named SuKro, is demonstrated experimentally on an image denoising application.
Fichier principal
Vignette du fichier
FINAL VERSION.pdf (321.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01672349 , version 1 (24-12-2017)



Cassio Fraga Dantas, Michele Nazareth da Costa, Renato da Rocha Lopes. Learning Dictionaries as a sum of Kronecker products. IEEE Signal Processing Letters, 2017, 24 (5), pp.559 - 563. ⟨10.1109/LSP.2017.2681159⟩. ⟨hal-01672349⟩
248 View
332 Download



Gmail Facebook Twitter LinkedIn More