一种用于图信号重构的分布式跟踪算法
A Distributed Tracking Algorithm for Reconstruction of Graph Signals
AI总结:
针对复杂网络中节点算力受限的问题,提出DLSR分布式迭代算法,利用邻节点通信与衰减机制重构时变带限图信号,并给出收敛性与误差界证明及实验验证。
摘要:
图上信号处理的快速发展为处理与不规则域相关的大规模数据提供了新视角。在许多实际应用中,有必要通过复杂网络处理海量数据集,而其中大多数节点的计算能力有限。设计高效的分布式算法对这项任务至关重要。本文聚焦于基于在选定节点子集上采样得到的观测值,对时变带限图信号进行分布式重构。文中提出一种分布式最小二乘重构(DLSR)算法,通过允许相邻节点相互通信并进行快速更新,迭代恢复未知信号。DLSR采用一种衰减方案,以消除重构过程中出现的带外能量;这种能量不可避免地由分布式系统中的传输延迟造成。本文给出了DLSR的收敛性证明和误差界,表明该算法能够跟踪时变图信号,并能完美重构时不变信号。通过合成数据和真实世界传感器网络数据对DLSR算法进行了数值实验,验证了其跟踪慢时变图信号的能力。
英文摘要:
The rapid development of signal processing on graphs provides a new perspective for processing large-scale data associated with irregular domains. In many practical applications, it is necessary to handle massive data sets through complex networks, in which most nodes have limited computing power. Designing efficient distributed algorithms is critical for this task. This paper focuses on the distributed reconstruction of a time-varying bandlimited graph signal based on observations sampled at a subset of selected nodes. A distributed least square reconstruction (DLSR) algorithm is proposed to recover the unknown signal iteratively, by allowing neighboring nodes to communicate with one another and make fast updates. DLSR uses a decay scheme to annihilate the out-of-band energy occurring in the reconstruction process, which is inevitably caused by the transmission delay in distributed systems. Proof of convergence and error bounds for DLSR are provided in this paper, suggesting that the algorithm is able to track time-varying graph signals and perfectly reconstruct time-invariant signals. The DLSR algorithm is numerically experimented with synthetic data and real-world sensor network data, which verifies its ability in tracking slowly time-varying graph signals.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。