Stanford EE 368C - Distributed Compression For Still Images (20 pages)

Previewing pages 1, 2, 19, 20 of 20 page document View the full content.
View Full Document

Distributed Compression For Still Images



Previewing pages 1, 2, 19, 20 of actual document.

View the full content.
View Full Document
View Full Document

Distributed Compression For Still Images

11 views

Other


Pages:
20
School:
Stanford University
Course:
Ee 368c - Advanced Topics in Image, Video, and Multimedia

Unformatted text preview:

Distributed Compression For Still Images Kivanc Ozonat Distributed Compression For Still Im ages 1 Introduction Description of the Problem Related Concepts from Information Theory Application of Bit Plane Encoding as a Possible Solution Strategy Proposed Solution Using Transform Coding Basic Scheme Relation to the Information Theory Concepts Distributed Compression For Still Im ages 2 Problem Description Given two still images a noisy version X at the decoder and the original Y at the encoder how to transmit Y with the best coding efficiency No communication of X and Y at the encoder Y Encoder Decoder X Distributed Compression For Still Im ages 3 Information Theory Background Slepian Wolf Given the following scheme Encode X R1 X Y X Y Encode Y R2 Distributed Compression For Still Im ages 4 Information Theory Background Can transmit X and Y if R1 H X Y R2 H Y X and R1 R2 H X Y R2 H Y H Y X H X Y H X R1 Distributed Compression For Still Im ages 5 Information Theory Background Our problem is a special case of this R2 H Y H Y X H Y X H X Y H X R1 Distributed Compression For Still Im ages 6 General Solution Strategy Form cosets with 3 requirements Members of the same coset should be maximally separated Members of the same coset should have the same or very close probabilities of occurrence Coset construction should be practically implementable Distributed Compression For Still Im ages 7 Underlying Approach Use the Idea of Jointly Typical Sets Encode a long sequence length n of i i d sources together and form the typical set As n gets large the typical set contains almost all of the probability of occurrence Further the typical set has its members uniformly distributed Distributed Compression For Still Im ages 8 Underlying Approach The typical set contains most of the probability of occurrence but it has only power of 2 nH elements Typical Set Distributed Compression For Still Im ages 9 Underlying Approach Given i i d X and i i d Y can form long sequences to get the



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Distributed Compression For Still Images and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Distributed Compression For Still Images and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?