Restoration of Time-Varying Graph Signals using Deep Algorithm Unrolling

Hayate Kojima, Hikari Noguchi,Koki Yamada,Yuichi Tanaka

ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)(2023)

引用 1|浏览1
暂无评分
摘要
In this paper, we propose a restoration method of time-varying graph signals, i.e., signals on a graph whose signal values change over time, using deep algorithm unrolling. Deep algorithm unrolling is a method that learns parameters in an iterative optimization algorithm with deep learning techniques. It is expected to improve convergence speed and accuracy while the iterative steps are still interpretable. In the proposed method, the minimization problem is formulated so that the time-varying graph signal is smooth both in time and spatial domains. The internal parameters, i.e., time domain FIR filters and regularization parameters, are learned from training data. Experimental results using synthetic data and real sea surface temperature data show that the proposed method improves signal reconstruction accuracy compared to several existing time-varying graph signal re- construction methods.
更多
查看译文
关键词
Time-varying graph signals,graph signal processing,deep algorithm unrolling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要