Concept

Locality Principle in Computer Vision

The locality principle asserts that the earliest layers of a computer vision network should focus exclusively on local regions, without regard for the contents of the image in distant areas. Mathematically, this constrains the network's parameters such that outside a localized range (a>Δ|a| > \Delta or b>Δ|b| > \Delta), the convolution weights are set to zero ([V]a,b=0[\mathbf{V}]_{a, b} = 0). The hidden representation is computed as:

[H]i,j=u+a=ΔΔb=ΔΔ[V]a,b[X]i+a,j+b[\mathbf{H}]_{i, j} = u + \sum_{a = -\Delta}^{\Delta} \sum_{b = -\Delta}^{\Delta} [\mathbf{V}]_{a, b} [\mathbf{X}]_{i+a, j+b}

By restricting the network to glean relevant information only from a bounded window around each pixel, this principle drastically reduces the number of learnable parameters (e.g., from 4×1064 \times 10^6 down to 4Δ24 \Delta^2).

0

1

Updated 2026-05-09

Contributors are:

Who are from:

Tags

D2L

Dive into Deep Learning @ D2L