A New Windowed Graph Fourier Transform
Considering graph signal processing (GSP) as an extended version of classical signal processing, definition of fundamental concepts such as spectral, Fourier transform, generalized operators and so forth for graph setting is highly beneficial and meaningful to get a deep understand of graph signal...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | Conference paper |
| اللغة: | English |
| منشور في: |
2019
|
| الوصول للمادة أونلاين: | http://repository.vnu.edu.vn/handle/VNU_123/67096 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Vietnam National University, Hanoi |
| اللغة: | English |
| الملخص: | Considering graph signal processing (GSP) as an extended version of classical signal processing, definition of fundamental concepts such as spectral, Fourier transform, generalized operators and so forth for graph setting is highly beneficial and meaningful to get a deep understand of graph signals. In this paper, we concentrate on graph spectral analysis to aim at revealing hidden information of signals (data). In particular, we first define two new operators for GSP including translation and modulation, before introducing a new way to obtain the windowed graph Fourier transform called by namely Short Time Fourier Transform in classical setting. The experiment results indicate that our methods, which are more outstanding than those earlier methods, are much the same as their counterparts in classical signal processing. |
|---|