arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.06432eess.SP
收藏

动态物理传感器网络数据的鲁棒时变图信号恢复

Robust Time-Varying Graph Signal Recovery for Dynamic Physical Sensor Network Data

Eisuke Yamagata, Kazuki Naganuma, Shunsuke Ono

AI总结:

针对传感器网络时变性场景,提出一种时变图信号恢复方法,通过构建约束凸优化问题并结合原始对偶分裂算法求解,在模拟及真实数据上表现优于现有方法。

摘要:

我们提出一种时变图信号恢复方法,通过利用动态图从受污染的观测数据中估计真实的时变图信号。大多数传统的时变图信号恢复方法是在承载信号的底层图为静态的假设下提出的。然而,随着传感器技术的快速发展,传感器网络与时变信号一样具有时变性的假设正成为一个非常实际的问题场景。本文针对此类情况,将动态图信号恢复构建为一个约束凸优化问题,同时估计时变图信号和稀疏建模的异常值。在我们的构建中,我们使用两种正则化方法:时变图拉普拉斯算子正则化和时间差分正则化,并分别对位置已知的缺失值和未知异常值进行建模,以实现对高度退化数据的鲁棒估计。此外,我们还开发了一种基于原始对偶分裂方法的算法来高效求解该优化问题。在模拟无人机遥感数据和真实海面温度数据上的大量实验表明,所提方法优于现有方法。

英文摘要:

We propose a time-varying graph signal recovery method for estimating the true time-varying graph signal from corrupted observations by leveraging dynamic graphs. Most of the conventional methods for time-varying graph signal recovery have been proposed under the assumption that the underlying graph that houses the signals is static. However, in light of rapid advances in sensor technology, the assumption that sensor networks are time-varying like the signals is becoming a very practical problem setting. In this paper, we focus on such cases and formulate dynamic graph signal recovery as a constrained convex optimization problem that simultaneously estimates both time-varying graph signals and sparsely modeled outliers. In our formulation, we use two types of regularizations, time-varying graph Laplacian-based and temporal differencebased, and also separately modeled missing values with known positions and unknown outliers to achieve robust estimations from highly degraded data. In addition, an algorithm is developed to efficiently solve the optimization problem based on a primaldual splitting method. Extensive experiments on simulated drone remote sensing data and real-world sea surface temperature data demonstrate the advantages of the proposed method over existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