arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.00320eess.SPcs.LG
收藏

脉冲噪声下信号估计的图归一化LMP算法

Graph Normalized-LMP Algorithm for Signal Estimation Under Impulsive Noise

Tsinghua-Berkeley Shenzhen Institute, Tsinghua University(清华大学清华-伯克利深圳学院);Tsinghua University(清华大学)

Yi Yan, Radwa Adel, Ercan Engin Kuruoglu

摘要:

在本文中,我们介绍了一种自适应图归一化最小平均p次幂(GNLMP)算法的图形信号处理(GSP),利用GSP技术,包括带限滤波和节点采样,估计采样图形信号在脉冲噪声。与基于最小二乘的自适应GSP最小均方(GLMS)算法和归一化GLMS(GNLMS)算法不同,GNLMP算法具有重构图像信号的能力,该图像信号被具有重尾特征的非高斯噪声所破坏。与最近引入的自适应GSP最小平均p次幂(GLMP)算法相比,GNLMP算法减少了收敛到稳定图形信号的迭代次数。推导了GNLMP算法的收敛条件,证明了GNLMP算法处理多维时变多特征图形信号的能力。仿真结果表明,GNLMP算法对稳态和时变图形信号的估计速度比GLMP算法快,鲁棒性比GLMS和GNLMS算法好。

英文摘要:

In this paper, we introduce an adaptive graph normalized least mean pth power (GNLMP) algorithm for graph signal processing (GSP) that utilizes GSP techniques, including bandlimited filtering and node sampling, to estimate sampled graph signals under impulsive noise. Different from least-squares-based algorithms, such as the adaptive GSP Least Mean Squares (GLMS) algorithm and the normalized GLMS (GNLMS) algorithm, the GNLMP algorithm has the ability to reconstruct a graph signal that is corrupted by non-Gaussian noise with heavy-tailed characteristics. Compared to the recently introduced adaptive GSP least mean pth power (GLMP) algorithm, the GNLMP algorithm reduces the number of iterations to converge to a steady graph signal. The convergence condition of the GNLMP algorithm is derived, and the ability of the GNLMP algorithm to process multidimensional time-varying graph signals with multiple features is demonstrated as well. Simulations show the performance of the GNLMP algorithm in estimating steady-state and time-varying graph signals is faster than GLMP and more robust in comparison to GLMS and GNLMS.

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

↑