Dual Graph Regularized Dictionary Learning

Yael Yankelevsky

doi:10.1109/TSIPN.2016.2605763

2016-12-01

PRE

Yael Yankelevsky *

Michael Elad

DOI：10.1109/TSIPN.2016.2605763

原文链接

原文求助

摘要

En 中文

Dictionary learning (DL) techniques aim to find sparse signal representations that capture prominent characteristics in a given data. Such methods operate on a data matrix Y is an element of R-NxM, where each of its columns y(i) is an element of R-N constitutes a training sample, and these columns together represent a sampling from the data manifold. For signals y is an element of R-N residing on weighted graphs, an additional challenge is incorporating the underlying geometric structure of the data domain into the learning process. In such cases, the topological graph structure may provide a crucial interpretation for the columns, while the data manifold itself may also possess a low-dimensional intrinsic structure that should be taken into account. In this work, we propose a novel dictionary learning algorithm for graph signals that simultaneously takes into account the underlying structure in both the signal and the manifold domains. Specifically, we require that the dictionary atoms are smooth with respect to the graph topology, as encapsulated by the graph Laplacian matrix. Furthermore, we propose to learn this graph Laplacian within the dictionary learning process, adapting it to promote the desired smoothness. Utilizing the manifold structure, we propose to encourage the smoothness of the sparse representations on the data manifold in a similar manner. Both these smoothness forces implicitly enhance the learned dictionary. The efficiency of the proposed approach is demonstrated on synthetic examples as well as on real data, showing that it outperforms other dictionary learning methods in typical problems such as resistance to noise and data completion.

Keyword:

Dictionary learning

dual graph regularization

graph Laplacian

graph signal processing

manifold structure

sparse approximation