%R 10.1109/LSP.2013.2288788 %T Explicit Shift-Invariant Dictionary Learning %J IEEE Signal Processing Letters %P 6-9 %V 21 %N 1 %L eprints1917 %I IEEE %X 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. %K Dictionary learning; Shift-invariant learning; Sparse representations %D 2014 %A Cristian Rusu %A Bogdan Dumitrescu %A Sotirios A. Tsaftaris