1102

Discrete Wavelet Transform on Consumer-Level Graphics Hardware

Tien-Tsin Wong, Chi-Sing Leung, Pheng-Ann Heng, Jianqing Wang
Dept. of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
Multimedia, IEEE Transactions on In Multimedia, IEEE Transactions on, Vol. 9, No. 3. (2007), pp. 668-673.

@article{wong2007discrete,

   title={Discrete wavelet transform on consumer-level graphics hardware},

   author={Wong, T.T. and Leung, C.S. and Heng, P.A. and Wang, J.},

   journal={Multimedia, IEEE Transactions on},

   volume={9},

   number={3},

   pages={668–673},

   issn={1520-9210},

   year={2007},

   publisher={IEEE}

}

Discrete wavelet transform (DWT) has been heavily studied and developed in various scientific and engineering fields. Its multiresolution and locality nature facilitates applications requiring progressiveness and capturing high-frequency details. However, when dealing with enormous data volume, its performance may drastically reduce. On the other hand, with the recent advances in consumer-level graphics hardware, personal computers nowadays usually equip with a graphics processing unit (GPU) based graphics accelerator which offers SIMD-based parallel processing power. This paper presents a SIMD algorithm that performs the convolution-based DWT completely on a GPU, which brings us significant performance gain on a normal PC without extra cost. Although the forward and inverse wavelet transforms are mathematically different, the proposed algorithm unifies them to an almost identical process that can be efficiently implemented on GPU. Different wavelet kernels and boundary extension schemes can be easily incorporated by simply modifying input parameters. To demonstrate its applicability and performance, we apply it to wavelet-based geometric design, stylized image processing, texture-illuminance decoupling, and JPEG2000 image encoding
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: