An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
From MaRDI portal
Publication:4887059
DOI10.1109/18.490546zbMATH Open0890.94019OpenAlexW2114010146MaRDI QIDQ4887059FDOQ4887059
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
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)
- Arbitrary source models and Bayesian codebooks in rate-distortion theory
- Natural type selection in adaptive lossy compression
- An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
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)
