K-SVD Meets Transform Learning: Transform K-SVD

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.

[1]  Yoram Bresler,et al.  Learning Sparsifying Transforms , 2013, IEEE Transactions on Signal Processing.

[2]  Michael Elad,et al.  Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model , 2013, IEEE Transactions on Signal Processing.

[3]  Yoram Bresler,et al.  Learning overcomplete sparsifying transforms for signal processing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[4]  Rémi Gribonval,et al.  Constrained Overcomplete Analysis Operator Learning for Cosparse Signal Modelling , 2012, IEEE Transactions on Signal Processing.

[5]  Mohamed-Jalal Fadili,et al.  Robust Sparse Analysis Regularization , 2011, IEEE Transactions on Information Theory.

[6]  Anton Korobeynikov,et al.  Computation- and Space-Efficient Implementation of SSA , 2009, ArXiv.

[7]  Klaus Diepold,et al.  Analysis Operator Learning and its Application to Image Reconstruction , 2012, IEEE Transactions on Image Processing.

[8]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[9]  Michael Elad,et al.  Analysis versus synthesis in signal priors , 2006, 2006 14th European Signal Processing Conference.