基于概率密度比加权的图滤波器传递
Graph Filter Transfer via Probability Density Ratio Weighting
摘要:
图形信号的恢复问题是图形信号处理的主要课题之一。一个代表性的方法,这个问题是图维纳滤波器,它利用统计信息的目标信号计算的历史数据,以构建一个有效的估计。然而,我们经常会遇到由于拓扑变化导致当前图与历史数据不同的情况,从而导致估计器的性能下降。本文提出了一种图滤波传递方法,该方法在拓扑变化的情况下从历史数据中学习一个有效的估计器。所提出的方法利用当前和历史观测的概率密度比,并构造一个估计器,最大限度地减少当前图域中的重建误差。对合成数据的实验表明,该方法优于其他方法。
英文摘要:
The problem of recovering graph signals is one of the main topics in graph signal processing. A representative approach to this problem is the graph Wiener filter, which utilizes the statistical information of the target signal computed from historical data to construct an effective estimator. However, we often encounter situations where the current graph differs from that of historical data due to topology changes, leading to performance degradation of the estimator. This paper proposes a graph filter transfer method, which learns an effective estimator from historical data under topology changes. The proposed method leverages the probability density ratio of the current and historical observations and constructs an estimator that minimizes the reconstruction error in the current graph domain. The experiment on synthetic data demonstrates that the proposed method outperforms other methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。