An Efficient Algorithm for Learning Dictionary under Coherence Constraint

Abstract EN

Dictionary learning problem has become an active topic for decades.

Most existing learning methods train the dictionary to adapt to a particular class of signals.

But as the number of the dictionary atoms is increased to represent the signals much more sparsely, the coherence between the atoms becomes higher.

According to the greedy and compressed sensing theories, this goes against the implementation of sparse coding.

In this paper, a novel approach is proposed to learn the dictionary that minimizes the sparse representation error according to the training signals with the coherence taken into consideration.

The coherence is constrained by making the Gram matrix of the desired dictionary approximate to an identity matrix of proper dimension.

The method for handling the proposed model is mainly based on the alternating minimization procedure and, in each step, the closed-form solution is derived.

A series of experiments on synthetic data and audio signals is executed to demonstrate the promising performance of the learnt incoherent dictionary and the superiority of the learning method to the existing ones.