Distributed Compression For Still Images

Slides:



Advertisements
Similar presentations
INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, ICT '09. TAREK OUNI WALID AYEDI MOHAMED ABID NATIONAL ENGINEERING SCHOOL OF SFAX New Low Complexity.
Advertisements

Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
Error detection and concealment for Multimedia Communications Senior Design Fall 06 and Spring 07.
Chapter 6 Information Theory
Distributed Video Coding Bernd Girod, Anne Margot Aagon and Shantanu Rane, Proceedings of IEEE, Jan, 2005 Presented by Peter.
BASiCS Group University of California at Berkeley Generalized Coset Codes for Symmetric/Asymmetric Distributed Source Coding S. Sandeep Pradhan Kannan.
Distributed Source Coding 教師 : 楊士萱 老師 學生 : 李桐照. Talk OutLine Introduction of DSCIntroduction of DSC Introduction of SWCQIntroduction of SWCQ ConclusionConclusion.
Transform Domain Distributed Video Coding. Outline  Another Approach  Side Information  Motion Compensation.
Department of Computer Engineering University of California at Santa Cruz Data Compression (2) Hai Tao.
Noise, Information Theory, and Entropy
On Error Preserving Encryption Algorithms for Wireless Video Transmission Ali Saman Tosun and Wu-Chi Feng The Ohio State University Department of Computer.
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
Noise, Information Theory, and Entropy
Lossy Compression Based on spatial redundancy Measure of spatial redundancy: 2D covariance Cov X (i,j)=  2 e -  (i*i+j*j) Vertical correlation   
Introduction to AEP In information theory, the asymptotic equipartition property (AEP) is the analog of the law of large numbers. This law states that.
Computer Vision – Compression(2) Hanyang University Jong-Il Park.
§4 Continuous source and Gaussian channel
Introduction Compression Performance Conclusions Large Camera Arrays Capture multi-viewpoint images of a scene/object. Potential applications abound: surveillance,
Prof. Amr Goneid Department of Computer Science & Engineering
Abhik Majumdar, Rohit Puri, Kannan Ramchandran, and Jim Chou /24 1 Distributed Video Coding and Its Application Presented by Lei Sun.
Distributed Source Coding
8. 1 MPEG MPEG is Moving Picture Experts Group On 1992 MPEG-1 was the standard, but was replaced only a year after by MPEG-2. Nowadays, MPEG-2 is gradually.
Digital Image Processing Image Compression
Chapter 17 Image Compression 17.1 Introduction Redundant and irrelevant information  “Your wife, Helen, will meet you at Logan Airport in Boston.
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 10 – Compression Basics and JPEG Compression (Part 4) Klara Nahrstedt Spring 2014.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 11 COMPRESSION.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 4 ECE-C490 Winter 2004 Image Processing Architecture Lecture 4, 1/20/2004 Principles.
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
Introduction to JPEG m Akram Ben Ahmed
Rate Distortion Theory. Introduction The description of an arbitrary real number requires an infinite number of bits, so a finite representation of a.
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
(B1) What are the advantages and disadvantages of digital TV systems? Hint: Consider factors on noise, data security, VOD etc. 1.
JPEG. Introduction JPEG (Joint Photographic Experts Group) Basic Concept Data compression is performed in the frequency domain. Low frequency components.
Entropy vs. Average Code-length Important application of Shannon’s entropy measure is in finding efficient (~ short average length) code words The measure.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 5 ECEC 453 Image Processing Architecture Lecture 5, 1/22/2004 Rate-Distortion Theory,
基於 (7,4) 漢明碼的隱寫技術 Chair Professor Chin-Chen Chang ( 張真誠 ) National Tsing Hua University National Chung Cheng University Feng Chia University
Student: Omar Jarushi Instructor: Dr. Asaf Cohen 1.
Basic Concepts of Information Theory Entropy for Two-dimensional Discrete Finite Probability Schemes. Conditional Entropy. Communication Network. Noise.
Chapter 8 Lossy Compression Algorithms
JPEG Compression What is JPEG? Motivation
The Johns Hopkins University
Data Compression.
Introduction to Information theory
Algorithms in the Real World
JPEG Image Coding Standard
BITS Pilani Pilani Campus EEE G612 Coding Theory and Practice SONU BALIYAN 2017H P.
Data Compression.
Data Compression CS 147 Minh Nguyen.
Context-based Data Compression
General Strong Polarization
2018/9/16 Distributed Source Coding Using Syndromes (DISCUS): Design and Construction S.Sandeep Pradhan, Kannan Ramchandran IEEE Transactions on Information.
Scalar Quantization – Mathematical Model
Objectives of Image Coding
Digital Multimedia Coding
Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.
COT 5611 Operating Systems Design Principles Spring 2014
CSE 589 Applied Algorithms Spring 1999
Wyner-Ziv Coding of Video - Towards Practical Distributed Coding -
Image Processing, Leture #16
Image Transforms for Robust Coding
Distributed Compression For Binary Symetric Channels
JPEG Still Image Data Compression Standard
Image Compression Purposes Requirements Types
Image Coding and Compression
A Data Hiding Scheme Based Upon Block Truncation Coding
Theory of Information Lecture 13
Watermarking with Side Information
Presentation transcript:

