Computer Vision Foundations · free preview
The Gaussian Pyramid
Recursively blurring with the binomial kernel and decimating builds the Gaussian pyramid, a stack of valid images at geometrically shrinking scales computable as one telescoping matrix product.
1. Recursion with the binomial kernel
Recursion with the binomial kernel
2. The cascade as one matrix
The cascade as one matrix
3. Every level is a picture
Every level is a picture
4. What it costs and what it holds
What it costs and what it holds
5. Reading the recursion
In the Gaussian pyramid recursion g_{k+1} = D_k B_k g_k, what do B_k and D_k each do?
6. Why the cascade equals one wide blur
Why does g_3 = G_2 G_1 G_0 l equal a single convolution of l with a wide Gaussian?
7. The kernel's weight
Write the sum of the unnormalized binomial kernel [1 4 6 4 1].
Practice this interactively
Free account · instant grading · spaced review that schedules itself.
Start this course for free