FFT based convolution
Year: 2010
Type: article
Abstract: 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.
Source: The Insight Journal
DOI: 10.54294/0iky0u
Author: Gaetan Lehmann
Language: English
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4205904065
