arrow
Return

K-SVD Meets Transform Learning: Transform K-SVD

delete2014-03-01
delete45
PRE
AI
E
Ender M. Ekşioğlu *
O
Ozden Bayir
DOI:10.1109/LSP.2014.2303076delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Recently there has been increasing attention directed towards the analysis sparsity models. Consequently, there is a quest for learning the operators which would enable analysis sparse representations for signals in hand. Analysis operator learning algorithms such as the Analysis K-SVD have been proposed. Sparsifying transform learning is a paradigm which is similar to the analysis operator learning, but they differ in some subtle points. In this paper, we propose a novel transform operator learning algorithm called as the Transform K-SVD, which brings the transform learning and the K-SVD based analysis dictionary learning approaches together. The proposed Transform K-SVD has the important advantage that the sparse coding step of the Analysis K-SVD gets replaced with the simple thresholding step of the transform learning framework. We show that the Transform K-SVD learns operators which are similar both in appearance and performance to the operators learned from the Analysis K-SVD, while its computational complexity stays much reduced compared to the Analysis K-SVD.
Keywords:
Analysis operator learning
dictionary learning
sparse representation
sparsifying transform learning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Signal Processing Magazine cover
IEEE Signal Processing Magazine
IF:
9.6
Papers:
1.1W
Citations:
1.7W

Organization

I
Istanbul Technical University
Scholars:
8.9K
Papers: 7.8K
Citations: 7.9K