|
|
||
|
This simulation visualizes 2D convolution for image processing: a small kernel matrix slides across the image, and each output pixel is a weighted sum of the neighborhood. Convolution is the foundation of blur, sharpen, and edge-detection filters in computer vision. Sections The convolution formulaFor an image I and kernel K of size m×m, the output at pixel (x, y) is: O(x,y) = Σi,j I(x+i, y+j) · K(i, j)
Indices i, j run over the kernel (e.g. −1, 0, 1 for a 3×3 kernel). At the image borders we use Clamp, Zero padding, or Wrap to define out-of-bounds pixels. PresetsBasic
Edge / Gradient (CNN) — these kernels resemble filters learned in the first layers of CNNs like AlexNet and VGG.
Frequency domainConvolution in the spatial domain equals multiplication in the frequency domain. A blur (low-pass) kernel has a compact spectrum (bright center); an edge (high-pass) kernel suppresses the center and keeps high frequencies. The tool shows the magnitude spectrum of the input and kernel by default (Show frequency domain (FFT) is checked). SimulationThe interactive simulator is below. Use the controls to explore the concepts described above. Kernel
Original (input)
Filtered (output)
Usage
Visualizations
Controls
Limitations
|
||