FFT and Convolution Performance in Image Filtering on GPU

Abstract

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

DOI: 10.1109/IV.2006.53

Extracted Key Phrases

7 Figures and Tables

Statistics

0102020072008200920102011201220132014201520162017
Citations per Year

86 Citations

Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Fialka2006FFTAC, title={FFT and Convolution Performance in Image Filtering on GPU}, author={Ondirej Fialka and Martin Cad{\'i}k}, journal={Tenth International Conference on Information Visualisation (IV'06)}, year={2006}, pages={609-614} }