Algorithmic Rate-Distortion Theory
نویسندگان
چکیده
We propose and develop rate-distortion theory in the Kolmogorov complexity setting. This gives the ultimate limits of lossy compression of individual data objects, taking all effective regularities of the data into account.
منابع مشابه
Complexity distortion theory
Complexity distortion theory (CDT) is a mathematical framework providing a unifying perspective on media representation. The key component of this theory is the substitution of the decoder in Shannon’s classical communication model with a universal Turing machine. Using this model, the mathematical framework for examining the efficiency of coding schemes is the algorithmic or Kolmogorov complex...
متن کاملShannon Information and Kolmogorov Complexity
We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and where they are fundamentally different. We discuss and relate the basic notions of both theories: Shannon entropy versus Kolmogorov complexity, the relation of both to universal coding, Shannon mutual information versus Kolmogorov (‘algorithmic’) mutual inform...
متن کاملSubmitted to IEEE Transactions on Information Theory . Complexity Distortion
We propose a new theory, called Complexity Distortion Theory, which uses complexities or length of lossy descriptions to provide a much broader and unifying perspective on media representation. The key component of this theory is the substitution of Shannon's classical communication system model by an extention of Chaitin's model, where the decoder is a universal Turing machine and the codeword...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملRate-Distortion Optimized Embedding
In this paper, we improve the performance of the embedded coder by reorganising its output bitstream in the rate-distortion (R-D) sense. In the proposed rate-distortion optimized embedding (RDE), the coding bit is first allocated to the coefficient with the steepest R-D slope, i.e. the biggest distortion decrease per coding bit. To avoid transmission of the position of the coded coefficient, RD...
متن کامل