Learning-Based Vision Foundations
Convolution arithmetic, backpropagation, losses and optimization, regularization, and transfer learning.
Key Terms
Python Tools
Textbook Reference
Topics Covered
- 1Convolution arithmetic: kernel size, stride, padding, dilation, and receptive field
- 2Forward and backward passes and the chain rule on computation graphs
- 3Classification and regression losses and their gradients
- 4Optimization: SGD, momentum, Adam, learning-rate schedules, and batch normalization
- 5Regularization and transfer learning: weight decay, dropout, augmentation, and fine-tuning
Learning Outcomes
- Compute output shapes and receptive fields for convolutional stacks
- Explain backpropagation through convolution, pooling, and normalization layers
- Select losses, optimizers, and regularizers and set up transfer learning
Architecture walkthrough
From hand-crafted features to a learned detector
Seven stages, 23 steps: what changes when features are learned, how one convolution is computed, how depth buys receptive field, transfer learning, the backbone–neck–head split, and what the head predicts. The convolutions, receptive fields, parameter counts, IoU, NMS and average precision on screen are all computed live, not hard-coded.
1 / 23
Stage 1 · Step 1 of 3
What was fixedFrom designed features to learned features
In the classical pipeline the detector, the descriptor and the pooling were all designed by hand. Only the codebook and the classifier saw the data.
Key idea
Bag-of-Features learned two blocks out of four. A convolutional detector learns all of them, so the features are optimised for the task instead of chosen in advance.
Playing. Selecting any stage or step pauses playback so you can inspect it.
Lecture PDFs
Learning-Based Vision Foundations
The embedded PDF preview is disabled to reduce Vercel bandwidth usage. Open the lecture file directly in Google Drive for viewing, downloading, or presenting.