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

图信号处理的自适应符号算法

Adaptive Sign Algorithm for Graph Signal Processing

Yi Yan, Ercan E. Kuruoglu, Mustafa A. Altinkaya

摘要:

高效、健壮的不规则结构数据在线处理技术在当今数据丰富的时代至关重要。在本文中,我们提出了一个图/网络版本的经典自适应符号算法在线图信号估计下的脉冲噪声。最近提出的图自适应最小均方算法在非高斯脉冲噪声下不稳定,计算复杂度高。在这项工作中提出的图形符号算法是基于最小色散准则,因此脉冲噪声不会妨碍其估计质量。与最近提出的图形自适应最小均值p次幂算法不同,我们的图形符号算法可以在没有噪声分布的先验知识的情况下操作。与现有的自适应图信号处理算法相比,该算法计算复杂度低,具有更快的运行时间。实验上的稳态和时变图信号估计利用频谱特性的带宽和采样,图形符号算法表现出快速,稳定,鲁棒的图形信号估计性能下的脉冲噪声建模阿尔法稳定,柯西,学生的t,或拉普拉斯分布。

英文摘要:

Efficient and robust online processing technique of irregularly structured data is crucial in the current era of data abundance. In this paper, we propose a graph/network version of the classical adaptive Sign algorithm for online graph signal estimation under impulsive noise. Recently introduced graph adaptive least mean squares algorithm is unstable under non-Gaussian impulsive noise and has high computational complexity. The Graph-Sign algorithm proposed in this work is based on the minimum dispersion criterion and therefore impulsive noise does not hinder its estimation quality. Unlike the recently proposed graph adaptive least mean p-th power algorithm, our Graph-Sign algorithm can operate without prior knowledge of the noise distribution. The proposed Graph-Sign algorithm has a faster run time because of its low computational complexity compared to the existing adaptive graph signal processing algorithms. Experimenting on steady-state and time-varying graph signals estimation utilizing spectral properties of bandlimitedness and sampling, the Graph-Sign algorithm demonstrates fast, stable, and robust graph signal estimation performance under impulsive noise modeled by alpha stable, Cauchy, Student's t, or Laplace distributions.

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

↑