SPIHT for generalized multiple description coding

Agnieszka C. Miguel, Alexander E. Mohr, Eve A. Riskin

Research output: Contribution to conferencePaperpeer-review

68 Scopus citations

Abstract

We present a simple and efficient scheme for using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algorithm in a generalized multiple description framework. To combat packet loss, controlled amounts of redundancy are added to the original data during the compression process. Unequal loss protection is implemented by varying the amount of redundancy with the importance of data. The algorithm achieves graceful degradation of image quality in the presence of increasing description loss; high image quality is obtained even when over half of the descriptions are lost.

Original languageEnglish
Pages842-846
Number of pages5
StatePublished - 1999
EventInternational Conference on Image Processing (ICIP'99) - Kobe, Jpn
Duration: 24 Oct 199928 Oct 1999

Conference

ConferenceInternational Conference on Image Processing (ICIP'99)
CityKobe, Jpn
Period24/10/9928/10/99

Fingerprint

Dive into the research topics of 'SPIHT for generalized multiple description coding'. Together they form a unique fingerprint.

Cite this