FFT based convolution

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3154
The Fourier transform of the convolution of two images is equal to the product of their
Fourier transform. With this definition, it is possible to create a convolution filter
based on the Fast Fourier Transform (FFT). The interesting complexity characteristics of
this transform gives a very efficient convolution filter for large kernel images.

This paper provides such a filter, as well as a detailed description of the implementation
choices and a performance comparison with the "simple" itk::ConvolutionImageFilter.
plus Automatic Testing Results by Insight-Journal Dashboard on Wed Mar 10 12:02:06 2010 for revision #1
starstarstarstarstar expertise: 5 sensitivity: 5

minus Excellent implementation and analysis. by Matthew Mccormick on 2010-12-05 03:28:16 for revision #4