Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17934
Title: Fast over-complete wavelet implementation for spline family
Authors: Law, NF 
Siu, WC 
Keywords: Band-pass filters
Computational complexity
Data compression
Image coding
Image reconstruction
Low-pass filters
Signal representation
Splines (mathematics)
Transform coding
Wavelet transforms
Issue Date: 2002
Publisher: IEEE
Source: 2002 IEEE International Conference on Multimedia and Expo, 2002 : ICME '02 : proceedings : August, 2002, v. 1, p. 701-704 How to cite?
Abstract: We have studied the computational complexity of the over-complete wavelet representation for the commonly used spline wavelet family with an arbitrary order. By deriving a general expression for the complexity, it is shown that the inverse transform is nearly three times more costly in computation than the forward transform. In order to reduce the computational complexity, a new spatial implementation is proposed. This new implementation is based on the exploitation of redundancy between the lowpass and the bandpass outputs that is inherent to the over-complete wavelet scheme. It is shown that the new implementation can greatly simplify computation and give an efficient inverse structure.
URI: http://hdl.handle.net/10397/17934
ISBN: 0-7803-7304-9
DOI: 10.1109/ICME.2002.1035878
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

26
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.