Joint Low Mutual and Average Coherence Dictionary Learning

Dictionary learning (DL) has found many applications in sparse approximation problems. Two important properties of a dictionary are maximum and average coherence (cross- correlation) between its atoms. Many algorithms have been presented to take into account the coherence between atoms during dictionary learning. Some of them mainly reduce the maximum (mutual) coherence whereas some other algorithms decrease the average coherence. In this paper, we propose a method to jointly reduce the maximum and average correlations between different atoms. This is done by making a balance between reducing the maximum and average co- herences. Experimental results demonstrate that the proposed approach reduce the mutual and average coherence of the dictionary better than existing algorithms.

[1]  Christian Jutten,et al.  A new algorithm for learning overcomplete dictionaries , 2013, 21st European Signal Processing Conference (EUSIPCO 2013).

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

[3]  Marc Teboulle,et al.  Proximal alternating linearized minimization for nonconvex and nonsmooth problems , 2014, Math. Program..

[4]  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.

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

[6]  Zhihui Zhu,et al.  A new framework for designing incoherent sparsifying dictionaries , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  Michael Elad,et al.  Dictionaries for Sparse Representation Modeling , 2010, Proceedings of the IEEE.

[8]  Christian Jutten,et al.  Regularized low-coherence overcomplete dictionary learning for sparse signal decomposition , 2016, 2016 24th European Signal Processing Conference (EUSIPCO).

[9]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[10]  Miguel R. D. Rodrigues,et al.  Projection Design for Statistical Compressive Sensing: A Tight Frame Based Approach , 2013, IEEE Transactions on Signal Processing.

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

[12]  S. Sahoo,et al.  Dictionary Training for Sparse Representation as Generalization of K-Means Clustering , 2013, IEEE Signal Processing Letters.

[13]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[14]  Joachim M. Buhmann,et al.  Learning Dictionaries With Bounded Self-Coherence , 2012, IEEE Signal Processing Letters.

[15]  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).

[16]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.