这篇博客讨论了如何利用快速傅里叶变换(FFT)来优化1D、2D和3D卷积运算，相比于Matlab的CONV、CONV2和CONVN函数，当输入尺寸超过一定阈值时，FFT-based convolution能提供更快的计算速度。虽然其精度略低，但在处理大型数据时，尤其是在1D中对于nA, nB > 1000，2D中nA, nB > 20和3D中nA, nB > 5的情况下，FFT方法更优。
FFT-based convolution
As opposed to Matlab CONV, CONV2, and CONVN implemented as straight forward sliding sums, CONVNFFT uses Fourier transform (FT) convolution theorem, i.e. FT of the convolution is equal to the product of the FTs of the input functions.
In 1-D, the complexity is O((na+nb)*log(na+nb)), where na/nb are respectively the lengths of A and B.
Optional arguments to control the dimension(s) along which convolution is carried out.
Slightly less accurate than sliding sum convolution.
Good usage recommendation:
In 1D, this function is faster than CONV for nA, nB > 1000.
In 2D, this function is faster than CONV2 for nA, nB > 20.
In 3D, this function is faster than CONVN for nA, nB > 5.
1086
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
