DALM-SVD: Accelerated sparse coding through singular value decomposition of the dictionary

Published

Conference Paper

© 2014 IEEE. Sparse coding techniques have seen an increasing range of applications in recent years, especially in the area of image processing. In particular, sparse coding using ℓ1-regularization has been efficiently solved with the Augmented Lagrangian (AL) applied to its dual formulation (DALM). This paper proposes the decomposition of the dictionary matrix in its Singular Value/Vector form in order to simplify and speed-up the implementation of the DALM algorithm. Furthermore, we propose an update rule for the penalty parameter used in AL methods that improves the convergence rate. The SVD of the dictionary matrix is done as a pre-processing step prior to the sparse coding, and thus the method is better suited for applications where the same dictionary is reused for several sparse recovery steps, such as block image processing.

Full Text

Duke Authors

Cited Authors

  • Gonçalves, H; Correia, M; Li, X; Sankaranarayanan, A; Tavares, V

Published Date

  • January 28, 2014

Published In

  • 2014 Ieee International Conference on Image Processing, Icip 2014

Start / End Page

  • 4907 - 4911

International Standard Book Number 13 (ISBN-13)

  • 9781479957514

Digital Object Identifier (DOI)

  • 10.1109/ICIP.2014.7025994

Citation Source

  • Scopus