Abstract
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.
Original language | English |
---|---|
Article number | 6655924 |
Pages (from-to) | 6-9 |
Number of pages | 4 |
Journal | IEEE Signal Processing Letters |
Volume | 21 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2014 |
Keywords / Materials (for Non-textual outputs)
- Dictionary learning
- shift-invariant learning
- sparse representations