Windowing methods for graph signal localization

In this paper we considered windows used for local vertex spectrum analysis of graph signals. In addition to a review of the convolution based windowing method, two methods based on the vertex neighborhood are presented. They are based on the graph path lengths. In the first one the number of edges in a path determine window size, while the edge weights are taken into account in the second method. Signal localization is performed by using these window functions. Windowing methods are used for signal local vertex spectrum calculation with a test signal. Norm one based concentration measure is used for comparison.

[1]  Boualem Boashash,et al.  Time-Frequency Signal Analysis and Processing: A Comprehensive Reference , 2015 .

[2]  Yuan Yan Tang,et al.  Multi-windowed graph Fourier frames , 2016, 2016 International Conference on Machine Learning and Cybernetics (ICMLC).

[3]  Jelena Kovacevic,et al.  Discrete Signal Processing on Graphs: Sampling Theory , 2015, IEEE Transactions on Signal Processing.

[4]  Guillermo Sapiro,et al.  A short-graph fourier transform via personalized pagerank vectors , 2015, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[5]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs , 2012, IEEE Transactions on Signal Processing.

[6]  Pierre Vandergheynst,et al.  A windowed graph Fourier transform , 2012, 2012 IEEE Statistical Signal Processing Workshop (SSP).

[7]  Ervin Sejdic,et al.  A fast algorithm for vertex-frequency representations of signals on graphs , 2017, Signal Process..

[8]  Ljubisa Stankovic,et al.  Vertex-Frequency Analysis: A Way to Localize Graph Spectral Components [Lecture Notes] , 2017, IEEE Signal Processing Magazine.

[9]  LJubisa Stankovic,et al.  A measure of some time-frequency distributions concentration , 2001, Signal Process..

[10]  Budimir Lutovac,et al.  A resistive circuits analysis using graph spectral decomposition , 2017, 2017 6th Mediterranean Conference on Embedded Computing (MECO).

[11]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs: Frequency Analysis , 2013, IEEE Transactions on Signal Processing.

[12]  Ljubisa Stankovic,et al.  Vertex-Frequency Energy Distributions , 2018, IEEE Signal Processing Letters.

[13]  James L. Coyle,et al.  Differences in brain networks during consecutive swallows detected using an optimized vertex–frequency algorithm , 2017, Neuroscience.

[14]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[15]  José M. F. Moura,et al.  Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure , 2014, IEEE Signal Processing Magazine.

[16]  Pierre Vandergheynst,et al.  Vertex-Frequency Analysis on Graphs , 2013, ArXiv.