Input feature-map stack
Sliding K×K window
Standard conv cost
Depthwise cost
Pointwise (1×1) cost
⚠ Couldn't renderCanvas 2D context failed to initialize. Try reloading.
Every convolutional neural network for computer vision spends most of its compute budget sliding filters across feature maps. This 2D companion renders that sliding-window mechanic as a top-down, pannable/zoomable scene: a fanned stack of channel cards with a gold K×K window sliding across it, next to a pair of live bar charts. Change the kernel size and the input/output channel counts and watch the two cost bars — standard convolution versus depthwise-plus-pointwise — update from the exact multiply-accumulate and parameter-count formulas used in the MobileNet paper, with a live speedup readout showing exactly how much cheaper the factored version is.