Title: | Accelerating discrete wavelet transforms on parallel architectures |
Authors: | Bařina, David Kula, Michal Matýšek, Michal Zemčík, Pavel |
Citation: | Journal of WSCG. 2017, vol. 25, no. 2, p. 77-85. |
Issue Date: | 2017 |
Publisher: | Václav Skala - UNION Agency |
Document type: | článek article |
URI: | wscg.zcu.cz/WSCG2017/!_2017_Journal_WSCG-No-2.pdf http://hdl.handle.net/11025/26285 |
ISSN: | 1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (on-line) |
Keywords: | diskrétní vlnová transformace;zpracování obrazu;synchronizace;grafický procesor |
Keywords in different language: | discrete wavelet transform;image processing;synchronization;graphics processors |
Abstract in different language: | The 2-D discrete wavelet transform (DWT) can be found in the heart of many image-processing algorithms. Until recently, several studies have compared the performance of such transform on various shared-memory parallel architectures, especially on graphics processing units (GPUs). All these studies, however, considered only separable calculation schemes. We show that corresponding separable parts can be merged into non-separable units, which halves the number of steps. In addition, we introduce an optional optimization approach leading to a reduction in the number of arithmetic operations. The discussed schemes were adapted on the OpenCL framework and pixel shaders, and then evaluated using GPUs of two biggest vendors. We demonstrate the performance of the proposed non-separable methods by comparison with existing separable schemes. The non-separable schemes outperform their separable counterparts on numerous setups, especially considering the pixel shaders. |
Rights: | © Václav Skala - UNION Agency |
Appears in Collections: | Volume 25, Number 2 (2017) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Barina.pdf | Plný text | 628,05 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/26285
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.