Binary pseudowavelets and applications to bilevel image processing

This paper shows the existence of binary pseudowavelets, bases on the binary domain that exhibit some of the properties of wavelets, such as multiresolution reconstruction and compact support. The binary pseudowavelets are defined on B/sup n/ (binary vectors of length n) and are operated upon with the binary operators logical and, and exclusive or. The forward transform, or analysis, is the decomposition of a binary vector into its constituent binary pseudowavelets. Binary pseudowavelets allow multiresolution, progressive reconstruction of binary vectors by using progressively more coefficients in the inverse transform. Binary pseudowavelets bases, being sparse matrices, also provide for fast transforms; moreover pseudowavelets rely on hardware-friendly operations for efficient software and hardware implementation.

[1]  Ignace Lemahieu,et al.  Binary tree context modeling of halftone images using a fast adaptive template selection scheme , 1998, Other Conferences.

[2]  Yoshua Bengio,et al.  Browsing through high quality document images with DjVu , 1998, Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-.

[3]  Steven Pigeon,et al.  Lossy compression of partially masked still images , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[4]  Ignace Lemahieu,et al.  Improved lossless halftone image coding using a fast adaptive context template selection scheme , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).