Analyzing the Approximation Error of the Fast Graph Fourier Transform

11/01/2017
by   Luc LeMagoarou, et al.
0

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.

READ FULL TEXT

page 4

page 5

research
10/11/2022

A Formalisation of a Fast Fourier Transform

This notes explains how a standard algorithm that constructs the discret...
research
07/29/2022

NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform

The non-equidistant fast Fourier transform (NFFT) is an extension of the...
research
12/21/2017

Multi-dimensional Graph Fourier Transform

Many signals on Cartesian product graphs appear in the real world, such ...
research
12/25/2017

Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding

t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for ...
research
09/26/2019

Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold

To numerically approximate Borel probability measures by finite atomic m...
research
01/04/2023

Learning Decorrelated Representations Efficiently Using Fast Fourier Transform

Barlow Twins and VICReg are self-supervised representation learning mode...
research
03/02/2022

Image-based material analysis of ancient historical documents

Researchers continually perform corroborative tests to classify ancient ...

Please sign up or login with your details

Forgot password? Click here to reset