Everything About ___
Live briefing

Everything about Graph Fourier transform

Mathematical transform

In mathematics, the graph Fourier transform is a mathematical transform which eigendecomposes the Laplacian matrix of a graph into eigenvalues and eigenvectors. Analogously to the classical Fourier transform, the eigenvalues represent frequencies and eigenvectors form what is known as a graph Fourier basis. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Graph Fourier transformA 5-minute orientation
  2. Skim a recent paper: Generalized sampling of graph signals with the prior information based on graph fractional Fourier transformInfluential work since 2022
  3. Pick up a classic book: Probability on algebraic and geometric structuresThe most-reprinted book on the subject
  4. Read the landmark paper: Fourier-transform method of fringe-pattern analysis for computer-based topography and interferometryCited 3,782 times
  5. Go sideways: Shrinkage Fields (image restoration)A closely related topic
  6. Go sideways: Functional principal component analysisA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Definition
  2. Properties
  3. Applications
  4. Toolbox

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics