TY  - JOUR
SN  - 1070-9908
Y1  - 2014///
N2  - In this letter 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.
JF  - IEEE Signal Processing Letters
EP  - 9
VL  - 21
PB  - IEEE
A1  - Rusu, Cristian
A1  - Dumitrescu, Bogdan
A1  - Tsaftaris, Sotirios A.
SP  - 6
ID  - eprints1917
TI  - Explicit Shift-Invariant Dictionary Learning
AV  - none
KW  - Dictionary learning; Shift-invariant learning; Sparse representations

UR  - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6655924&isnumber=6655913
IS  - 1
ER  -