Full metadata record
DC FieldValueLanguage
dc.contributor.authorLe, Trung-Thanh-
dc.contributor.authorNguyen, Linh-Trung-
dc.date.accessioned2019-09-05T03:40:12Z-
dc.date.available2019-09-05T03:40:12Z-
dc.date.issued2017-
dc.identifier.citationLe, T. T., & Nguyen, L. T. (2017). A New Windowed Graph Fourier Transform.vi
dc.identifier.urihttp://repository.vnu.edu.vn/handle/VNU_123/67101-
dc.description.abstractBig data analytics has become an industry due to the fact that massive datasets have been increasingly recorded over the last two decades and that they can be smartly mined to discover valuable information. This opens an emerging topic called “graph signal processing” (GSP) [1] which can be seen as inter-section of graph theory and computational harmonic analysis. GSP is strongly related to frequency analysis in which the windowed Fourier dictionary in general and the Fourier transform in particular not only plays important roles, but also is one of the most ac-cessible techniques. In this work, we are interested in generalizing the STFT to its counterpart in vertex-frequency graph signal processing, which is called windowed graph Fourier transform (Windowed GFT)vi
dc.language.isoenvi
dc.titleA New Windowed Graph Fourier Transformvi
dc.typeConference papervi
Appears in Collections:UET - Conference Proceedings


  • LTThanh_WindowedGFT_Poster_RS2017.pdf
    • Size : 508,65 kB

    • Format : Adobe PDF

    • View : 
    • Download : 
  • Full metadata record
    DC FieldValueLanguage
    dc.contributor.authorLe, Trung-Thanh-
    dc.contributor.authorNguyen, Linh-Trung-
    dc.date.accessioned2019-09-05T03:40:12Z-
    dc.date.available2019-09-05T03:40:12Z-
    dc.date.issued2017-
    dc.identifier.citationLe, T. T., & Nguyen, L. T. (2017). A New Windowed Graph Fourier Transform.vi
    dc.identifier.urihttp://repository.vnu.edu.vn/handle/VNU_123/67101-
    dc.description.abstractBig data analytics has become an industry due to the fact that massive datasets have been increasingly recorded over the last two decades and that they can be smartly mined to discover valuable information. This opens an emerging topic called “graph signal processing” (GSP) [1] which can be seen as inter-section of graph theory and computational harmonic analysis. GSP is strongly related to frequency analysis in which the windowed Fourier dictionary in general and the Fourier transform in particular not only plays important roles, but also is one of the most ac-cessible techniques. In this work, we are interested in generalizing the STFT to its counterpart in vertex-frequency graph signal processing, which is called windowed graph Fourier transform (Windowed GFT)vi
    dc.language.isoenvi
    dc.titleA New Windowed Graph Fourier Transformvi
    dc.typeConference papervi
    Appears in Collections:UET - Conference Proceedings


  • LTThanh_WindowedGFT_Poster_RS2017.pdf
    • Size : 508,65 kB

    • Format : Adobe PDF

    • View : 
    • Download :