@inproceedings{SisLab3034,
       booktitle = {The 4th NAFOSTED Conference on Information and Computer Science (NICS)},
           month = {November},
           title = {A New Windowed Graph Fourier Transform},
          author = {Trung Thanh Le and Linh Trung Nguyen and Viet Dung Nguyen and Karim Abed-Meraim},
            year = {2017},
           pages = {150--155},
             url = {https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3034/},
        abstract = {Many practical networks can be mathematically modeled as graphs. Graph signal processing (GSP), intersecting graph theory and computational harmonic analysis, can be used to analyze graph signals. Just as short-time Fourier transform (STFT) for time-frequency analysis in classical signal processing, we have windowed graph Fourier transform (WGFT) for vertex-frequency analysis in GSP. In this paper, we introduced a new graph modulation operator that satisfies the property of spectral conservation, and a new graph translation operator with interesting properties. Based on these operators, we presented a new method to obtain the WGFT with a tight vertex-frequency frame. These GSP tools were developed based on the graph adjacency matrix. Using time-series graph, USA graph and random graph as examples, we showed by simulation the advantages of our proposed GSP tools over the state-of-the-arts.}
}