Le, Thanh Thanh and Nguyen, Linh Trung and Nguyen, Viet Dung and Karim, Abed Meraim (2017) A New Windowed Graph Fourier Transform. In: The 4th NAFOSTED Conference on Information and Computer Science (NICS), 24-25 November 2017, Hanoi, Vietnam. (In Press)
 | There is a more recent version of this item available. |
![[img]](https://eprints.uet.vnu.edu.vn/eprints/style/images/fileicons/application_pdf.png) |
PDF
Download (807kB) |
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Electronics and Communications Information Technology (IT) |
| Divisions: | Faculty of Electronics and Telecommunications (FET) |
| Depositing User: | A/Prof. Linh Trung Nguyen |
| Date Deposited: | 30 Oct 2017 08:07 |
| Last Modified: | 12 Dec 2017 08:14 |
| URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/2597 |
Available Versions of this Item
- A New Windowed Graph Fourier Transform. (deposited 30 Oct 2017 08:07) [Currently Displayed]
Actions (login required)
 |
View Item |
