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

基于信号观测的鲁棒图滤波器识别与图去噪

Robust Graph Filter Identification and Graph Denoising from Signal Observations

Samuel Rey, Victor M. Tenorio, Antonio G. Marques

AI总结:

针对图信号处理中已知图存在观测误差导致方法次优的问题,提出顶点域非凸优化方法,联合执行图滤波器识别与图去噪,设计融合交替优化与最大化最小化的算法并推广至多GF场景,经数值分析验证优势。

摘要:

在处理图信号处理任务时,核心假设是描述信号支撑的图已知。但在许多相关应用中,可用图存在观测误差和扰动,若忽略这些缺陷,依赖图拓扑的方法可能产生次优结果。为此,我们提出一种处理图链路扰动的新方法,并将其应用于从输入-输出观测中鲁棒识别图滤波器(GF)的问题。与现有工作不同,我们在顶点域构建非凸优化问题,联合执行GF识别与图去噪。为解决该双凸问题,我们设计了融合交替优化与最大化最小化技术的算法,证明其收敛至平稳点。论文第二部分:i)将设计推广至联合估计多个GF的鲁棒场景;ii)提出降低计算复杂度的替代算法实现。最后,通过合成与真实数据集,数值分析了扰动的不利影响及鲁棒方法的优势,并与其他最先进方法对比。

英文摘要:

When facing graph signal processing tasks, the workhorse assumption is that the graph describing the support of the signals is known. However, in many relevant applications the available graph suffers from observation errors and perturbations. As a result, any method relying on the graph topology may yield suboptimal results if those imperfections are ignored. Motivated by this, we propose a novel approach for handling perturbations on the links of the graph and apply it to the problem of robust graph filter (GF) identification from input-output observations. Different from existing works, we formulate a non-convex optimization problem that operates in the vertex domain and jointly performs GF identification and graph denoising. As a result, on top of learning the desired GF, an estimate of the graph is obtained as a byproduct. To handle the resulting bi-convex problem, we design an algorithm that blends techniques from alternating optimization and majorization minimization, showing its convergence to a stationary point. The second part of the paper i) generalizes the design to a robust setup where several GFs are jointly estimated, and ii) introduces an alternative algorithmic implementation that reduces the computational complexity. Finally, the detrimental influence of the perturbations and the benefits resulting from the robust approach are numerically analyzed over synthetic and real-world datasets, comparing them with other state-of-the-art alternatives.

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

↑