Signal processing on simplicial complexes

2020-04-06 · Feng Ji, Giacomo Kahn, Wee Peng Tay

Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models binary relations, and it does not directly model complex n-ary relations. One possible high dimensional generalization of graphs are simplicial complexes. They are a step between the constrained case of graphs and the general case of hypergraphs. In this paper, we develop a signal processing framework on simplicial complexes, such that we recover the traditional GSP theory when restricted to signals on graphs. It is worth mentioning that the framework works much more generally, though the focus of the paper is on simplicial complexes. We demonstrate how to perform signal processing with the framework using numerical examples.

📄 PDF Abstract BibTeX arXiv:2004.02392

Code (0)

등록된 구현이 없습니다.

Topological Signal Processing over Cell Complexes

2021-12-13 · Stefania Sardellitti, Sergio Barbarossa, Lucia Testa

The Topological Signal Processing (TSP) framework has been recently developed to analyze signals defined over simplicial complexes, i.e. topological spaces represented by finite sets of elements that are closed under inc…

Signal Processing on Cell Complexes

2021-10-11 · T. Mitchell Roddenberry, Michael T. Schaub, Mustafa Hajij

The processing of signals supported on non-Euclidean domains has attracted large interest recently. Thus far, such non-Euclidean domains have been abstracted primarily as graphs with signals supported on the nodes, thoug…

Generalized signals on simplicial complexes

2023-05-11 · Feng Ji, Xingchao Jian, Wee Peng Tay, Maosheng Yang

Topological signal processing (TSP) over simplicial complexes typically assumes observations associated with the simplicial complexes are real scalars. In this paper, we develop TSP theories for the case where observatio…