liveBook · Manning

Downsampling

As explained in Grokking AI Algorithms, Second Edition

Downsampling is the process of reducing the spatial resolution of a representation while retaining information about larger-scale structure.

Downsampling reduces spatial resolution so a network can move beyond individual pixels and capture larger-scale meaning. In a U-Net, the encoder progressively shrinks a noisy image while acting as a visual summarizer: “What am I looking at?” section 12.17

A downsampling layer combines several operations:

  • A convolution scans feature maps with learned filters, combining local regions into new features. section 12.17
  • Padding preserves border coverage, while a stride of 2 makes the output spatially smaller. section 12.17
  • Additional channels let the smaller representation carry richer detected patterns; normalization and activation prepare values for later layers. section 12.17

From an 8×8 image to a smaller representation

An 8×8 noisy image first passes through eight 3×3 filters, producing an 8×8×8 set of feature maps. A later convolution uses 4×4 filters, padding of 1, and stride 2, shrinking the spatial dimensions while learning increasingly abstract features. section 12.17

Figure 12.34 The downsampling convolutional layer in our U-Net
12_34

Visualizes where the downsampling convolution sits within the U-Net. section 12.17

How Grokking AI Algorithms, Second Edition covers it

How deep it goes
Explains convolution, padding, stride, feature maps, normalization, and activation through a small worked implementation.
Examples
Uses an 8×8 noisy image, eight 3×3 filters, and a 4×4 stride-two convolution as concrete examples.
What you can do after
Build it from scratch with padding, convolution loops, filters, biases, and output-dimension calculations.
How it connects
Connects downsampling with U-Net, encoders, convolution, feature maps, group normalization, and activation functions.

Also explained in

Compare how 5 books explain downsampling →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Grokking AI Algorithms, Second Edition. The section links point to the parts of the book it draws on.