Highly scalable image compression based on SPIHT for network applications

In this paper we propose a highly scalable image compression scheme based on the Set Partitioning in Hierarchical Trees (SPIHT) algorithm. Our algorithm, called Highly Scalable SPIHT (HS-SPIHT), supports spatial and SNR scalability and provides a bitstream that can be easily adapted (reordered) to given bandwidth and resolution requirements by a simple transcoder (parser). The HS-SPIHT algorithm adds the spatial scalability feature without sacrificing the SNR embeddedness property as found in the original SPIHT bitstream. HS-SPIHT finds applications in progressive web browsing, flexible image storage and retrieval and image transmission over heterogeneous networks.