FFT based convolution
INRA
| Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3154 |
Published in The Insight Journal - 2010 January-June.
Submitted by Gaetan Lehmann on 03-09-2010.
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.
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.
Code
Automatic Testing Results
by Insight-Journal Dashboard
on Wed Mar 10 12:02:06 2010 for revision #1 
expertise: 5 sensitivity: 5 Reviews
Statistics
 |
|
| Global rating: |
|
| Review rating: | [review]
|
| Code rating: |  
|
| Views: | 1879 |
| Downloads: | 505 |
Send a message to the author
Information
|
|
| Paper Id: | 717 |
| Categories: | Filtering, Parallelization, SMP |
| Keywords: | FFT, Convolution, Kernel, |
| Toolkit: | CMake, ITK |
| Revision: | |
| Status: | Open for public review |
| View license
Loading license...
| |
Data
|
|
| Full download: | .zip |
| Paper: | view, .pdf |
| Source code : | Download |
Share
|
Associated Publications
|
||
| FFT Complex to Complex filters and helper classes | ||
| An Open Source, Fast Ultrasound B-Mode Implementation for Commodity Hardware | ||
