An on-line universal lossy data compression algorithm by continuous codebook refinement

Abstract

Presents an online algorithm for data compression with a fidelity criterion. For finite discrete memoryless sources satisfying certain reasonable conditions the asymptotic performance of the authors' algorithm achieves the fundamental rate distortion limit without assuming a priori knowledge of the source statistics.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>