liveBook · Manning

Local averaging

As explained in Inside Deep Learning: Math, Algorithms, Models

An image-smoothing transformation that averages local neighborhoods to reduce high-frequency detail before downsampling.

Local averaging smooths an image by replacing each pixel with the average of neighboring pixels. A convolution kernel performs this operation, washing out small noise and softening sharp edges before downsampling. section 3.3

For anti-aliased pooling, first compute max pooling with stride 1, then blur the result with a convolution using the desired stride. This mixes adjacent locations and reduces aliasing while retaining max-pooling behavior. section 14.1.2

A 3×3 image blur

Use a kernel whose nine entries are 1/9, convolve it with an MNIST digit image, and display the softened result. A binomial filter can instead concentrate more weight at the current location for anti-aliased pooling. section 14.1.2

How Inside Deep Learning: Math, Algorithms, Models covers it

How deep it goes
Defines neighborhood averaging, demonstrates convolution kernels, and implements configurable multidimensional blurring.
Examples
Uses an MNIST digit, a 3×3 averaging kernel, and a BlurLayer after stride-one max pooling.
What it assumes
Assumes familiarity with images and convolution while demonstrating the averaging operation from a concrete kernel.
What you can do after
Builds image blurs with convolution and applies anti-aliased pooling through a configurable BlurLayer.
How it connects
Connects convolution, pooling, anti-aliasing, aliasing, and translation invariance.

Also explained in

Compare how 7 books explain local averaging →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Inside Deep Learning: Math, Algorithms, Models. The section links point to the parts of the book it draws on.