FFT and Convolution Performance in Image Filtering on GPU

Ondrej Fialka, Martin Cadik
Department of Computer Science and Engineering, Czech Technical University in Prague, Karlovo namesti 13, 121 35 Prague, Czech Republic
In Proceedings of the Tenth International Conference on Information Visualisation, Los Alamitos: IEEE Computer Society, p. 609-614. 2006


   title={FFT and convolution performance in image filtering on GPU},

   author={Fialka, O. and Cadik, M.},

   booktitle={Information Visualization, 2006. IV 2006. Tenth International Conference on},







Download Download (PDF)   View View   Source Source   



Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphics-hardware (GPU) is very desirable to preserve interactivity of the main visualization tool itself. In this article we take a close look on GPU implementation of two basic approaches to image filtering -fast Fourier transform (frequency domain) and convolution (spatial domain). We evaluate these methods in terms of the performance in real time applications and suitability for GPU implementation. Convolution yields better performance than fast Fourier transform (FFT) in many cases; however, this observation cannot be generalized. In this article we identify conditions under which the FFT gives better performance than the corresponding convolution and we assess the different kernel sizes and issues of application of multiple filters on one image.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: