Approximation and acceleration of Graph Fourier Transform on Special graph structure
碩士 === 國立臺灣大學 === 電信工程學研究所 === 106 === Graph signal processing is a research area dealing with signals on graph, and Graph Fourier transform is a cornerstone of it. Different with discrete Fourier transform, who has fast Fourier transform as its fast implementation method, a full matrix-vector multi...
Main Authors: | Pi-Hau Shih, 時丕澔 |
---|---|
Other Authors: | Soo-Chang Pei |
Format: | Others |
Language: | zh-TW |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/jf3652 |
Similar Items
-
Graph polynomials and the discrete Fourier transform
by: Goodall, A. J.
Published: (2003) -
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering
by: Mario Coutino, et al.
Published: (2020-08-01) -
Graph embeddings and approximate graph coloring
by: Labelle, François.
Published: (2000) -
Approximations of Metric Graphs by Thick Graphs and Their Laplacians
by: Olaf Post
Published: (2019-03-01) -
A New Surrogating Algorithm by the Complex Graph Fourier Transform (CGFT)
by: Jordi Belda, et al.
Published: (2019-08-01)