Highly Scalable Image Compression Based on SPIHT for Network Applications

Habibollah Danyali; Alfred Mertins

doi:10.1109/ICIP.2002.1037998

Highly Scalable Image Compression Based on SPIHT for Network Applications

Habibollah Danyali, Alfred Mertins

Institute of Signal Processing

University of Wollongong

Abstract

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 language	English
Title of host publication	Proceedings. International Conference on Image Processing
Number of pages	4
Volume	1
Publisher	IEEE
Publication date	01.01.2002
Pages	217-220
ISBN (Print)	0-7803-7622-6
DOIs	https://doi.org/10.1109/ICIP.2002.1037998
Publication status	Published - 01.01.2002
Event	International Conference on Image Processing 2002 - Rochester, United States Duration: 22.09.2002 → 25.09.2002 Conference number: 60381

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/ICIP.2002.1037998

Cite this

@inproceedings{7f3b4d2308a540f68f582f65c1e623ac,

title = "Highly Scalable Image Compression Based on SPIHT for Network Applications",

abstract = "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.",

author = "Habibollah Danyali and Alfred Mertins",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/ICIP.2002.1037998",

language = "English",

isbn = "0-7803-7622-6",

volume = "1",

series = "IEEE International Conference on Image Processing",

publisher = "IEEE",

pages = "217--220",

booktitle = "Proceedings. International Conference on Image Processing",

note = "International Conference on Image Processing 2002 , ICIP'02 ; Conference date: 22-09-2002 Through 25-09-2002",

}

Danyali, H & Mertins, A 2002, Highly Scalable Image Compression Based on SPIHT for Network Applications. in Proceedings. International Conference on Image Processing. vol. 1, IEEE International Conference on Image Processing, IEEE, pp. 217-220, International Conference on Image Processing 2002 , Rochester, New York, United States, 22.09.02. https://doi.org/10.1109/ICIP.2002.1037998

TY - GEN

T1 - Highly Scalable Image Compression Based on SPIHT for Network Applications

AU - Danyali, Habibollah

AU - Mertins, Alfred

N1 - Conference code: 60381

PY - 2002/1/1

Y1 - 2002/1/1

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

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

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-0036450914&origin=inward&txGid=39d2609e63daffc87247df62d21ade63

U2 - 10.1109/ICIP.2002.1037998

DO - 10.1109/ICIP.2002.1037998

M3 - Conference contribution

SN - 0-7803-7622-6

VL - 1

T3 - IEEE International Conference on Image Processing

SP - 217

EP - 220

BT - Proceedings. International Conference on Image Processing

PB - IEEE

T2 - International Conference on Image Processing 2002

Y2 - 22 September 2002 through 25 September 2002

ER -

Highly Scalable Image Compression Based on SPIHT for Network Applications

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this