Topological filtering of a signal over a network

원문 초록

Graph Signal Processing deals with the problem of analyzing and processing signals defined on graphs. In this paper, we introduce a novel filtering method for graph-based signals by employing ideas from topological data analysis. We begin by working with signals over general graphs and then extend our approach to what we term signals over graphs with faces. To construct the filter, we introduce a new structure called the Basin Hierarchy Tree, which encodes the persistent homology. We provide an efficient algorithm and demonstrate the effectiveness of our approach through examples with synthetic and real datasets. This work bridges topological data analysis and signal processing, presenting a new application of persistent homology as a topological data processing tool.