From Time–Frequency to Vertex–Frequency and Back
The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided. Vertex–frequency localization-based approaches to analyzing signals on the graph emerged as a res...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/12/1407 |
id |
doaj-ddc5564f99174a8eaf8bbc0defbacb66 |
---|---|
record_format |
Article |
spelling |
doaj-ddc5564f99174a8eaf8bbc0defbacb662021-07-01T00:25:55ZengMDPI AGMathematics2227-73902021-06-0191407140710.3390/math9121407From Time–Frequency to Vertex–Frequency and BackLjubiša Stanković0Jonatan Lerga1Danilo Mandic2Miloš Brajović3Cédric Richard4Miloš Daković5Faculty of Electrical Engineering, University of Montenegro, 81000 Podgorica, MontenegroCenter for Artificial Intelligence and Cybersecurity, Faculty of Engineering, University of Rijeka, 51000 Rijeka, CroatiaFaculty of Electrical Engineering, Imperial College London, London SW72AZ, UKFaculty of Electrical Engineering, University of Montenegro, 81000 Podgorica, MontenegroElectrical Egineering, University Cote d’Azur, 06100 Nice, FranceFaculty of Electrical Engineering, University of Montenegro, 81000 Podgorica, MontenegroThe paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided. Vertex–frequency localization-based approaches to analyzing signals on the graph emerged as a response to challenges of analysis of big data on irregular domains. Graph signals are either localized in the vertex domain before the spectral analysis is performed or are localized in the spectral domain prior to the inverse graph Fourier transform is applied. The latter approach is the spectral form of the vertex–frequency analysis, and it will be considered in this paper since the spectral domain for signal localization is well ordered and thus simpler for application to the graph signals. The localized graph Fourier transform is defined based on its counterpart, the short-time Fourier transform, in classical signal analysis. We consider various spectral window forms based on which these transforms can tackle the localized signal behavior. Conditions for the signal reconstruction, known as the overlap-and-add (OLA) and weighted overlap-and-add (WOLA) methods, are also considered. Since the graphs can be very large, the realizations of vertex–frequency representations using polynomial form localization have a particular significance. These forms use only very localized vertex domains, and do not require either the graph Fourier transform or the inverse graph Fourier transform, are computationally efficient. These kinds of implementations are then applied to classical time–frequency analysis since their simplicity can be very attractive for the implementation in the case of large time-domain signals. Spectral varying forms of the localization functions are presented as well. These spectral varying forms are related to the wavelet transform. For completeness, the inversion and signal reconstruction are discussed as well. The presented theory is illustrated and demonstrated on numerical examples.https://www.mdpi.com/2227-7390/9/12/1407time–frequencyvertex–frequencygraphbig data |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ljubiša Stanković Jonatan Lerga Danilo Mandic Miloš Brajović Cédric Richard Miloš Daković |
spellingShingle |
Ljubiša Stanković Jonatan Lerga Danilo Mandic Miloš Brajović Cédric Richard Miloš Daković From Time–Frequency to Vertex–Frequency and Back Mathematics time–frequency vertex–frequency graph big data |
author_facet |
Ljubiša Stanković Jonatan Lerga Danilo Mandic Miloš Brajović Cédric Richard Miloš Daković |
author_sort |
Ljubiša Stanković |
title |
From Time–Frequency to Vertex–Frequency and Back |
title_short |
From Time–Frequency to Vertex–Frequency and Back |
title_full |
From Time–Frequency to Vertex–Frequency and Back |
title_fullStr |
From Time–Frequency to Vertex–Frequency and Back |
title_full_unstemmed |
From Time–Frequency to Vertex–Frequency and Back |
title_sort |
from time–frequency to vertex–frequency and back |
publisher |
MDPI AG |
series |
Mathematics |
issn |
2227-7390 |
publishDate |
2021-06-01 |
description |
The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided. Vertex–frequency localization-based approaches to analyzing signals on the graph emerged as a response to challenges of analysis of big data on irregular domains. Graph signals are either localized in the vertex domain before the spectral analysis is performed or are localized in the spectral domain prior to the inverse graph Fourier transform is applied. The latter approach is the spectral form of the vertex–frequency analysis, and it will be considered in this paper since the spectral domain for signal localization is well ordered and thus simpler for application to the graph signals. The localized graph Fourier transform is defined based on its counterpart, the short-time Fourier transform, in classical signal analysis. We consider various spectral window forms based on which these transforms can tackle the localized signal behavior. Conditions for the signal reconstruction, known as the overlap-and-add (OLA) and weighted overlap-and-add (WOLA) methods, are also considered. Since the graphs can be very large, the realizations of vertex–frequency representations using polynomial form localization have a particular significance. These forms use only very localized vertex domains, and do not require either the graph Fourier transform or the inverse graph Fourier transform, are computationally efficient. These kinds of implementations are then applied to classical time–frequency analysis since their simplicity can be very attractive for the implementation in the case of large time-domain signals. Spectral varying forms of the localization functions are presented as well. These spectral varying forms are related to the wavelet transform. For completeness, the inversion and signal reconstruction are discussed as well. The presented theory is illustrated and demonstrated on numerical examples. |
topic |
time–frequency vertex–frequency graph big data |
url |
https://www.mdpi.com/2227-7390/9/12/1407 |
work_keys_str_mv |
AT ljubisastankovic fromtimefrequencytovertexfrequencyandback AT jonatanlerga fromtimefrequencytovertexfrequencyandback AT danilomandic fromtimefrequencytovertexfrequencyandback AT milosbrajovic fromtimefrequencytovertexfrequencyandback AT cedricrichard fromtimefrequencytovertexfrequencyandback AT milosdakovic fromtimefrequencytovertexfrequencyandback |
_version_ |
1721348676449730560 |