Fast algorithm for binary field wavelet transform for image processing

The 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