Smart wavelet image coding: X-tree approach

Authors:
Canhui Cai;Sanjit K. Mitra;Runtao Ding
Affiliations:
School of Electronic Information Engineering, Tianjin University, Tianjin, China;Signal and Image Processing Laboratory, Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;School of Electronic Information Engineering, Tianjin University, Tianjin, China
Venue:
Signal Processing
Year:
2002

Citing 8
Cited 3

The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
Arithmetic coding for data compression

Communications of the ACM
Image Coding based on Mixture Modeling of Wavelet Coefficients and a Fast Estimation-Quantization Framework

DCC '97 Proceedings of the Conference on Data Compression
Efficient Context-Based Entropy Coding Lossy Wavelet Image Compression

DCC '97 Proceedings of the Conference on Data Compression
Space-frequency quantization for wavelet image coding

IEEE Transactions on Image Processing
Comparison of different methods of classification in subband coding of images

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology
Stack-run image coding

IEEE Transactions on Circuits and Systems for Video Technology

Structure unanimity multiple description coding

Image Communication
Layer based multiple description packetized coding

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Tessellation based multiple description coding

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

Quantified Score

Hi-index	0.08

Visualization

Abstract

This paper presents a novel scheme of wavelet image coding, called X-tree coding. An X-tree is defined as a spatial hierarchical tree whose all descendants are insignificant, and it is used to denote 2-D clustered insignificant wavelet coefficients of an image. Two new coding schemes, the progressive X-tree approach and the stack X-tree approach, which are the X-tree versions of the embedded zerotree wavelet (EZW) algorithm and the stack-run coding algorithm, respectively, are proposed. Experimental results have shown that the performances of the proposed algorithms are better than those of the stack-run and the EZW algorithms, and are highly comparable to that of the set partitioning in hierarchical trees algorithm.