Locally stationary graph processes

Date

2023-12-20

Author

Canbolat, Abdullah

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

130
views

119
downloads

Cite This

Stationary graph process models are commonly used in the analysis and inference of data sets collected on irregular network topologies. While most of the existing methods represent graph signals with a single stationary process model that is globally valid on the entire graph, in many practical problems, the characteristics of the process may be subject to local variations in different regions of the graph. In this thesis, we propose a locally stationary graph process (LSGP) model that aims to extend the classical concept of local stationarity to irregular graph domains. We characterize local stationarity by expressing the overall process as the combination of a set of component processes such that the extent to which the process adheres to each component varies smoothly over the graph. We propose an algorithm for computing LSGP models from realizations of the process, and also study the approximation of LSGPs locally with Wide Sense Stationary (WSS) processes. Experiments on signal interpolation problems show that the proposed process model provides accurate signal representations competitive with the state of the art.

Subject Keywords

Locally Stationary Graph Processes, Non-stationary Graph Processes, Graph Signal Interpolation, Graph Partitioning

URI

https://hdl.handle.net/11511/107728

Collections

Graduate School of Natural and Applied Sciences, Thesis