Image Compression using SPIHT Algorithm- Review

This paper studies image compression using SPIHT and Modified SPIHT algorithm. Image compression is one of the important applications in data compression on its image. Image data requires huge amount of disk space and large bandwidths for transmission. Hence, image compression is necessary to reduce the amount of data required to represent digital image.Discrete Wavelet Transform (DWT) based image compression has been paid much attention in the past decades. DWT has been adopted as a new technical standard for still image compression. Set Partitioning in Hierarchical Trees (SPIHT) is the DWT-based image compression algorithm which is more powerful, efficient and more popular, due to the properties of fast computation, low memory requirement. Discrete wavelet transform (DWT) based Set Partitioning in Hierarchical Trees (SPIHT) algorithm is widely used in many image compression systems.In this paper an attempt has been made to study the performance of Set partition in Hierarchical Tree (SPIHT) and modified SPIHT algorithms for image compression. In addition to evaluate the performance of SPIHT algorithm with Modified SPIHT, it has given reduced scan redundancy and bit redundancy.