Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19190
Title: Fast algorithm for quadratic and cubic spline wavelets
Authors: Law, NF 
Siu, WC 
Issue Date: 2001
Source: Proceedings of 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001, 2001, p. 247-250 How to cite?
Abstract: We studied the computational complexity of the over-complete wavelet representation for the commonly used quadratic and cubic Spline wavelets. It is found that the inverse transform is significantly more complicated than the forward transform. In order to reduce the computational complexity, a new spatial implementation is proposed. This spatial implementation is based on the exploration of the redundancy between the lowpass and the bandpass outputs. It is shown that by using the proposed implementation, the computation can be greatly simplified, resulting in an efficient inverse structure.
Description: 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001, Hong Kong, 2-4 May 2001
URI: http://hdl.handle.net/10397/19190
ISBN: 9628576623
9789628576623
DOI: 10.1109/ISIMP.2001.925380
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Aug 18, 2017

Page view(s)

28
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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