Pattern Matching Image Compression: Algorithmic and Empirical Results
IEEE Transactions on Pattern Analysis and Machine Intelligence
Grid-based computer animation rendering
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Compression of small text files
Advanced Engineering Informatics
Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A universal scheme for Wyner-Ziv coding of discrete sources
IEEE Transactions on Information Theory
Achieving the rate-distortion bound with low-density generator matrix codes
IEEE Transactions on Communications
Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
| Hi-index | 754.90 |
Two universal lossy data compression schemes, one with fixed rate and the other with fixed distortion, are presented, based on the well-known Lempel-Ziv algorithm. In the case of fixed rate R, the universal lossy data compression scheme works as follows: first pick a codebook Bn consisting of all reproduction sequences of length n whose Lempel-Ziv codeword length is ⩽nR, and then use Bn to encode the entire source sequence n-block by n-block. This fixed-rate data compression scheme is universal in the sense that for any stationary, ergodic source or for any individual sequence, the sample distortion performance as n→∞ is given almost surely by the distortion rate function. A similar result is shown in the context of fixed distortion lossy source coding