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

Recent success in wavelet image coding is mainly attributed to a recognition of the importance of data organization and representation. There have been several very competitive wavelet coders developed, namely, Shapiro's (1993) embedded zerotree wavelets (EZW), Servetto et al.'s (1995) morphological representation of wavelet data (MRWD), and Said and Pearlman's (see IEEE Trans. Circuits Syst. V...

INTRODUCTION With the promotion and application of digital imaging technology in the medical domain, the amount of medical images has grown rapidly. However, the commonly used compression methods cannot acquire satisfying results. METHODS In this paper, according to the existed and stated experiments and conclusions, the lifting step approach is used for wavelet decomposition. The physical an...

Lifting is an efficient algorithm to implement the discrete wavelet transform in order to overcome the drawbacks of the conventional wavelet transform that does not provide a compact representation of edges which are not in horizontal and vertical directions. The lifting scheme provides a general and flexible tool for the construction of wavelet decompositions and perfect reconstruction filter ...

We present a preliminary investigation of compression of segmented 3D seismic volumes for the rendering purposes. Promising results are obtained on the base of 3D discrete cosine transforms followed by the SPIHT coding scheme. An accelerated version of the algorithm combines 1D discrete cosine transform in vertical direction with the 2D wavelet transform of horizontal slices. In this case the S...