Accelerated dictionary learning for sparse signal representation

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Learning sparsifying dictionaries from a set of training signals has been shown to have much better performance than pre-designed dictionaries in many signal processing tasks, including image enhancement. To this aim, numerous practical dictionary learning (DL) algorithms have been proposed over the last decade. This paper introduces an accelerated DL algorithm based on iterative proximal methods. The new algorithm efficiently utilizes the iterative nature of DL process, and uses accelerated schemes for updating dictionary and coefficient matrix. Our numerical experiments on dictionary recovery show that, compared with some well-known DL algorithms, our proposed one has a better convergence rate. It is also able to successfully recover underlying dictionaries for different sparsity and noise levels.

Cite

CITATION STYLE

APA

Ghayem, F., Sadeghi, M., Babaie-Zadeh, M., & Jutten, C. (2017). Accelerated dictionary learning for sparse signal representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10169 LNCS, pp. 531–541). Springer Verlag. https://doi.org/10.1007/978-3-319-53547-0_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free