Image compression is achieved by removing data redundancy while preserving information content. SPIHT is computationally very fast and among the best image compression algorithms known today. According to statistic analysis of the output binary stream of SPIHT encoding, propose a simple and effective method combined with Entropy for further compression that saves a lot of bits in the image data...

We attempt to quantify the coding gain due to parent-child dependencies in subband transforms. These dependencies are generally credited for the excellent MSE performances of zero-tree based compression algorithms such as EZW and SPIHT. It is a simple matter to devise an experiment to remov e the ability of zero-tree coders to exploit the parent-child dependence. The goal is to prevent the tree...

Rapid advances in networking technologies and the explosive growth of the Internet in recent years have increasingly raised the heterogeneity issue (in end-users processing capabilities and access bandwidth) for transmission of visual information. The traditional approach of providing multiple bitstreams, each tailored for one class of decoding requirements to address the heterogeneity issue is...

In this paper, we present a novel energy compaction method, called the selective block-wise reordering, which is used with SPIHT (SBR-SPIHT) coding for low rate video coding to enhance the coding efficiency for motion-compensated residuals. In the proposed coding system, the motion estimation and motion compensation schemes of H.263 are used to reduce the temporal redundancy. The residuals are ...

Ubiquitous use of real-time video communication on the Internet requires adaptive applications that can provide different levels of quality depending on the amount of resources available. For video coding this means that the algorithms must be designed to be efficient in bandwidth usage, processing requirements and quality of the reconstructed signal. Of most algorithms developed, SPIHT algorit...

Among noteworthy zero-tree algorithms is the SPIHT algorithm. For images with textures, high frequency wavelet coefficients are likely to become significant after few scan passes of SPIHT, and therefore the coding results are often insufficient. It is desirable that the low frequency and high frequency components of an image are coded using different strategies. In this paper, we propose a hybr...

This paper presents a region-based encoding/decoding for image sequences using Spatio-Temporal Tree Preserving 3-D SPIHT (STTP-SPIHT) algorithm, which is based on the 3-D SPIHT concepts, then further describes multiresolution decoding of the sequences. We have already proved the efficiency and robustness of the STTP-SPIHT in both of noisy and noiseless channels. This coder has also added benefi...

We extend the work of Sherwood and Zeger [1, 2] to progressive video coding for noisy channels. By utilizing a three-dimensional (3-D) extension of the set partitioning in hierarchical trees (SPIHT) algorithm [3], we cascade the resulting 3-D SPIHT video coder [4, 5] with the ratecompatible punctured convolutional (RCPC) channel coder [6] for transmission of video over a binary symmetric channe...

In this paper, a modiication of the 3-D SPIHT, 11 which is the 3-D extension to image sequence of 2-D SPIHT still image coding, 4 is presented in order to allow more exibility in choosing the number of frames to be processed at one time by introducing unbalanced tree structure. Simulation shows that 3-D SPIHT with reduced coding latency still achieves coding results comparable to MPEG-2, and ex...