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...

In this paper, we investigate region-based embedded wavelet compression methods and introduce region-based extensions of the Set Partitioning In Hierarchical Trees (SPIHT) and the Set Partitioning Embedded bloCK (SPECK) coding algorithms applied to the breast region of digital mammograms. We have compared these region-based extensions, called OB-SPIHT and OB-SPECK, against the original SPIHT an...

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...

This paper presents the Discrete Wavelet based fusion techniques for combining perceptually important image features. SPIHT (Set Partitioning in Hierarchical Trees) algorithm is an efficient method for lossy and lossless coding of fused image. This paper presents some modifications on the SPIHT algorithm. It is based on the idea of insignificant correlation of wavelet coefficient among the medi...

The SPIHT image compression algorithm is modified for application to large images with limited processor memory. The subband decomposition coefficients are partitioned into small tree-preserving spatial blocks which are each independently coded using the SPIHT algorithm. The bitstreams for each spatial block are assembled into a single final bitstream through one of two packetization schemes. T...

We carry out low bit-rate compression of multispectral images by means of the Said and Pearlman’s SPIHT algorithm, suitably modified to take into account the interband dependencies. Two techniques are proposed: in the first, a three-dimensional (3-D) transform is taken (wavelet in the spatial domain, Karhunen–Loeve in the spectral domain) and a simple 3-D SPIHT is used; in the second, after tak...