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. In this paper, 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.
Original language | British English |
---|---|
Pages | 330-333 |
Number of pages | 4 |
State | Published - 2001 |
Event | IEEE International Conference on Image Processing (ICIP) - Thessaloniki, Greece Duration: 7 Oct 2001 → 10 Oct 2001 |
Conference
Conference | IEEE International Conference on Image Processing (ICIP) |
---|---|
Country/Territory | Greece |
City | Thessaloniki |
Period | 7/10/01 → 10/10/01 |