| Paper ID | SS-2.2 |
| Paper Title |
Time-varying graph signal inpainting via unrolling networks |
| Authors |
Siheng Chen, Mitsubishi Electric Research Laboratories (MERL), United States; Yonina C. Eldar, Weizmann Institute of Science, Israel |
| Session | SS-2: Deep Learning Methods for Solving Linear Inverse Problems |
| Location | Gather.Town |
| Session Time: | Tuesday, 08 June, 14:00 - 14:45 |
| Presentation Time: | Tuesday, 08 June, 14:00 - 14:45 |
| Presentation |
Poster
|
| Topic |
Special Sessions: Deep Learning Methods for Solving Linear Inverse Problems |
| IEEE Xplore Open Preview |
Click here to view in IEEE Xplore |
| Virtual Presentation |
Click here to watch in the Virtual Conference |
| Abstract |
We propose an interpretable graph neural network based on algorithm unrolling to reconstruct a time-varying graph signal from partial measurements. The proposed graph unrolling networks expand algorithm unrolling to the graph-time domain and provide an interpretation of the architecture design from a signal processing perspective. We unroll an iterative inpainting algorithm by mapping each iteration to a single network layer. The feed-forward process is thus equivalent to iteratively reconstructing a time-varying graph signal. We train this network through unsupervised learning, where the input time-varying graph signal is used to supervise the training. By leveraging the learning ability of neural networks, we adaptively capture appropriate priors from input data, instead of manually choosing signal priors. To validate the proposed methods, we conduct experiments on three real-world datasets and demonstrate that our networks achieve smaller reconstruction errors than conventional inpainting algorithms and state-of-the-art graph neural networks. |
