English

The Parallel Algorithm for the 2-D Discrete Wavelet Transform

Computer Vision and Pattern Recognition 2017-09-27 v3

Abstract

The discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processors, this scheme is inappropriate due to a large number of steps. On such architectures, the number of steps corresponds to the number of points that represent the exchange of data. Consequently, these points often form a performance bottleneck. Our approach appropriately rearranges calculations inside the transform, and thereby reduces the number of steps. In other words, we propose a new scheme that is friendly to parallel environments. When evaluating on multi-core CPUs, we consistently overcome the original lifting scheme. The evaluation was performed on 61-core Intel Xeon Phi and 8-core Intel Xeon processors.

Keywords

Cite

@article{arxiv.1708.07853,
  title  = {The Parallel Algorithm for the 2-D Discrete Wavelet Transform},
  author = {David Barina and Pavel Najman and Petr Kleparnik and Michal Kula and Pavel Zemcik},
  journal= {arXiv preprint arXiv:1708.07853},
  year   = {2017}
}

Comments

accepted for publication at ICGIP 2017