Loading...

Accelerated dictionary learning for sparse signal representation

Ghayem, F ; Sharif University of Technology | 2017

459 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-319-53547-0_50
  3. Publisher: Springer Verlag , 2017
  4. Abstract:
  5. 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. © Springer International Publishing AG 2017
  6. Keywords:
  7. Proximal algorithms ; Compressed sensing ; Iterative methods ; Signal processing ; Coefficient matrix ; Convergence rates ; Dictionary learning ; Numerical experiments ; Proximal algorithm ; Proximal methods ; Sparse representation ; Sparse signal representation ; Learning algorithms
  8. Source: 13th International Conference on Latent Variable Analysis and Signal Separation, LVA/ICA 2017, 21 February 2017 through 23 February 2017 ; Volume 10169 LNCS , 2017 , Pages 531-541 ; 03029743 (ISSN); 9783319535463 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-319-53547-0_50