Lossless image compression using binary wavelet transform

• DOI: 10.1049/iet-ipr:20060195
• Publication Date: 2007-11-29T23:22:44Z
• Authors: H. Pan; W.-C. Siu; N.-F. Law
• Keywords: Context-adaptive variable-length coding; Arithmetic coding; Lossy compression

A binary wavelet transform (BWT) has several distinct advantages over a real when applied to data. No quantisation distortion is introduced and the completely invertible. Since all operations involved are modulo-2 arithmetic, it extremely fast. The outstanding qualities of BWT make suitable for image-processing applications. BWT, originally designed images, extended lossless compression grey-level images. An in-place implementation structure explored. Then, simple embedded BWT-based image-coding algorithm called progressive partitioning wavelet-tree coder (PPBWC) proposed. proposed in concept implementation, but achieves promising efficiency as compared with conventional bitplane scanning methods. Small alphabets arithmetic coding, non-causal adaptive context modelling source division major factors that contribute gain PPBWC. Experimental results show PPBWC outperforms most other coders terms coding efficiency.