Natural type selection in adaptive lossy compression

IEEE Transactions on Information Theory

Volumn 47, Issue 1, 2001, Pages 99-111

  Zamir, Ram ^a,b   Rose, Kenneth ^a,c  

^a IEEE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c University of California   (United States)

Author keywords

Adaptive compression; Alternating optimization; Approximate string matching; Blahut Arimoto algorithm; Lempel Ziv coding; Rate distortion; Typical sequences; Universal coding

Indexed keywords

ADAPTIVE LOSSY COMPRESSION; APPROXIMATE STRING MATCHING; BLAHUT-ARIMOTO ALGORITHM; LEMPEL-ZIV ALGORITHM; RANDOM CODEBOOK; RATE DISTORTION FUNCTION; REPRODUCTION DISTRIBUTION; STEADY STATE ERROR; UNIVERSAL CODING;

ADAPTIVE ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATA COMPRESSION; ENCODING (SYMBOLS); ERROR ANALYSIS; ITERATIVE METHODS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

INFORMATION THEORY;

EID: 0035089002     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904515     Document Type: Article

References (26)

1. An algorithm for computing the capacity of arbitrary discrete memoryless channels
2. Computation of channel capacity and rate-distortion functions
3. An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions
4. On the computation of rate-distortion functions
5. Information geometry and alternating minimization procedures
6. The asymptotics of waiting times between stationary processes, allowing distortion
7. Asymptotic properties of algorithms for data compression with fidelity criterion based upon string matching
8. An implementable lossy version of the Lempel-Ziv algorithm-Part I: Optimality for memoryless sources
9. On the role of missmatch in rate-distortion theory
10. A suboptimal lossy data compression based on approximate pattern matching
11. An iterative technique for universal lossy compression of individual sequences
12. An extenssion of LZW coding algorithm to source coding subject to a fideleity criterion
13. The empirical distribution of good codes
14. An algorithm for source coding subject to a fidelity criterion, based on string matching
15. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
16. On the performance of data compression algorithms based upon string matching
17. On the redundancy of lossy source coding with abstract alphabets
18. Fixed slope universal lossy data compression
19. The index entropy in mismatched lossy source coding
20. Toward lossy Lempel-Ziv: Natural type selection
21. A type generation model for adaptive lossy compression
22. An on-line universal lossy data compression algorithm via continuous codebook refinement-Part I: Basic results
23. The redundancy of source coding with a fidelity criterion-Part one: Known statistics
24. Compression of individual sequences via variable rate coding