New Dictionary Learning Methods for Two-Dimensional Signals

By growing the size of signals in one-dimensional dictionary learning for sparse representation, memory consumption and complex computations restrict the learning procedure. In applications of sparse representation and dictionary learning in two-dimensional signals (e.g. in image processing), if one opts to convert two-dimensional signals to one-dimensional ones, and use the existing one-dimensional dictionary learning and sparse representation techniques, too huge signals and dictionaries will be encountered. Two-dimensional dictionary learning has been proposed to avoid this problem. In this paper, we propose two algorithms for two-dimensional dictionary learning. According to our simulations, the proposed algorithms have noticeable improvement in both convergence rate and computational load in comparison to one-dimensional methods.

[1]  Mike E. Davies,et al.  Dictionary Learning for Sparse Approximations With the Majorization Method , 2009, IEEE Transactions on Signal Processing.

[2]  Kjersti Engan,et al.  Method of optimal directions for frame design , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[3]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[4]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[5]  Michael Elad,et al.  Improving Dictionary Learning: Multiple Dictionary Updates and Coefficient Reuse , 2013, IEEE Signal Processing Letters.

[6]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[7]  Christian Jutten,et al.  Joint Low Mutual and Average Coherence Dictionary Learning , 2018, 2018 26th European Signal Processing Conference (EUSIPCO).

[8]  Michael Elad,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.

[9]  Christian Jutten,et al.  A New Algorithm for Dictionary Learning Based on Convex Approximation , 2019, 2019 27th European Signal Processing Conference (EUSIPCO).

[10]  Rafael C. González,et al.  Digital image processing, 3rd Edition , 2008 .

[11]  I. Daubechies,et al.  Iteratively reweighted least squares minimization for sparse recovery , 2008, 0807.0575.

[12]  JuttenChristian,et al.  A fast approach for overcomplete sparse decomposition based on smoothed l0 norm , 2009 .

[13]  John Thompson,et al.  European Signal Processing Conference (EUSIPCO) , 2016 .

[14]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[15]  Christian Jutten,et al.  Dictionary Learning for Sparse Representation: A Novel Approach , 2013, IEEE Signal Processing Letters.

[16]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[17]  Kaare Brandt Petersen,et al.  The Matrix Cookbook , 2006 .

[18]  Martin Kleinsteuber,et al.  Separable Dictionary Learning , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[19]  Christian Jutten,et al.  Low Mutual and Average Coherence Dictionary Learning Using Convex Approximation , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[20]  Christian Jutten,et al.  Sparse decomposition of two dimensional signals , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[21]  Yong Fang,et al.  2D sparse signal recovery via 2D orthogonal matching pursuit , 2012, Science China Information Sciences.