M-LTW: A fast and efficient intra video codec
Image Communication
Embedded image coding using zerotrees of wavelet coefficients
IEEE Transactions on Signal Processing
Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree
IEEE Transactions on Signal Processing
Significance-linked connected component analysis for wavelet image coding
IEEE Transactions on Image Processing
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
Image coding using wavelet transform
IEEE Transactions on Image Processing
Hierarchical Dynamic Range Coding of Wavelet Subbands for Fast and Efficient Image Decompression
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
Wavelet based rate scalable video compression
IEEE Transactions on Circuits and Systems for Video Technology
Significance-linked connected component analysis for very low bit-rate wavelet video coding
IEEE Transactions on Circuits and Systems for Video Technology
Low bit-rate scalable video coding with 3-D set partitioning in hierarchical trees (3-D SPIHT)
IEEE Transactions on Circuits and Systems for Video Technology
Embedded color image coding using SPIHT with partially linked spatial orientation trees
IEEE Transactions on Circuits and Systems for Video Technology
Low-Complexity Multiresolution Image Compression Using Wavelet Lower Trees
IEEE Transactions on Circuits and Systems for Video Technology
State-of-the-Art and Trends in Scalable Video Compression With Wavelet-Based Approaches
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
In this paper we analyze the impact of tree structures on the performance of zerotree-based wavelet video codecs. Since zerotree approach is based on aggregation of insignificant coefficients in trees, therefore design of a tree structure is the key issue for a better performance. We have considered six different tree structures with characteristics varying from a simple to relatively complex and composite tree structures to code the luminance-chrominance components of a video sequence. Their performances are compared in terms of average number of bits generated per bitplane, number of coded bitplanes for a given bit budget, rate-distortion performance, memory requirements and computational complexity. We observe that in general more complex and longer trees do not necessarily improve the coding efficiency. However, the tree structures encapsulating more elements per tree are memory efficient. Therefore, the rate-distortion performance, memory requirements and computational complexities need to be traded-off while selecting a particular tree structure. It is also observed that the additional improvement due to optional entropy coding is also tree structure dependent. Further, the simulation results show that by designing an efficient tree structure, depending on the picture content, the performance of a video coder can be improved by up to 2.0dB, while reducing the computational complexity by 45-60% as well as the memory requirements by almost 29-35%. Compared to the standard JPEG2000 (for intra-frame), tree-based coders are found to be efficient in terms of coding and complexity, particularly at lower bit rates.