A fast algorithm for vertex-frequency representations of signals on graphs.

Citation data:

Signal processing, ISSN: 0165-1684, Vol: 131, Page: 483-491

Publication Year:
2017
Usage 128
Abstract Views 126
Link-outs 2
Social Media 4
Tweets 4
Citations 3
Citation Indexes 3
PMID:
28479645
DOI:
10.1016/j.sigpro.2016.09.008
Author(s):
Jestrović, Iva, Coyle, James L, Sejdić, Ervin
Publisher(s):
Elsevier BV
Tags:
Engineering, Computer Science
Most Recent Tweet View All Tweets
article description
The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational complexity makes these algorithms impractical. We sought to develop a fast windowed graph Fourier transform and a fast graph S-transform requiring significantly shorter computation time. The proposed schemes have been tested with synthetic test graph signals and real graph signals derived from electroencephalography recordings made during swallowing. The results showed that the proposed schemes provide significantly lower computation time in comparison with the standard windowed graph Fourier transform and the fast graph S-transform. Also, the results showed that noise has no effect on the results of the algorithm for the fast windowed graph Fourier transform or on the graph S-transform. Finally, we showed that graphs can be reconstructed from the vertex-frequency representations obtained with the proposed algorithms.

This article has 0 Wikipedia reference.