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.