Accelerating Wavelet Lifting on Graphics Hardware Using CUDA

Authors:
Wladimir J. van der Laan;Andrei C. Jalba;Jos B. T. M. Roerdink
Affiliations:
University of Groningen, Groningen;Eindhoven University of Technology, Eindhoven;University of Groningen, Groningen
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2011

Citing 0
Cited 5

Two-Dimensional discrete wavelet transform on large images for hybrid computing architectures: GPU and CELL

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
Interactive Editing of GigaSample Terrain Fields

Computer Graphics Forum
Arbitrarily shaped virtual-object based video compression

Multimedia Tools and Applications
Accelerated implementation of adaptive directional lifting-based discrete wavelet transform on GPU

Image Communication
Accelerating FCM neural network classifier using graphics processing units with CUDA

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Discrete Wavelet Transform (DWT) has a wide range of applications from signal processing to video and image compression. We show that this transform, by means of the lifting scheme, can be performed in a memory and computation-efficient way on modern, programmable GPUs, which can be regarded as massively parallel coprocessors through NVidia's CUDA compute paradigm. The three main hardware architectures for the 2D DWT (row-column, line-based, block-based) are shown to be unsuitable for a CUDA implementation. Our CUDA-specific design can be regarded as a hybrid method between the row-column and block-based methods. We achieve considerable speedups compared to an optimized CPU implementation and earlier non-CUDA-based GPU DWT methods, both for 2D images and 3D volume data. Additionally, memory usage can be reduced significantly compared to previous GPU DWT methods. The method is scalable and the fastest GPU implementation among the methods considered. A performance analysis shows that the results of our CUDA-specific design are in close agreement with our theoretical complexity analysis.