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

Institut für Signalverarbeitung

University of Wollongong

24 Zitate (Scopus)

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.

Originalsprache	Englisch
Titel	Proceedings. International Conference on Image Processing
Seitenumfang	4
Band	1
Herausgeber (Verlag)	IEEE
Erscheinungsdatum	01.01.2002
Seiten	217-220
ISBN (Print)	0-7803-7622-6
DOIs	https://doi.org/10.1109/ICIP.2002.1037998
Publikationsstatus	Veröffentlicht - 01.01.2002
Veranstaltung	International Conference on Image Processing 2002 - Rochester, USA / Vereinigte Staaten Dauer: 22.09.2002 → 25.09.2002 Konferenznummer: 60381

UN SDGs

Dieser Output leistet einen Beitrag zu folgendem(n) Ziel(en) für nachhaltige Entwicklung

SDG 9 – Industrie, Innovation und Infrastruktur

Dokumente

10.1109/ICIP.2002.1037998

Weitere Links

https://www.scopus.com/pages/publications/0036450914

Zitieren

@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. Bd. 1, IEEE International Conference on Image Processing, IEEE, S. 217-220, International Conference on Image Processing 2002 , Rochester, New York, USA / Vereinigte Staaten, 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/pages/publications/0036450914

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

Dokumente

Weitere Links

Fingerprint

Zitieren