.png){kind=icon}
Return
Multi-separable dictionary learning
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2017.06.023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As the extensive applications of sparse representation, the methods of dictionary learning have received widespread attentions. In this paper, we propose a multi-separable dictionary learning (MSeDiL) algorithm for sparse representation, which is based on the Lagrange Multiplier and the QR decomposition. Different with the traditional dictionary learning methods, the training samples are clustered firstly. Then the separable dictionaries for each cluster are optimized by the QR decomposition. The efficiency of the reconstruction process is improved in our algorithm because of the under-determinedness of the dictionaries for each cluster. Experimental results show that with the similar PSNR (Peak Signal to Noise Ratio) and SSIM (Structure Similarity Index), the reconstruction speed of our algorithm is much faster than other dictionary learning methods, especially when the size of samples is large. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Sparse representation
Separable dictionary learning
Lagrange Multiplier
Multi-separable dictionary learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
Authors’ response: Importance of defining loss of response before therapeutic drug monitoring.png)
Gut
GutIF0
PREAI
ShareSaveShareSaveShareSaveGeneralized joint kernel regression and adaptive dictionary learning for single-image super-resolutionSIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
ShareSaveSparse Sequential Generalization of K-means for dictionary training on noisy signalsSIGNAL PROCESSINGOAAI
SIGNAL PROCESSINGIF3.6
OAAIShareSave
View more