A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition

Author

Andreopoulos, Y. ; Zervas, N.D. ; Lafrui, G. ; Schelkens, P. ; Stouraitis, T. ; Goutis, C.E. ; Cornelis, J.

Author_Institution

Dept. ETRO, Vrije Univ., Brussels, Belgium

Volume

3

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

330

Abstract

A new method for the implementation of the binary-tree decomposition of the convolution-based wavelet transform, called the local wavelet transform (LWT) has been recently proposed in the literature. While it produces exactly the same results as the classical row-column implementation of the transform, it has many implementation benefits. This fact is shown experimentally for the first time for a general-purpose processor-based architecture, by comparing our C implementation of the LWT with an optimal C implementation of the lifting-scheme row-column algorithm. The comparisons are made for the forward multilevel binary-tree decomposition using the 9/7 filter pair, in the typical Intel Pentium processor family

Keywords

C language; computer architecture; convolution; data compression; image coding; multimedia computing; tree data structures; wavelet transforms; 2D multilevel decomposition; 9/7 filter pair; C implementation; Intel Pentium processor family; LWT; convolution-based wavelet transform; forward multilevel binary tree decomposition; image compression; local wavelet transform; multimedia; optimal row-column algorithm; Arithmetic; Bandwidth; Filters; Image coding; Laboratories; MPEG 4 Standard; Production systems; Random access memory; Very large scale integration; Wavelet transforms;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 2001. Proceedings. 2001 International Conference on

Conference_Location

Thessaloniki

Print_ISBN

0-7803-6725-1

Type

conf

DOI

10.1109/ICIP.2001.958118

Filename

958118