Adaptive Selection and Rearrangement of Wavelet Packets for Quad-Tree Image Coding

In this paper, we present an efficient hybrid image compression method. According to Human eye sensitivity, It is not sensitive to gray-scale error, but the human eye is particularly sensitive to the image edge features, through we research strengths and weaknesses of the fractal image coding and SPIHT(set partitioning in hierarchical trees) algorithm, proposed a hybrid algorithm based on SPIHT and Fractal image compression algorithm, it makes full use of landscape features and human visual characteristics, the image is decompounded into low frequency sub-band and high frequency sub-band, then the low frequency sub-band is uses fractal coding, this could make the low-frequency information loss less who is sensitivity to human visual signal and the high frequency sub-band is uses SPIHT coding, so encoding time greatly reduced. Experimental results show that the Hybrid Image Compression Algorithm not only raises the coding efficiency and reconstructed image quality but also reduces the image encoding time.

This paper describes applying the Set Partitioning in Hierarchical Trees (SPIHT) algorithm using a devised model to compress audio signals. It allows choosing the amount of compression based upon bit rate requirements. A threshold setting model, based on energy and frequency patterns of the signal is used to assist the SPIHT encoder set efficient threshold values, based upon the nature of the audio. It is thus adaptable to the nature of the audio as well as the bit rate requirement. The implementation can be used for storage as well as progressive transmission.

We have considered, in this paper, two compression methods based on wavelet transform and progressive coding, called EZW (Embedded Zerotree Wavelet) and SPIHT (Set partitioning in hierarchical trees). These techniques provide the opportunity to significantly increase compression ratios while preserving high qualities of reconstructed medical images. Unlike the EZW, the SPIHT approach takes advantage of subband correlations at near and far resolution levels (father-son relationships). A partial ordering by amplitude of the wavelet coefficients of the DWT (Discrete Wavelet Transform), partitioning in hierarchical trees, and scheduling of the transmission of the refinement bits are the three ideas used by SPIHT (the amplitude of each significant coefficient is progressively refined). The goal is to create a digital tool with the required main compression rate and PSNR (Peak Signal to Noise Ratio) limitations for compressing medical images. A development of the two cited algorithms has been carried out. For their evaluation, several medical images from two databases were used. The results prove that these algorithms are very efficient. Also, it has been found that the obtained results with SPIHT method greatly exceed those provided by EZW approach. SPIHT approach is very efficient compared to EZW from the point of view of the compression ratio and the image quality.

Set Partitioning in Hierarchical Trees (SPIHT) is an effective image compression algorithm. SPIHT is a unique approach which transmits the values of the pixels indirectly to the coordinates. The packet coders in the images present a universal transform the framework in a constriction of the filter bank schema which is attained by the Space Frequency Quantization (SFQ) and the effective compression is achieved by the Huffman coding. The proposed scheme permits transformation in the joints and alterations in the discrete magnitude of the input image. Hence, coding performance is enhanced and the image is compressed without compromising the excellence of the image. MSPIHT is an enhanced algorithm that fits the requirement of medical image compression for storage and transmission of medical data. MSPIHT improves on the standard SPIHT in the encoding operation of wavelet coefficients to provide high quality images at low bit rates important in medical applications where accuracy is paramount. The modification is aimed at changing the set partitioning strategy by minimizing memory consumption rates, thus improving the compression ratio and speed. It also may be used at telemedicine where high image compression rate is required for the quick and efficient image transfer for diagnostics and consultations. Experimental results shows that the image compression scheme is improved with the SPIHT-SFQ based Huffman Coding scheme and it outperforms the current image compression algorithms.

This chapter is devoted to the exposition of a complete video coding system, which is based on coding of three dimensional (wavelet) subbands with the SPIHT (set partitioning in hierarchical trees) coding algorithm. The SPIHT algorithm, which has proved so successful in still image coding, is also shown to be quite effective in video coding, while retaining its attributes of complete embeddedness and scalability by fidelity and resolution. Three-dimensional spatio-temporal orientation trees coupled with powerful SPIHT sorting and refinement renders 3D SPIHT video coder so efficient that it provides performance superior to that of MPEG-2 and comparable to that of H.263 with minimal system complexity. Extension to color-embedded video coding is accomplished without explicit bit-allocation, and can be used for any color plane representation. In addition to being rate scalable, the proposed video coder allows multiresolution scalability in encoding and decoding in both time and space from one bit-stream. These attributes of scalability, lacking in MPEG-2 and H.263, along with many desirable features, such as full embedded-ness for progressive transmission, precise rate control for constant bit-rate (CBR) traffic, and low-complexity for possible software-only video applications, makes the proposed video coder an attractive candidate for for multi-media applications. Moreover, the codec is fast and efficient from low to high rates, obviating the need for a different standard for each rate range.

