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

DOI10.1109/18.490546MaRDI QIDQ4887059zbMATH OpenOpenAlexFDO

Authors Zhen Zhang, Victor K. Wei

Publication date 3 July 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.490546

zbMATH Keywords

codebookcodewordslossy data compressionuniversal source codingrate distortion limit

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
• An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
• Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
• Compror: On-line lossless data compression with a factor oracle.
• An Algorithm for Universal Lossless Compression With Side Information
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• On-line adaptive canonical prefix coding with bounded compression loss
• On the performance of recency-rank and block-sorting universal lossless data compression algorithms
• scientific article; zbMATH DE number 764405
• Greedy Algorithms for On-Line Data Compression

Cited in

(4)

• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• Arbitrary source models and Bayesian codebooks in rate-distortion theory
• An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
• Natural type selection in adaptive lossy compression

This page was built for publication: An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887059)