Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Node-Binded Communities for Interpolation on Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Alessandra De Rossi,
  • Sandro Lancellotti,
  • Federico Romaniello

摘要

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.