Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition

The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does not have a fast algorithm. In this work, we develop new appro...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on signal processing Ročník 67; číslo 18; s. 4855 - 4869
Hlavní autori:	Lu, Keng-Shih, Ortega, Antonio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 15.09.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms bipartite graph Clustering Computation Discrete Fourier transforms Eigenvalues and eigenfunctions Empirical analysis fast algorithm Fourier transforms Graph Fourier transform graph signal processing Graph theory Graphs Image processing Laplace equations Signal processing Signal processing algorithms symmetric graph Symmetry Topology Video compression
ISSN:	1053-587X, 1941-0476
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!