DMCA
Optimized Shape Adaptive Wavelets With Reduced Computational Cost
Cached
Download Links
BibTeX
@MISC{Mertins_optimizedshape,
author = {Alfred Mertins and King N. Ngan},
title = {Optimized Shape Adaptive Wavelets With Reduced Computational Cost},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Wavelets are often characterized through their number of vanishing moments. The more vanishing moments a wavelet has the better are the compaction properties for low-order polynomial signals. However, when bounding wavelets on intervals in order to define wavelet transforms over regions of arbitrary support, some of the moment properties get lost. This is typically accompanied with a loss of compaction gain and other unwanted effects. In this paper, we present methods for recovering the moment properties in the boundary regions. The approach recovers the moments step by step, requires a low number of computations and is well suited for the implementation with finite-precision arithmetic. 1 INTRODUCTION The discrete wavelet transform (DWT) is known to be one of the most efficient tools for image compression [1]. The principle of this transform is to hierarchically decompose a signal into a multiresolution pyramid, where the signal is split into a coarse approximation and some detail i...
Keyphrases
shape adaptive wavelet reduced computational cost moment property compaction property multiresolution pyramid wavelet transforms low-order polynomial signal boundary region vanishing moment moment step low number arbitrary support compaction gain unwanted effect efficient tool coarse approximation discrete wavelet transform image compression
