IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i12p1407-d576638.html
   My bibliography  Save this article

From Time–Frequency to Vertex–Frequency and Back

Author

Listed:
  • 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)

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.

Suggested Citation

  • Ljubiša Stanković & Jonatan Lerga & Danilo Mandic & Miloš Brajović & Cédric Richard & Miloš Daković, 2021. "From Time–Frequency to Vertex–Frequency and Back," Mathematics, MDPI, vol. 9(12), pages 1-40, June.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1407-:d:576638
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/12/1407/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/12/1407/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Miloš Daković & Ljubiša Stanković & Ervin Sejdić, 2019. "Local Smoothness of Graph Signals," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-14, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jolene S. Ranek & Wayne Stallaert & J. Justin Milner & Margaret Redick & Samuel C. Wolff & Adriana S. Beltran & Natalie Stanley & Jeremy E. Purvis, 2024. "DELVE: feature selection for preserving biological trajectories in single-cell data," Nature Communications, Nature, vol. 15(1), pages 1-26, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1407-:d:576638. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.