Analyzing the Approximation Error of the Fast Graph Fourier Transform - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Analyzing the Approximation Error of the Fast Graph Fourier Transform

Abstract

The graph Fourier transform (GFT) is in general dense and requires O(n 2) time to compute and O(n 2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal matrices). The truncation parameter, J, represents a trade-off between precision of the transform and time of computation (and storage space). We explore further this trade-off and study, on different types of graphs, how is the approximation error distributed along the spectrum.
Fichier principal
Vignette du fichier
paper.pdf (912.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01627434 , version 1 (01-11-2017)

Identifiers

  • HAL Id : hal-01627434 , version 1

Cite

Luc Le Magoarou, Nicolas Tremblay, Rémi Gribonval. Analyzing the Approximation Error of the Fast Graph Fourier Transform. ACSSC 2017 - 51st Annual Asilomar Conference on Signals Systems and Computers, Oct 2017, Monterey, California, United States. ⟨hal-01627434⟩
438 View
96 Download

Share

Gmail Facebook X LinkedIn More