|
Title: Multiple Descriptions Encoding of Images Author: P. Subrahmanya and Toby Berger Published in: DCT
Abstract: Consider the following multiterminal data compression problem. An image is to be compressed and transmitted to a destination over a set of unreliable links. If only one of the links is functional (i.e. data transmitted over all other links is completely lost), we would like to be able to reconstruct a low resolution version of our original image. If more links are functional, we would like the image quality to improve. Finally, with all links functioning, we desire a high resolution, possibly lossless reconstruction of the original image. This problem is related to the multiple descriptions problem in source coding literature. See [1] for a survey of the literature.
Several motivating applications exist for this problem. For instance, in a digital image archive, it is desirable to store low resolution versions of each image at multiple locations so that even if a few of them are unavailable/corrupted/destroyed, we can reconstruct approximations to the original image using those that survive. If all the low resolution versions are available, we would like to be able to reconstruct the original image losslessly.
Another example arises in the downloading of images from an image library over the internet. Traditionally, all images are stored at a single site in the network. If any part of the network route leading to a site is congested, viewers wishing to view an image on that site will be faced with debilitating delays. A solution to this problem is to place low resolution versions of the image at multiple sites. Even if some of the sites are congested, viewers can satisfy themselves with a lower resolution version of the image reconstructed using the sites that become available within a reasonable delay. If all the sites can be accessed, then the viewer would get a high resolution version of the image. Usually, lossy compression is used in this application in order to achieve the high compression ratios needed to use network bandwidth effectively.
We present conceptually simple and computationally efficient schemes that are useful in scenarios such as those described above. Our schemes can be implemented as simple pre-processing and post-processing operations on existing image compression algorithms.
Reference: V.Vaishampayan, Design of multiple description scalar quantizers, IEEE Transactions on Information Theory, IT-39(3):821-834, May 1993.
Back to Summary
|