Learning Laplacian Matrix in Smooth Graph Signal Representations

Understand

The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing.

• However, a meaningful graph is not always readily available from the data, nor easy to define depending on the application domain.
• In particular, it is often desirable in graph signal processing applications that a graph is chosen such that the data admit certain regularity or smoothness on the graph.
• In this paper, we address the problem of learning graph Laplacians, which is equivalent to learning graph topologies, such that the input data form graph signals with smooth variations on the resulting topology.