Node-Binded Communities for Interpolation on Graphs

Abstract

Partition of unity methods (PUMs) on graphs represent straightforward and remarkably adaptable auxiliary techniques for graph signal processing. By relying solely on the intrinsic graph structure, we propose the generation of a partition of unity through centrality measures and modularity. Subsequently, we integrate PUMs with a local graph basis function (GBF) approximation approach to achieve low-cost global interpolation schemes.