Interactive Compression of Digital Data
Open Access
- 29 January 2010
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 3 (1) , 63-75
Abstract
If we can use previous knowledge of the source (or the knowledge of a source that is correlated to the one we want to compress) to exploit the compression process then we can have significant gains in compression. By doing this in the fundamental source coding theorem we can substitute entropy with conditional entropy and we have a new theoretical limit that allows for better compression. To do this, when data compression is used for data transmission, we can assume some degree of interaction between the compressor and the decompressor that can allow a more efficient usage of the previous knowledge they both have of the source. In this paper we review previous work that applies interactive approaches to data compression and discuss this possibility.Keywords
This publication has 5 references indexed in Scilit:
- Clustering by CompressionIEEE Transactions on Information Theory, 2005
- Sending compressed messages to a learned receiver on a bidirectional lineInformation Processing Letters, 2001
- Compression in the presence of shared dataInformation Sciences, 2001
- OPTIMAL INTER-FRAME ALIGNMENT FOR VIDEO COMPRESSIONInternational Journal of Foundations of Computer Science, 1994
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987