An on-line universal lossy data compression algorithm via continuous codebook refinement--Part I: Basic results

A new on-line universal lossy data compression algorithm is presented. For finite memoryless sources with unknown statistics, its performance asymptotically approaches the fundamental rate distortion limit. The codebook is generated on the fly, and continuously adapted by simple rules. There is no s...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 42; no. 3; pp. 803 - 821
Main Authors: Zhang, Zhen, Wei, Victor K
Format: Journal Article
Language:English
Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 1996
Subjects:
Computer science
Cryptography
Data compression
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new on-line universal lossy data compression algorithm is presented. For finite memoryless sources with unknown statistics, its performance asymptotically approaches the fundamental rate distortion limit. The codebook is generated on the fly, and continuously adapted by simple rules. There is no separate codebook training or codebook transmission. Candidate codewords are randomly generated according to an arbitrary and possibly suboptimal distribution. Through a carefully designed 'gold washing' or 'information-theoretic sieve' mechanism, good codewords and only good codewords are promoted to permanent status with high probability. We also determine the rate at which our algorithm approaches the fundamental limit.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.490546