Krater
But what is a convolution?
A video on YouTube. In Science & Engineering, a Krater category.
Watch on YouTubeSummary by Krater
An introduction to discrete convolutions, explaining how they appear in probability, image processing, and polynomial multiplication, and showing how the Fast Fourier Transform (FFT) computes them efficiently in O(N log N) time.
From the video
Answers: What is a convolution and how does it work?
- discrete convolution
- probability distribution sums
- image processing kernels
- polynomial multiplication
- Fast Fourier Transform (FFT)
What it concludes
- Convolution of two sequences corresponds to multiplying their corresponding polynomials.
- Standard convolution takes O(N^2) operations, whereas using the Fast Fourier Transform (FFT) reduces this to O(N log N) operations.
Rate it, review it and add it to your lists in Krater.
Titles and thumbnails from YouTube. Krater isn't affiliated with, endorsed by or sponsored by YouTube or Google.