From Time–Frequency to Vertex–Frequency and Back

Ljubiša Stanković, Jonatan Lerga, Danilo Mandic, Miloš Brajović, Cédric Richard and Miloš Daković
Additional contact information
Ljubiša Stanković: Faculty of Electrical Engineering, University of Montenegro, 81000 Podgorica, Montenegro
Jonatan Lerga: Center for Artificial Intelligence and Cybersecurity, Faculty of Engineering, University of Rijeka, 51000 Rijeka, Croatia
Danilo Mandic: Faculty of Electrical Engineering, Imperial College London, London SW72AZ, UK
Miloš Brajović: Faculty of Electrical Engineering, University of Montenegro, 81000 Podgorica, Montenegro
Cédric Richard: Electrical Egineering, University Cote d’Azur, 06100 Nice, France
Miloš Daković: Faculty of Electrical Engineering, University of Montenegro, 81000 Podgorica, Montenegro

Mathematics, 2021, vol. 9, issue 12, 1-40

Abstract: 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.

Keywords: time–frequency; vertex–frequency; graph; big data (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/12/1407/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/12/1407/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:12:p:1407-:d:576638

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().