A fast and efficient computational structure for the 2D over-complete wavelet transform

Ngai Fong Law, W. C. Siu

Research output: Journal article publicationConference articleAcademic researchpeer-review

2 Citations (Scopus)


We 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 significantly more costly in computation than the forward transform. In order to reduce the computational complexity, a new spatial implementation is proposed. This new implementation exploits the 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 the computations, give an efficient inverse structure and allow the use of an arbitrary boundary extension method without affecting the ease of the inverse transform.
Original languageEnglish
Pages (from-to)309-312
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Publication statusPublished - 25 Sept 2003
Event2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong
Duration: 6 Apr 200310 Apr 2003

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Acoustics and Ultrasonics


Dive into the research topics of 'A fast and efficient computational structure for the 2D over-complete wavelet transform'. Together they form a unique fingerprint.

Cite this