The FFT on a GPU
dc.contributor.author | Moreland, Kenneth | en_US |
dc.contributor.author | Angel, Edward | en_US |
dc.contributor.editor | M. Doggett and W. Heidrich and W. Mark and A. Schilling | en_US |
dc.date.accessioned | 2013-10-28T10:01:31Z | |
dc.date.available | 2013-10-28T10:01:31Z | |
dc.date.issued | 2003 | en_US |
dc.identifier.isbn | 1-58113-739-1 | en_US |
dc.identifier.issn | 1727-3471 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/EGGH03/112-119 | en_US |
dc.description.abstract | The Fourier transform is a well known and widely used tool in many scientific and engineering fields. The Fourier transform is essential for many image processing techniques, including filtering, manip- ulation, correction, and compression. As such, the computer graphics community could benefit greatly from such a tool if it were part of the graphics pipeline. As of late, computer graphics hardware has become amazingly cheap, powerful, and flexible. This paper describes how to utilize the current gener- ation of cards to perform the fast Fourier transform (FFT) directly on the cards. We demonstrate a system that can synthesize an image by conventional means, perform the FFT, filter the image, and finally apply the inverse FFT in well under 1 second for a 512 by 512 image. This work paves the way for performing complicated, real-time image processing as part of the rendering pipeline. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | I.3.3 [Computer Graphics] | en_US |
dc.subject | Bitmap and framebuffer operations | en_US |
dc.subject | I.4.3 [Image Processing and Computer Vision] | en_US |
dc.subject | Filtering | en_US |
dc.title | The FFT on a GPU | en_US |
dc.description.seriesinformation | Graphics Hardware | en_US |
Files in this item
This item appears in the following Collection(s)
-
EGGH03: SIGGRAPH/Eurographics Workshop on Graphics Hardware 2003
ISBN 1-58113-739-1