Title
DALM-SVD: Accelerated sparse coding through singular value decomposition of the dictionary
Abstract
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.
Year
DOI
Venue
2014
10.1109/ICIP.2014.7025994
Image Processing
Keywords
Field
DocType
image coding,singular value decomposition,sparse matrices,DALM-SVD,accelerated sparse coding,augmented Lagrangian,block image processing,dictionary matrix,singular value decomposition,sparse recovery steps
Singular value decomposition,Singular value,Pattern recognition,K-SVD,Computer science,Neural coding,Sparse approximation,Image processing,Augmented Lagrangian method,Artificial intelligence,Sparse matrix
Conference
ISSN
Citations 
PageRank 
1522-4880
1
0.35
References 
Authors
8
5
Name
Order
Citations
PageRank
Hugo R. Gonçalves110.35
Miguel V. Correia210.69
Xin Li353060.02
Aswin C. Sankaranarayanan477051.51
Vitor Tavares510.35