Highly Scalable Image Compression Based on SPIHT for Network Applications

Habibollah Danyali, Alfred Mertins


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.

Original languageEnglish
Title of host publicationProceedings. International Conference on Image Processing
Number of pages4
Publication date01.01.2002
ISBN (Print)0-7803-7622-6
Publication statusPublished - 01.01.2002
EventInternational Conference on Image Processing 2002 - Rochester, United States
Duration: 22.09.200225.09.2002
Conference number: 60381


Dive into the research topics of 'Highly Scalable Image Compression Based on SPIHT for Network Applications'. Together they form a unique fingerprint.

Cite this