Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases

Related Items (1)

Achievable complexity-performance tradeoffs in lossy compression

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Universal almost sure data compression
The asymptotics of waiting times between stationary processes, allowing distortion
Achievable complexity-performance tradeoffs in lossy compression
Expander codes
Coding theorems for individual sequences
An Introduction to Arithmetic Coding
Modern Coding Theory
A coding theorem for lossy data compression by LDPC codes
Distortion-rate theory for individual sequences
Trellis Encoding of memoryless discrete-time sources with a fidelity criterion
Fixed rate universal block source coding with a fidelity criterion
Generalized Kraft Inequality and Arithmetic Coding
Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion
A universal algorithm for sequential data compression
Compression of individual sequences via variable-rate coding
An algorithm for source coding subject to a fidelity criterion, based on string matching
A survey of the theory of source coding with a fidelity criterion
A suboptimal lossy data compression based on approximate pattern matching
Fixed-slope universal lossy data compression
On the performance of data compression algorithms based upon string matching
An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
Pointwise redundancy in lossy data compression and universal lossy data compression
Natural type selection in adaptive lossy compression
Good codes based on very sparse matrices
Source coding, large deviations, and approximate pattern matching
Quantization
Construction and evaluation of trellis-coded quantizers for memoryless sources
Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
A vector quantization approach to universal noiseless coding and quantization
An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
Nonlinear Sparse-Graph Codes for Lossy Compression
Elements of Information Theory
Tree encoding of memoryless time-discrete sources with a fidelity criterion
Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion
A 2-cycle algorithm for source coding with a fidelity criterion

This page was built for publication: Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases