Fast over-complete wavelet implementation for spline family

Ngai Fong Law; W. C. Siu

doi:10.1109/ICME.2002.1035878

Fast over-complete wavelet implementation for spline family

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

Abstract

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 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.

Original language	English
Title of host publication	Proceedings - 2002 IEEE International Conference on Multimedia and Expo, ICME 2002
Publisher	IEEE
Pages	701-704
Number of pages	4
Volume	1
ISBN (Electronic)	0780373049
DOIs	https://doi.org/10.1109/ICME.2002.1035878
Publication status	Published - 1 Jan 2002
Event	2002 IEEE International Conference on Multimedia and Expo, ICME 2002 - Lausanne, Switzerland Duration: 26 Aug 2002 → 29 Aug 2002

Conference

Conference	2002 IEEE International Conference on Multimedia and Expo, ICME 2002
Country/Territory	Switzerland
City	Lausanne
Period	26/08/02 → 29/08/02

ASJC Scopus subject areas

Archaeology
Electrical and Electronic Engineering

More information

10.1109/ICME.2002.1035878

Cite this

@inproceedings{540a897dce0147988359b4df4cd291a0,

title = "Fast over-complete wavelet implementation for spline family",

abstract = "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 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.",

author = "Law, {Ngai Fong} and Siu, {W. C.}",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/ICME.2002.1035878",

language = "English",

volume = "1",

pages = "701--704",

booktitle = "Proceedings - 2002 IEEE International Conference on Multimedia and Expo, ICME 2002",

publisher = "IEEE",

address = "United States",

note = "2002 IEEE International Conference on Multimedia and Expo, ICME 2002 ; Conference date: 26-08-2002 Through 29-08-2002",

}

TY - GEN

T1 - Fast over-complete wavelet implementation for spline family

AU - Law, Ngai Fong

AU - Siu, W. C.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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 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.

AB - 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 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.

UR - http://www.scopus.com/inward/record.url?scp=84908346602&partnerID=8YFLogxK

U2 - 10.1109/ICME.2002.1035878

DO - 10.1109/ICME.2002.1035878

M3 - Conference article published in proceeding or book

VL - 1

SP - 701

EP - 704

BT - Proceedings - 2002 IEEE International Conference on Multimedia and Expo, ICME 2002

PB - IEEE

T2 - 2002 IEEE International Conference on Multimedia and Expo, ICME 2002

Y2 - 26 August 2002 through 29 August 2002

ER -

Fast over-complete wavelet implementation for spline family

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this