Distributed Compression For Still Images Kivanc Ozonat Distributed Compression For Still Images

Distributed Compression For Still Images 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 Images

Distributed Compression For Still Images 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 Encoder Decoder Y X Distributed Compression For Still Images

Information Theory Background Slepian-Wolf : Given the following scheme, (X,Y) (X,Y) R1 Encode X Encode Y R2 Distributed Compression For Still Images

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) R1 H(X|Y) H(X) Distributed Compression For Still Images

Information Theory Background Our problem is a special case of this: R2 H(Y) H(Y|X) H(Y|X) R1 H(X|Y) H(X) H(X) Distributed Compression For Still Images

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 Images

Distributed Compression For Still Images 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 Images

Distributed Compression For Still Images 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 Images

Distributed Compression For Still Images Underlying Approach Given i.i.d. X and i.i.d. Y, can form long sequences to get the typical X and typical Y sequences. Then, there are power (of 2) H(X,Y) jointly typical sequences. Typical Y Typical X Distributed Compression For Still Images

Distributed Compression For Still Images A Possible Scheme? Use bit-plane encoding (followed by gray coding) to divide the image at the encoder into bit-planes. Exploit the correlation between the adjacent pixels through the upper bit planes. The lower bit planes contain i.i.d. (or almost i.i.d) distribution of 0’s and 1’s. Distributed Compression For Still Images

Distributed Compression For Still Images A Possible Scheme? Example: A lower bit-plane, with i.i.d 0’s and 1’s: 0.7 0.3 0.3 1 1 0.7 Distributed Compression For Still Images

Distributed Compression For Still Images A Possible Scheme? Given X , the noisy version, the jointly typical set is (X,Y) such that X is as given, and Y is the set with a Hamming distance of (0.3)n from X. As n increases, Pr(X, Y=(X-0.3n)) will approach 1, with each (X,Y) pair having the same distribution. Hence, can perform an efficient coset construction Distributed Compression For Still Images

Distributed Compression For Still Images A Possible Scheme? Problems: The lower bit-planes, which are of interest, have error probabilities of close to 0.5, even with moderate noise variances. - Cannot compete with transform domain methods in terms of bit rates. Distributed Compression For Still Images

Distributed Compression For Still Images Proposed Solution Using transform coding is better because: - Energy compaction, resulting in lower bit rates for PSNR’s of around 38-40 dB. - The addition / averaging process involved in transform coding reduces the effect of noise through the central limit theorem. - The coded sequences of coefficients are de-correlated to a significant extent. Distributed Compression For Still Images

Distributed Compression For Still Images Proposed Solution Schematically, Modified Huffman Coder Y DCT Zonal Coder Quantizer Coset Constructer Bit-Plane Encoder Distributed Compression For Still Images

Distributed Compression For Still Images Proposed Solution The coefficients can be grouped in pairs with almost equal probabilities of occurrence. (because they are Laplacian) One member from each pair is selected and Huffman-coded. The other member of the pair is to have exactly the reverse (0’s and 1’s switched) code. The coded coefficients are placed in bit-planes. Distributed Compression For Still Images

Distributed Compression For Still Images Proposed Solution 1, 2, 3, 4, 5 01, 10, 11, 000, 111 (w.p. 0.125, 0.125, 0.10 , 0.075, 0.075) -1, -2, -3, -4, -5 10, 01, 00, 111, 000 (w.p. 0.125, 0.125, 0.10 , 0.075, 0.075) Assume: need to code 1,-4,-2, 2, -3,-1,5,2,3 100100111 010000100 010101111 111000101 Distributed Compression For Still Images

Distributed Compression For Still Images Proposed Solution Advantages: - Equal likelihood of 0’s and 1’s. This makes the use of the error coding simple. - Essentially Huffman coding. Not a significant increase, if the upper bit-planes are run-length coded. - Maximal distribution of cosets possible, due to the uniformity and equality of probabilities. Distributed Compression For Still Images

Distributed Compression For Still Images Conclusions Asymptotic Equipartition Property is essential in forming the typical sets. Having equal probabilities of occurrences make the error-coding simpler. Decorrelation is maintained through DCT. The Laplacian Distribution of the DCT coefficients is important in getting equally probable pairs. Distributed Compression For Still Images