Research on the fast Fourier transform of image based on GPU

05/29/2015
by   Feifei Shen, et al.
0

Study of general purpose computation by GPU (Graphics Processing Unit) can improve the image processing capability of micro-computer system. This paper studies the parallelism of the different stages of decimation in time radix 2 FFT algorithm, designs the butterfly and scramble kernels and implements 2D FFT on GPU. The experiment result demonstrates the validity and advantage over general CPU, especially in the condition of large input size. The approach can also be generalized to other transforms alike.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2019

Performance Comparison Between OpenCV Built in CPU and GPU Functions on Image Processing Operations

Image Processing is a specialized area of Digital Signal Processing whic...
research
09/03/2021

Morlet wavelet transform using attenuated sliding Fourier transform and kernel integral for graphic processing unit

Morlet or Gabor wavelet transforms as well as Gaussian smoothing, are wi...
research
02/16/2021

cuFINUFFT: a load-balanced GPU library for general-purpose nonuniform FFTs

Nonuniform fast Fourier transforms dominate the computational cost in ma...
research
01/20/2022

Accelerating Laue Depth Reconstruction Algorithm with CUDA

The Laue diffraction microscopy experiment uses the polychromatic Laue m...
research
05/31/2020

A General-Purpose Dehazing Algorithm based on Local Contrast Enhancement Approaches

Dehazing is in the image processing and computer vision communities, the...
research
09/20/2020

3D Primitives Gpgpu Generation for Volume Visualization in 3D Graphics Systems

This article discusses the study of 3D graphic volume primitive computer...
research
10/05/2015

GPU-Based Computation of 2D Least Median of Squares with Applications to Fast and Robust Line Detection

The 2D Least Median of Squares (LMS) is a popular tool in robust regress...

Please sign up or login with your details

Forgot password? Click here to reset