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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on signal processing Vol. 67; no. 18; pp. 4855 - 4869
Main Authors:	Lu, Keng-Shih, Ortega, Antonio
Format:	Journal Article
Language:	English
Published:	New York IEEE 15.09.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!