RIS ID
7961
Abstract
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.
Publication Details
This article was originally published as: Danyali, H & Mertins, A, Highly scalable image compression based on SPIHT for network applications, Proceedings International Conference on Image Processing, 22-25 September 2002 , 1, 1-217 - 1-220. Copyright IEEE 2002.