Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29108
Title: Fast algorithm for over-complete wavelets
Authors: Law, NF 
Siu, WC 
Issue Date: 2001
Publisher: Institution of Engineering and Technology
Source: Electronics letters, 2001, v. 37, no. 4, p. 259-261 How to cite?
Journal: Electronics letters 
Abstract: The computational complexity of the over-complete wavelet representation is studied. It is found that the inverse transform is nearly three times more costly in computation than the forward transform. By exploiting the redundancy between the lowpass and the bandpass outputs, the computation is greatly simplified, resulting in an efficient inverse.
URI: http://hdl.handle.net/10397/29108
ISSN: 0013-5194
EISSN: 1350-911X
DOI: 10.1049/el:20010183
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Aug 21, 2017

Page view(s)

34
Last Week
2
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



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