CaltechAUTHORS
  A Caltech Library Service

Universal multiresolution source codes

Effros, Michelle (2001) Universal multiresolution source codes. IEEE Transactions on Information Theory, 47 (6). pp. 2113-2129. ISSN 0018–9448. http://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01

[img]
Preview
PDF
See Usage Policy.

594Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01

Abstract

A multiresolution source code is a single code giving an embedded source description that can be read at a variety of rates and thereby yields reproductions at a variety of resolutions. The resolution of a source reproduction here refers to the accuracy with which it approximates the original source. Thus, a reproduction with low distortion is a “high-resolution” reproduction while a reproduction with high distortion is a “low-resolution” reproduction. This paper treats the generalization of universal lossy source coding from single-resolution source codes to multiresolution source codes. Results described in this work include new definitions for weakly minimax universal, strongly minimax universal, and weighted universal sequences of fixed- and variable-rate multiresolution source codes that extend the corresponding notions from lossless coding and (single-resolution) quantization to multiresolution quantizers. A variety of universal multiresolution source coding results follow, including necessary and sufficient conditions for the existence of universal multiresolution codes, rate of convergence bounds for universal multiresolution coding performance to the theoretical bound, and a new multiresolution approach to two-stage universal source coding.


Item Type:Article
Additional Information:“©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.” Manuscript received April 13, 1999; revised June 22, 2000. This work was supported in part by NSF CAREER Award MIP-9501977, NSF Award CCR-9909026, under a grant from the Charles Lee Powell Foundation, and a grant from Caltech’s Lee Center for Advanced Networks. The material in this paper was presented in part at the 1999 IEEE Information Theory Workshop (DECI), Santa Fe, NM, February 1999. Communicated by N. Merhav, Associate Editor for Source Coding.
Subject Keywords:Embedded, multiuser information theory, progressive transmission, successive refinement, universal source coding, source code design, source coding theory, network information theory
Record Number:CaltechAUTHORS:EFFieeetit01
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01
Alternative URL:http://dx.doi.org/10.1109/18.945238
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:1034
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:02 Dec 2005
Last Modified:26 Dec 2012 08:42

Repository Staff Only: item control page