Abstract
In this letter, we propose two improvements of the MOD and K-SVD dictionary learning algorithms, by modifying the two main parts of these algorithmsthe dictionary update and the sparse coding stages. Our first contribution is a different dictionary-update stage that aims at finding both the dictionary and the representations while keeping the supports intact. The second contribution suggests to leverage the known representations from the previous sparse-coding in the quest for the updated representations. We demonstrate these two ideas in practice and show how they lead to faster training and better quality outcome.
Original language | English |
---|---|
Article number | 6373747 |
Pages (from-to) | 79-82 |
Number of pages | 4 |
Journal | IEEE Signal Processing Letters |
Volume | 20 |
Issue number | 1 |
DOIs | |
State | Published - 2013 |
Keywords
- Dictionary-learning
- K-SVD
- MOD
- sparse and redundant representations
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
- Applied Mathematics