Set Partitioning in Hierarchical Trees (SPIHT) is a highly efficient technique for compressing Discrete Wavelet Transform (DWT) decomposed images. Though its compression efficiency is a little less famous than Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, SPIHT has a straight forward coding procedure and requires no tables. These make SPIHT a more appropriate algo...

This paper presents an audio coder based on the combination of the Modulated Lapped Transform (MLT) with the Set Partitioning In Hierarchical Trees (SPIHT) algorithm. SPIHT allows scalable coding by transmitting more important information first in an efficient manner. The results presented reveal that the Modulated Lapped Transform (MLT) based scheme produces a high compression ratio for little...

Due to the large requirement for memory and the high complexity of computation, JPEG2000 cannot be used in many conditions especially in the memory constraint equipment. The line-based W avelet transform was proposed and accepted because lower memory is required without affecting the result of W avelet transform, In this paper, the improved lifting schem e is introduced to perform W avelet tran...

Listless Block Tree Coding (LBTC) is Wavelet Block Truncation Coding (WBTC) algorithm without using lists. LBTC is evolved from two variants of Set Partitioning In Hierarchal Trees (SPIHT) which are Wavelet based Block Tree Coding (WBTC) and No list SPIHT (NLS). WBTC works on blocks with varying root sizes instead of pixels so it lowers the memory requirement as compared to SPIHT and uses three...

The SPIHT (set partitioning in hierarchical trees) algorithm by Said and Pearlman is known to have produced some of the best results in still image coding. It is a fully embeded wavelet coding algorithm with precise rate control and low complexity. In this paper is presented an application of the SPIHT algorithm to video sequences, using three-dimensional (3D) wavelet decompositions and 3D spat...

In this paper, we propose an efficient method for rearranging the wavelet packet coefficients of an image to form hierarchical trees, by which the well known SPIHT algorithm can be applied. For images with textures, the high frequency wavelet coefficients are likely to become significant after several code passes of SPIHT, which degrades substantially the coding performance. As a result, the hi...

The three-dimensional (3-D) SPIHT coder has proved its efficiency and its realtime capability in compression of video. A forward-error-correcting (FEC) channel (RCPC) code combined with a single ARQ (automatic-repeat-request) proved to be an effective means for protecting the bitstream. There were two problems with this scheme: the noiseless reverse channel ARQ may not be feasible in practice; ...

This paper presents a fully scalable texture coding algorithm for arbitrarily shaped video object based on the 3D-SPIHT algorithm. The proposed algorithm, called Fully Scalable Object-based 3D-SPIHT (FSOB-3DSPIHT), modifies the 3D-SPIHT algorithm to code video objects with arbitrary shape and adds spatial and temporal scalability features to it. It keeps important features of the original 3D-SP...

-In this paper, we propose an efficient method for rearranging the wavelet packet coefficients of an image to form hierarchical trees, by which the well known SPIHT algorithm can be applied. For images with textures, the high frequency wavelet coefficients are likely to become significant after several code passes of SPIHT, which degrades substantially the coding performance. As a result, the h...