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

利用Perron Frobenius定理识别一阶低通图形信号

Identifying First-order Lowpass Graph Signals using Perron Frobenius Theorem

Yiran He, Hoi-To Wai

摘要:

本文研究了从图信号中盲辨识图滤波器的问题。我们的目的是确定如果图形滤波器生成的图形信号是一阶低通,而不知道图形拓扑结构。请注意,低通图形滤波器是应用图形信号处理工具进行采样、去噪和图形学习的常见先决条件。我们的方法受到Perron Frobenius定理的启发,该定理观察到对于一阶低通图滤波器,输出协方差的顶部特征向量将是具有相同符号的元素的唯一特征向量。利用这一观察,我们开发了一个简单的检测器,回答如果一个给定的数据集是由一阶低通图滤波器。我们分析了有限样本、图的大小、观测噪声、低通滤波器的强度对检测器性能的影响。合成和真实数据的数值实验支持我们的研究结果。

英文摘要:

This paper is concerned with the blind identification of graph filters from graph signals. Our aim is to determine if the graph filter generating the graph signals is first-order lowpass without knowing the graph topology. Notice that lowpass graph filter is a common prerequisite for applying graph signal processing tools for sampling, denoising, and graph learning. Our method is inspired by the Perron Frobenius theorem, which observes that for first-order lowpass graph filter, the top eigenvector of output covariance would be the only eigenvector with elements of the same sign. Utilizing this observation, we develop a simple detector that answers if a given data set is produced by a first-order lowpass graph filter. We analyze the effects of finite-sample, graph size, observation noise, strength of lowpass filter, on the detector's performance. Numerical experiments on synthetic and real data support our findings.

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

↑