Fast algorithm for quadratic and cubic spline wavelets

Ngai Fong Law, W. C. Siu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001
Pages247-250
Number of pages4
Publication statusPublished - 1 Dec 2001
Event2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001 - Hong Kong, Hong Kong
Duration: 2 May 20014 May 2001

Conference

Conference2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2001
Country/TerritoryHong Kong
CityHong Kong
Period2/05/014/05/01

ASJC Scopus subject areas

  • Computer Science(all)

Cite this