Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19667
Title: Fast algorithm for binary field wavelet transform for image processing
Authors: Law, NF 
Liew, AWC
Siu, WC 
Issue Date: 2001
Source: IEEE International Conference on Image Processing, 2001, v. 2, p. 281-284 How to cite?
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.
Description: IEEE International Conference on Image Processing (ICIP), Thessaloniki, 7-10 October 2001
URI: http://hdl.handle.net/10397/19667
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
Citations as of Apr 10, 2016

Page view(s)

31
Last Week
1
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check



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