arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.00586eess.SP
收藏

有向图上的信号处理

Signal Processing on Directed Graphs

Antonio G. Marques, Santiago Segarra, Gonzalo Mateos

摘要:

本文概述了当前景观的信号处理(SP)的有向图(有向图)。方向性是许多现实世界(信息,交通,生物)网络所固有的,它应该在处理和学习网络数据中发挥不可或缺的作用。因此,我们对SP在有向图上的最新进展进行了全面的回顾,通过与无向图的结果进行比较,讨论新兴方向,建立与机器学习和统计因果推理相关领域的联系,以及说明其与及时应用的实际相关性,提供见解。为此,我们首先调查(正交)信号表示和他们的图形频率解释的基础上,新的措施,信号变化的有向图。然后,我们继续过滤,一个核心组成部分,在推导出一个全面的理论SP有向图。事实上,通过基于滤波器的生成信号模型的镜头,我们探索了一个统一的框架来研究逆问题(例如,网络上的采样和反卷积)、随机信号的统计分析以及来自节点观测的有向图的拓扑推断。

英文摘要:

This paper provides an overview of the current landscape of signal processing (SP) on directed graphs (digraphs). Directionality is inherent to many real-world (information, transportation, biological) networks and it should play an integral role in processing and learning from network data. We thus lay out a comprehensive review of recent advances in SP on digraphs, offering insights through comparisons with results available for undirected graphs, discussing emerging directions, establishing links with related areas in machine learning and causal inference in statistics, as well as illustrating their practical relevance to timely applications. To this end, we begin by surveying (orthonormal) signal representations and their graph frequency interpretations based on novel measures of signal variation for digraphs. We then move on to filtering, a central component in deriving a comprehensive theory of SP on digraphs. Indeed, through the lens of filter-based generative signal models, we explore a unified framework to study inverse problems (e.g., sampling and deconvolution on networks), statistical analysis of random signals, and topology inference of digraphs from nodal observations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