Restoration of Time-Varying Graph Signals using Deep Algorithm Unrolling
Hayate Kojima, Hikari Noguchi, Koki Yamada, Yuichi Tanaka
Abstract
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.
BibTeX
@inproceedings{icassp2023_restorationoftim,
title = {Restoration of Time-Varying Graph Signals using Deep Algorithm Unrolling},
author = {Hayate Kojima and Hikari Noguchi and Koki Yamada and Yuichi Tanaka},
booktitle = {ICASSP 2023},
year = {2023}
}