Modelling Graph Errors: Towards Robust Graph Signal Processing
arXiv:1903.08398
Abstract
The first step for any graph signal processing (GSP) procedure is to learn the graph signal representation, i.e., to capture the dependence structure of the data into an adjacency matrix. Indeed, the adjacency matrix is typically not known a priori and has to be learned. However, it is learned with errors. A little attention has been paid to modelling such errors in the adjacency matrix, and studying their effects on GSP methods. However, modelling errors in the adjacency matrix will enable both to study the graph error effects in GSP and to develop robust GSP algorithms. In this paper, we therefore introduce practically justifiable graph error models. We also study, both analytically when possible and numerically, the graph error effect on the performance of GSP methods in different types of problems such as filtering of graph signals and independent component analysis of graph signals (graph decorrelation).
arXiv comment34 pages, 6 figures, 2 tables, Submitted to IEEE journal on January 2019
References in corpus (13)
- Statistical mechanics of complex networks
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Sampling of graph signals with successive local aggregations
- Autoregressive Moving Average Graph Filtering
- Stationary Graph Processes and Spectral Estimation
- Stability Properties of Graph Neural Networks
- Graph Frequency Analysis of Brain Signals
- Reconstruction of Graph Signals through Percolation from Seeding Nodes
- Filtering Random Graph Processes Over Random Time-Varying Graphs
- Separation of uncorrelated stationary time series using autocovariance matrices
- Graph Signal Processing Meets Blind Source Separation