Wavelet zerotree encoding has been proven to be an efficient way of compressing still images. Two well-known zerotree encoding algorithms, Embedded Zerotree Encoding (EZW) and Set Partitioning in Hierarchical Trees (SPIHT), provide excellent progressive display when images are transmitted over reliable networks. However, both algorithms are state-dependent and can perform poorly over unreliable...

This work proposes optimal image transmission over coded Orthogonal Frequency Division Multiplexing system with Low Density Parity Check Coding. The DWT based Set Partitioning in Hierarchical Trees algorithm is used for source coding of the images to be transmitted. It improves the transmission efficiency for progressive image transmission over Additive White Gaussian Noise channel. Study Work ...

In this paper, we present a compressed-domain watermarking technique for still images based on the SPIHT (set partitioning in hierarchical trees) coding. The proposed watermark is engraved on the refinement bits of SPIHT. By jointly considering watermarking and compression, the proposed quantization-based watermark suffers less degradation from the host interference and lossy compression. Water...

This paper presents a steganography method using lossy compressed video which provides a natural way to send a large amount of secret data. The proposed method is based on 3-D set partitioning in hierarchical trees (SPIHT) algorithm for video compression and bit-plane complexity segmentation (BPCS) steganography. In 3-D SPIHT coding, wavelet coefficients in 3-D discrete wavelet transformed vide...

This paper proposes a technique for scalable and also provides for lossless compression. It reduces smooth objective scalability, in terms of SegSNR, from lossy to lossless compression. The proposal is built around the perceptual SPIHT algorithm, which is a modification of the SPIHT algorithm and is introduced in this paper. Both objective and subjective results are reported and demonstrate tha...

In this paper we have discussed compression and analysis of image using high resolution grid and SPIHT encoding technique. Firstly the original image is converted in to low resolution (less size) image, then quantization and SPIHT encoding, techniques are applied to compress the image. To restore the original image, the compressed image is decompressed (dequantized & decoded) and interpolation ...

Said and Pearlman’s Set Partitioning In Hierarchical Trees (SPIHT) algorithm [5] is a well-known and efficient zerotree coding algorithm. However SPIHT’s high memory requirement is a major drawback for hardware implementation. In this paper we present a color image coding algorithm which requires much less memory during coding. Consequently the implementation complexity and hardware cost can be...

In this paper, a new method for blind watermarking is used to achieve robustness against SPIHT compression methods as well as some other well known attacks such as Histogram Equalization, Gamma Correction, median noise, salt and pepper noise. The watermark is encoded via singular value decomposition and later embedded. Then we apply discrete wavelet transform (Haar) at one level and the waterma...