But what is a convolution?

Discrete convolutions, from probability to image processing and FFTs. Video on the continuous case: Help fund future projects: Special thanks to these supporters: #thanks An equally valuable form of support is to simply share the videos. ------------------ Other videos I referenced Live lecture on image convolutions for the MIT Julia lab Lecture on Discrete Fourier Transforms Reducible video on FFTs Veritasium video on FFTs A small correction for the integer multiplication algorithm mentioned at the end. A “straightforward” application of FFT results in a runtime of O(N * log(n) log(log(n)) ). That log(log(n)) term is tiny, but it is only recently in 2019, Harvey and van der Hoeven found an algorithm that removed that log(lo
Back to Top