Fast algorithm for binary field wavelet transform for image processing

Ngai Fong Law, A. W C Liew, W. C. Siu

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

1 Citation (Scopus)

Abstract

Lifting scheme for the real field wavelet transform has provided a new insight into its practical implementation. This paper shows that a similar scheme can be developed for the binary field wavelet transform. In particular, by using the Euclidean algorithm, the binary filters can be decomposed into a finite sequence of simple lifting steps over the binary field. This provides an alternative method for the implementations of the binary field wavelet transform for image processing applications. It is found that the new implementation can reduce the number of arithmetic operations involved in the transform and allow an efficient in-place implementation structure.
Original languageEnglish
Title of host publicationIEEE International Conference on Image Processing
Pages281-284
Number of pages4
Publication statusPublished - 1 Jan 2001
EventIEEE International Conference on Image Processing (ICIP) - Thessaloniki, Greece
Duration: 7 Oct 200110 Oct 2001

Conference

ConferenceIEEE International Conference on Image Processing (ICIP)
Country/TerritoryGreece
CityThessaloniki
Period7/10/0110/10/01

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fast algorithm for binary field wavelet transform for image processing'. Together they form a unique fingerprint.

Cite this