A Distributed Algorithm for Reconstructing Time-Varying Graph Signals
Circuits, systems, and signal processing(2022)
摘要
The reconstruction of time-varying signals on graphs is a prominent problem in graph signal processing community. By imposing the smoothness regularization over the time-vertex domain, the reconstruction problem can be formulated into an unconstrained optimization problem that minimizes the weighted sum of the data fidelity term and regularization term. In this paper, we propose an approximate Newton method to solve the problem in a distributed manner, which is applicable for spatially distributed systems consisting of agents with limited computation and communication capacity. The algorithm has low computational complexity while nearly maintains the fast convergence of the second-order methods, which is evidently better than the existing reconstruction algorithm based on the gradient descent method. The convergence of the proposed algorithm is explicitly proved. Numerical results verify the validity and fast convergence of the proposed algorithm.
更多查看译文
关键词
Time-varying graph signal reconstruction,Distributed algorithm,Matrix inverse approximation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要