24 August 2017 Local stationarity of graph signals: insights and experiments
Author Affiliations +
Abstract
In this paper, we look at one of the most crucial ingredient to graph signal processing: the graph. By taking a step back on the conventional approach using Gaussian weights, we are able to obtain a better spectral representation of a stochastic graph signal. Our approach focuses on learning the weights of the graphs, thus enabling better richness in the structure by incorporating both the distance and the local structure into the weights. Our results show that the graph power spectrum we obtain is closer to what we expect, and stationarity is better preserved when going from a continuous signal to its sampled counterpart on the graph. We further validate the approach on a real weather dataset.
Conference Presentation
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Benjamin Girault, Benjamin Girault, Shrikanth S. Narayanan, Shrikanth S. Narayanan, Antonio Ortega, Antonio Ortega, } "Local stationarity of graph signals: insights and experiments", Proc. SPIE 10394, Wavelets and Sparsity XVII, 103941P (24 August 2017); doi: 10.1117/12.2274584; https://doi.org/10.1117/12.2274584
PROCEEDINGS
17 PAGES + PRESENTATION

SHARE
RELATED CONTENT

Topological obstructions to localization results
Proceedings of SPIE (December 05 2001)
Hybrid HMM/SVM method for predicting cutting chatter
Proceedings of SPIE (October 13 2006)
High-bitrate approximation
Proceedings of SPIE (November 13 2003)
Multiscale image coder
Proceedings of SPIE (May 19 1992)

Back to Top