In this paper we propose a modification of the 3-D Set Partitioning in Hierarchical Trees (3-D SPIHT) algorithm for very low bit-rate wavelet-based video coding. The modified algorithm, called 3-D Virtual SPIHT (3-D VSPIHT), virtually decomposes the coarsest level of the wavelet coefficients to reduce the number of three-dimensional (spatio-temporal) sets in the 3-D SPIHT algorithm. Our simulat...

Because of excellent properties, people has paid more attention to SPIHI algorithm, which is based on the traditional wavelet transformation theory, but it also has its shortcomings. Combined the progress in the present wavelet domain and the human's visual characteristics, we propose an improved algorithm based on human visual characteristics of SPIHT in the base of analysis of SPIHI algorithm...

Among all wavelet transform and zero-tree quantization based image coding algorithms, set partitioning in hierarchical trees (SPIHT) is well known for its simplicity and efficiency. But theoretical analysis and experimental results have shown there are still some key points need to be further improved. This paper proposes a coefficient Statistic based Modified SPIHT Lossless Image Compression A...

An efficient, secure color image coder incorporating Color-SPIHT (C-SPIHT) compression and partial encryption is presented. Confidentiality of the image data is achieved by encrypting only the significance bits of individual wavelet coefficients for K iterations of the C-SPIHT algorithm. By varying K, the level of confidentiality vs. processing overhead can be controlled. For K=2, adequate secu...

In the output of the state-of-art embedded wavelet image encoder SPHIT, three kinds of bits, namely the significance information bits, sign bits and refinement bits are interleaved, making unequal error protection(UEP) ineffective. In this work, we observed a beautiful property of SPIHT. The synchronization in decoding is of no influence if we split the original embedded bit stream into three i...

This paper present a listless implementation of fully scalable image coding based on set partitioning in hierarchical trees algorithm. Fully Scalable set partitioning in hierarchical trees(FSSPIHT) image coding algorithm is a very effective state-of-art technique for compression of wavelet transformed images and having quality to give good compression efficiency, full embeddedness and rate scal...

We have implemented a prototype system consisting of a Java-based image viewer and a web server extension component for transmitting Magnetic Resonance Images (MRI) to an image viewer, to test the performance of different image retrieval techniques. We used full-resolution images, and images compressed/decompressed using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algor...

In this article, a new transmission system of encrypted image based on novel chaotic system and SPIHT technique is proposed. This chaotic system is made up of two chaotic systems already developed: the discrete-time modified Henon chaotic system and the continuous-time Colpitts one. The transmission system is designed to take profit of two advantages. The first is the use of a robust and standa...

A vector extension of the Set Partitioning in Hierarchical Trees (SPIHT) algorithm, named vector-SPIHT (VSPIHT), using trained classified successive refinement VQ, has recently been proposed. In this work, vector set-partitioning is applied to multispectral image compression, in particular to 24-bit color images. Since the individual spectral components are sufficiently correlated, VSPIHT can e...