Binary-valued wavelet decompositions of binary images

We introduce a binary-valued wavelet decomposition of binary images. Based on simple modulo-2 operations, the transform is computationally simple and immune to quantization effects. The new transform behaves like its real-valued counterpart. In particular, it yields an output similar to the thresholded output of a real wavelet transform operating on the underlying binary image. Using a new binary field transform to characterize binary filters, binary wavelets are constructed in terms of 2-band perfect reconstruction filter banks. We include lossless image coding results to illustrate the compactness of the representation.

[1]  Rolf Johannesson,et al.  Algebraic methods for signal processing and communications coding , 1995 .

[2]  Ahmed H. Tewfik,et al.  Wavelet decomposition of binary finite images , 1994, Proceedings of 1st International Conference on Image Processing.

[3]  Ahmed H. Tewfik,et al.  A binary wavelet decomposition of binary images , 1996, IEEE Trans. Image Process..

[4]  P. P. Vaidyanathan,et al.  Paraunitary filter banks over finite fields , 1997, IEEE Trans. Signal Process..