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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Andreopoulos, Y., Zervas, N.D., Lafruit, G., Schelkens, P., Stouraitis, T., Goutis, C.E., Cornelis, J.
Format: Conference Proceeding
Language:English
Subjects:
Arithmetic
Bandwidth
Filters
Image coding
Laboratories
MPEG 4 Standard
Production systems
Random access memory
Very large scale integration
Wavelet transforms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICIP.2001.958118