Image compression is an important task for image transmission and storage. Thus far many compression techniques have been developed, such as transform image coding, predictive image coding, Vector Quantisation (VQ) and so on. Of these compression techniques, the techniques based on transform coding and VQ have received considerable attention. Recently, hybrid schemes for effective image compression have gained enormous popularity among researchers. In this paper, we analyse a hybrid scheme combining Kohonen’s Self-Organising Feature Map (SOFM)-based VQ coding and Set Partitioning In Hierarchical Trees (SPIHT) coding for compression of images (Rawat and Meher, 2009). The reconstructed image quality achieved after decoding depends upon the wavelet used in SPIHT. The effectiveness of the scheme for various orthogonal and biorthogonal wavelets for the hybrid scheme is tested in terms of Peak Signal-to-Noise Ratio (PSNR) and Visual Information Fidelity (VIF).

We investigate the issue of efficient data organization and representation of the curved wavelet coefficients [curved wavelet transform (WT)]. We present an adaptive zero-tree structure that exploits the cross-subband similarity of the curved wavelet transform. In the embedded zero-tree wavelet (EZW) and the set partitioning in hierarchical trees (SPIHT), the parent-child relationship is defined in such a way that a parent has four children, restricted to a square of 2×2 pixels, the parent-child relationship in the adaptive zero-tree structure varies according to the curves along which the curved WT is performed. Five child patterns were determined based on different combinations of curve orientation. A new image coder was then developed based on this adaptive zero-tree structure and the set-partitioning technique. Experimental results using synthetic and natural images showed the effectiveness of the proposed adaptive zero-tree structure for encoding of the curved wavelet coefficients. The coding gain of the proposed coder can be up to 1.2 dB in terms of peak SNR (PSNR) compared to the SPIHT coder. Subjective evaluation shows that the proposed coder preserves lines and edges better than the SPIHT coder.

Wavelet-based image compression is proving to be a very effective technique for medical images, giving significantly better results than the JPEG algorithm. A novel scheme for encoding wavelet coefficients, termed set partitioning in hierarchical trees, has recently been proposed and yields significantly better compression than more standard methods. The authors report the results of experiments comparing such coding to more conventional wavelet compression and to JPEG compression on several types of medical images.

Medical images must be compressed before transmission due to bandwidth and storage limitations. The set partitioning in hierar- chical trees (SPIHT) algorithm is an efficient method for lossy and loss- less coding of medical images. We propose some modifications to the SPIHT algorithm. It is based on the idea of the insignificant correlation of wavelet coefficients among medium- and high-frequency subbands. In this scheme, insignificant wavelet coefficients that correspond to the same spatial location in the medium subbands can be used to reduce the redundancy by a combined function proposed in associated with the modified SPIHT. In high-frequency subbands, the modified SPIHT pro- poses a dictator to reduce the interband redundancy. Experimental re- sults indicate that the proposed technique improves the quality of the reconstructed medical image in terms of both the peak signal-to-noise ratio (PSNR) and the perceptual results over JPEG2000 and the original SPIHT at the same bit rate. © 2003 Society of Photo-Optical Instrumentation Engi- neers. (DOI: 10.1117/1.1578645)

In this paper, a new multiple description coding (MDC) method for color images is presented. The proposed approach bases on the set partitioning in hierarchical trees (SPIHT) algorithm to achieve a high image compression ratio; employs poly-phase sampling technique to generate multiple descriptions to adapt to varying internet environments. It results in having capabilities to conquer packet losses and remaining the reconstructed images with an acceptable quality. In order to preserve the progressive reconstruction properties for a color image transmission, the three components (Red, Green, and Blue) are encoded separately and their encoding results are interleaved for transmission. The proposed method is applicable to color images and is very flexible for practical applications. The experimental results are given to illustrate the characteristics and verify the efficiency of the proposed method.

Generally synthetic aperture radar (SAR) image compression methods based on wavelet transform remove statistic redundancy of image data and neglect visual redundancy. In view of this problem, a new image compression method based on human visual system (HVS) is proposed in this paper. First SAR image is decomposed by wavelet transform, then wavelet coefficients in different subbands are weighted by the peak of contrast sensitivity function (CSF) curve in wavelet domain, at last set partitioning in hierarchical trees (SPIHT) algorithm is used to code the weighted wavelet coefficients to form embedded bit stream. Compression results show that comparing with conventional SPIHT algorithm, the method proposed in this paper gets better subject visual quality at the same compression ratio with almost equivalent objective evaluation results

