Accelerating Wavelet Lifting on Graphics Hardware Using CUDA

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2011-01, Vol.22 (1), p.132-146
Main Authors: van der Laan, Wladimir J, Jalba, Andrei C, Roerdink, Jos B T M
Format: Article
Language:English
Subjects:
Acceleration
Blocking
Concurrent computing
CUDA
Design engineering
Discrete transforms
Discrete wavelet transform
Discrete wavelet transforms
Graphics
graphics hardware
Hardware
Hoisting
Image coding
Image compression
Performance analysis
Studies
Three dimensional
Two dimensional
Video compression
Video signal processing
wavelet lifting
Wavelet transforms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2010.143