Signal Processing on Simplicial Complexes With Vertex Signals

In classical graph signal processing (GSP), the underlying topological structures are restricted in terms of dimensionality. A graph or a 1-complex is a combinatorial object that models binary relations, which do not directly capture complex high arity relations. One possible high dimensional generalization of graphs is a simplicial complex. In this paper, we develop a signal processing framework on simplicial complexes with vertex signals, which recovers the traditional GSP theory. We introduce the concept of a generalized Laplacian, which allows us to embed a simplicial complex into a traditional graph and hence perform signal processing similar to traditional GSP. We show that the generalized Laplacian satisfies several desirable properties, same as the graph Laplacian. We propose a method to learn 2-complex structures and demonstrate how to perform signal processing by applying the generalized Laplacian on both synthetic and real data. We observe performance gains in our experiments when 2-complexes are used to model the data, compared to the traditional GSP approach of restricting to 1-complexes.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.