Recently many new algorithms for image compression based on wavelets have been developed.This paper gives a detailed explanation of SPIHT algorithm with the combination of Lempel Ziv Welch compression technique for image compression by MATLAB implementation. Set partitioning in Hierarchical trees (SPIHT) is one of the most efficient algorithm known today. Pyramid structures have been created by the SPIHT algorithm based on a wavelet decomposition of an image. Lempel Ziv Welch is a universal lossless data compression algorithm guarantees that the original information can be exactly reproduced from the compressed data.The proposed methods have better compression ratio, computational speed and good reconstruction quality of the image. To analysis the proposed lossless methods here, calculate the performance metrics as Compression ratio, Mean square error, Peak signal to Noise ratio. Key Words-LempelZivWelch (LZW),SPIHT,Wavelet

The objective of this paper is to implement SPIHT and WDR image coder. We have used here two different images Natural and Artificial. Artificial image stand for image on which enhancement techniques have been applied e.g Wallpaper whereas Natural image is an image on which no enhancement technique has been applied e.g image captured by camera directly. SPIHT stands for Set Partitioning in Hierarchical Trees (SPIHT) Coding. The SPIHT coder is a highly refined version of the EZW algorithm and is a powerful image compression algorithm that produces an embedded bit stream from which the best reconstructed images in the mean square error sense can be extracted at various bit rates. Some of the best results -- highest PSNR values for given compression ratios for a wide variety of images have been obtained with SPIHT. Hence, it has become the benchmark state-of-the-art algorithm for image compression. One of the defects of SPIHT is that it only implicitly locates the position of significant coefficients. This makes it difficult to perform operations which depend on the position of significant transform values, such as region selection on compressed data. Region selection, also known as region of interest (ROI), means a portion of a compressed image that requires increased resolution. Such compressed data operations are possible with the WDR algorithm of Tian and Wells. The term difference reduction refers to the way in which WDR encodes the locations of significant wavelet transform values. Although WDR will not produce higher PSNR values than SPIHT. With the implementation of these algorithms we have calculated the various parameters e.g. CR, PSNR, BPP & MSE to analyze PQS (picture Quality Scale). We have analyzed our results using various wavelet filters such as Biorthogonal, Coif lets, Daubechies and Symlets etc.

This paper describes a family of list-free tree-set scanning (LIFTS) algorithms, related to Shapiro's (1993) embedded zero-tree wavelet (EZW) coding and to Said and Pearlman's (see IEEE Trans. on Circuits and Systems for Video Technology, vol.6, no.3, p.243-9, 1996) set partitioning in hierarchical trees (SPIHT) algorithm. The principal advantage of the LIFTS algorithms is that they are parallelizable and require greatly reduced computational complexity and memory overhead, while nearly achieving the efficiency of SPIHT. The algorithms may be tailored to special requirements, such as transmission of a fully embedded bit-stream with sub-image refinement.

Transform coding has been the focus of the research for image compression. In previous research, the Amplitude and Group Partitioning (AGP) coding scheme is proved to be a low complexity algorithm with higher performance, clearly one of the state-of-art transform coding techniques. However, the previous AGP is used along with the Discrete Cosine Transform (DCT) and the discrete wavelet transform. In this paper, a different transform, the Lapped Orthogonal Transform (LOT), replaces the DCT in conjunction with the AGP. This is the first time LOT and AGP have been combined in a coding method. The definition and design of the LOT are discussed. An objective metric to measure the performance of transform, coding gain, is calculated for both the DCT and the LOT. The LOT has slightly higher coding gain than the DCT. The principles of the LOT based AGP image codec (LOT-AGP) are presented and a complete codec, encoder and decoder, is implemented in software. The performance of the LOT-AGP is compared with other block transform coding schemes: the baseline JPEG codec and the DCT based AGP image codec (DCT- AGP) by both objective evaluation and subjective evaluation. The Peak Signal to Noise Ratio (PSNR) is calculated for these three coding schemes. The two AGP codecs are much better than the JPEG codec on PSNR, from about 1.7 dB to 3 dB depending on bit rate. The two AGP schemes have PSNR differences only to a small degree. Visually, the LOT-AGP has the best-reconstructed images among these three at all bit rates. In addition, the coding results of two other state-of-art progressive image codecs are cited for further comparison. One is the Set Partitioning in Hierarchical Trees (SPIHT) algorithm with a dyadic wavelet transform, and the other is Tran and Nguyen's method with the generalized LOT transform. The AGP coding and the adaptive Huffman entropy coding of LOT-AGP are less complex and the memory usage is smaller than in these two progressive codecs. Comparing these three codecs, i.e. the LOT-AGP and the two progressive codecs in PSNR small only small differences in PSNR. SPIHT has about 1 dB higher PSNR than the LOT-AGP and Tran and Nguyen's method for the test image Lena. For the test image Barbara, the PSNR of the LOT- AGP is about 0.5 dB higher than that of the SPIHT and 0.5 dB lower than that of Tran and Nguyen's method. This low- complexity and high performance codec may provide a new direction for the implementation of image compression.