Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

2D discrete Fourier transform

A complex value F(u,v) for every row-frequency/column-frequency pair, computed from every pixel.

The 2D discrete Fourier transform of an H\times W image f(x,y) is F(u,v) = \sum_{x=0}^{H-1}\sum_{y=0}^{W-1} f(x,y)\, e^{-j2\pi(ux/H+vy/W)}, a full H\times W grid of complex numbers carrying exactly the same information as the original image, just organized by frequency instead of by position -- reversible via the inverse DFT.

Read the full section →
Graph settings

Calculator