Answers are grounded in this paper and cite their sources.
In this letter, we propose two improvements of the MOD and K-SVD dictionary learning algorithms, by modifying the two main parts of these algorithms-the 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.
No takes yet. Share an insight, caveat, or question.
Smith et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: