SPIHT for Generalized Multiple Description

We present a simple and eecient scheme for using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algorithm 1] 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.