arrow
Return

Explicit shift-invariant dictionary learning

delete2014-01-01
delete34
delete
OA
AI
C
Cristian Rusu *
B
Bogdan Dumitrescu
S
Sotirios A. Tsaftaris
DOI:10.1109/LSP.2013.2288788delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In this article we give efficient solutions to the construction of structured dictionaries for sparse representations. We study circulant and Toeplitz structures and give fast algorithms based on least squares solutions. We take advantage of explicit circulant structures and we apply the resulting algorithms to shift-invariant learning scenarios. Synthetic experiments and comparisons with state-of-the-art methods show the superiority of the proposed methods.
Keywords:
shift-invariant learning
dictionary learning
sparse representations
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Signal Processing Magazine cover
IEEE Signal Processing Magazine
IF:
9.6
Papers:
1.1W
Citations:
1.7W

Organization

I
IMT School for Advanced Studies Lucca
Scholars:
676
Papers: 701
Citations: 693