Image Transforms: Robust Communication with Lossless and Lossy Compression, Slides of Electrical Engineering

The fundamentals of communication systems, focusing on source and channel coding for image transmission. Topics include shannon's communication theory, source coding goals and stages, transformations, quantization, and entropy coding. Lossless and lossy compression methods are discussed, such as run-length encoding, huffman coding, arithmetic coding, and lempel-zip coding. The document also covers fourier analysis, fourier transforms, and wavelet transforms for image coding.

Typology: Slides

2012/2013

Uploaded on 03/23/2013

dhrupad
dhrupad 🇮🇳

4.4

(17)

213 documents

1 / 29

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Image Transforms for Robust
Coding
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d

Partial preview of the text

Download Image Transforms: Robust Communication with Lossless and Lossy Compression and more Slides Electrical Engineering in PDF only on Docsity!

Image Transforms for Robust

Coding

Introduction

• “The fundamental problem of communication is that

of reproducing at one point either exactly or

approximately a message selected at another point.”

(Claude Shannon, 1948)

• What information should be transmitted?

• How should it be transmitted?

Source Coding

• Goals

– Reduction of redundancy

– Removal of irrelevancy (irreversible)

• Stages

– Transformation

– Quantization (lossy)

– Entropy coding

Image samples

Transform

coefficients

Symbol stream

Bit stream

Lossless and Lossy

• Lossless (2:1 to 8:1)

– Limited by the entropy of the message (Claude E.

Shannon)

• Lossy (100:1)

Entropy is a measure of information content:

the more probable the message, the lower its

information content, the lower its entropy

Transformations for Image Coding

• Block transforms (blocks in the spatial domain)

– Fixed size

– Quadtrees

• Sub-band decompositions (blocks in the frequency

domain)

– Uniform

– Logarithm

• Pyramids

• Wavelet

• Wavelet packets

Quantization

Two-bit resolution Three-bit resolution

Four-level digital

representation

Eight-level digital

representation

Can be used to exploit features of the human visual system

Entropy Coding

• Methods based on repeated characters: run-length encoding

– The repeated character is replaced by the number of occurrences and by the

character itself

• e.g. AAAABBBCCCCC (12 symbols) is coded as 4A3B5C (6 symbols) [2:1]

• Methods based on probability of occurrence: Huffman coding,

arithmetic coding

– Symbols that occur more often are assigned shorter codes

• e.g. natural languages: ‘a’, ‘is’, ‘the’ (shorter words) are those with higher

probability

• Dictionary-based methods: Lempel-Zip coding

– Words and phrases within a text stream are likely to be repeated

• e.g. acronyms: The Lempel-Zip encoding methods (LZ) are string-matching

techniques. LZ were invented in 1977 and 1978

Fourier Analysis

Fourier Transform

Short-time Fourier Analysis

Wavelet Transform Bases

Time vs. Frequency

Wavelet Transform

2-D Wavelet Transform