Stationary signal processing on graphs
Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over graphs or networks. In this paper, we generalize the traditional concept of wide sense stationarity to signals defined over the vertices of arbitrary weighted undirected graphs. We show that stationarity is expressed through the graph localization operator reminiscent of translation. We prove that stationary graph signals are characterized by a well-defined Power Spectral Density that can be efficiently estimated even for large graphs. We leverage this new concept to derive Wiener-type estimation procedures of noisy and partially observed signals and illustrate the performance of this new model for denoising and regression.
Code (0)
등록된 구현이 없습니다.
Tasks
DenoisingTranslationSimilar Papers 제목 키워드 기반
Statistical Testing on Directed Graphs by Surrogate Data Generation
In recent years, graph signal processing has emerged as a powerful framework at the intersection of signal processing and graph theory, providing tools for the analysis of signals defined on nodes while accounting for th…
Towards stationary time-vertex signal processing
Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are ofte…
DenoisingStationary time-vertex signal processing
This paper considers regression tasks involving high-dimensional multivariate processes whose structure is dependent on some {known} graph topology. We put forth a new definition of time-vertex wide-sense stationarity, o…
DenoisingErgodicity in Stationary Graph Processes: A Weak Law of Large Numbers
For stationary signals in time the weak law of large numbers (WLLN) states that ensemble and realization averages are within e of each other with a probability of order O(1/Ne^2) when considering N signal components. The…
Graph Variogram: A novel tool to measure spatial stationarity
Irregularly sampling a spatially stationary random field does not yield a graph stationary signal in general. Based on this observation, we build a definition of graph stationarity based on intrinsic stationarity, a less…