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

The set partitioning in hierarchical trees (SPIHT) wavelet image coding algorithm can be interpreted as implicitly using classification in its bit-plane coding procedure. The source distribution induced by this classification is studied and rate-distortion performance is evaluated. A quadtree sorting procedure, similar to SPIHT, is used to explicitly form classes of wavelet coefficients. The cl...

SPIHT (Set Partitioning In hierachical trees), being an efficient coding method for wavelet coefficients, has acquired more and more widely application, especially in image/video compression fields. But, conventional SPHIT have some obvious limitions. For example, when for the color image compression, polarmetric SAR image compression, or multispectrum image compression and other multi-channel ...

In this paper, we evaluate the performance of some wavelet based coding algorithms such as 3D QT-L, 3D SPIHT and JPEG2K. In the first step we achieve an objective comparison between three coders, namely 3D SPIHT, 3D QT-L and JPEG2K. For this purpose, eight MRI head scan test sets of 256 x 256x124 voxels have been used. Results show superior performance of 3D SPIHT algorithm, whereas 3D QT-L out...

An embedded image coder that provides very eeective progressive image transmission and a high degree of spatial scalability while achieving superior visual performance to SPIHT is presented. A new partitioning structure combined with scale-based wavelet weights achieves a signiicance reordering that codes more signiicant information belonging to the lower frequency bands earlier in the bitstrea...

Image compression is an important tool to reduce the bandwidth and storage requirements of practical image systems. It has been successfully implemented to provide high compression rates while maintaining good image quality. Wavelet transform is the latest method of compression where in ability to describe any type of signal both in time and frequency domain. To explore the effect of various im...