Welcome to the Homepage of the Lecture

Image Compression

Winter Term 2012 / 2013

Image Compression

Dr. Christian Schmaltz


Winter Term 2012 / 2013
Lecture week (2h) with exercises (2h)

Lectures: Friday 10-12 c.t., Building E1.3, Lecture Hall 001
Tutorials: Thursday 16-18 c.t.

First lecture: Friday, October 19, 2012.

You had to register for this course. The registration was open until Oct. 26, 2012, 5 pm. Additionally, you have to register in HISPOS! You may not participate in the exams without an registration in HISPOS, unless you have discussed this with me.

Announcements – Description – Entrance requirements – Exams – Download

The results of the second exam are now available.

The results of the first exam are now available.

The date of the exams is now fixed, see below.

There is no tutorial on Thursday, November 1, as this is a public holiday.

The course is designed as a supplement for image processing lectures, to be attended before, after or parallel to them.

After the lecture, participants should be able to understand the concepts used in different compression algorithms. We start with general-purpose entropy coding algorithms such as Huffman-coding or arithmetic coding, discuss adaptive and higher-order entropy coding algorithms, and talk about dictionary methods such as the method by Lempel, Ziv, and Welch (LZW).

Afterwards, we discuss image compression algorithms based on transformations (JPEG, JPEG 2000), as well as diffusion-based image compression algorithms before we give a glimpse on how video compression works.

Basic mathematics courses are recommended. Understanding English is necessary. Image processing lectures such as "Image Processing and Computer Vision" are helpful for some topics, but not necessary.

As there will also be programming assignments, a basic knowledge of C is recommended. Since working in groups of up to 2 people is allowed, and since it is possible to quality for the exam without programming, it is possible to participate without any programming knowledge. No programming will be necessary in the exams.

The homework assignments are intended to be solved at home and have to be submitted in the lecture break, or earlier. In order to qualify for the exam you must obtain 50% of the possible points on average.

Working in groups of up to 2 people is permitted, but both persons must be able to explain the solutions handed in. Example solutions will be available some time after the tutorial here.

The first written exam will take place on Friday, February 8, 2013 from 10:00 to 12:00 am in building E1.3, lecture hall 1.
The second written exam will take place on Monday, February 25, 2013 from 2:00 to 4:00 pm in building E1.3, lecture hall 2.

The results of the second written exam can be found here, and the corresponding distribution of points and grades here.

The results of the first written exam can be found here, and the corresponding distribution of points and grades here.

For both exams, the following thresholds were applied to determine the grades:

• 1.0 : 61 - 49 points
• 1.3 : 48 - 46
• 1.7 : 45 - 43
• 2.0 : 42 - 40
• 2.3 : 39 - 38
• 2.7 : 37 - 36
• 3.0 : 35 - 34
• 3.3 : 33 - 32
• 3.7 : 31 - 30
• 4.0 : 29 - 29
• 5.0 : 28 - 0

You can inspect your exam sheets on Friday, March 1, 14:00-16:00, building E1.7, room 4.07 (4rd floor). If you are unable at that time, you can inspect your exam later. Just contact me to make an appointment, (or come and hope that I have time).

There is no specific book that covers the complete content of this class. However, each of the following books covers several of the topics discussed in the lecture:

• T. Strutz: Bilddatenkompression. Vieweg+Teubner (in German)
• D. Hankerson, G. A. Harris, and P. D. Johnson, Jr.: Introduction to Information Theory and Data Compression. Chapman & Hall/CRC
• K. Sayood: Introduction to Data Compression. Morgan Kaufmann

These books are available in the "Semesterapparat" in the library, see here.
Further references will be given during the lecture.

Participants of the course can download the lecture materials here after the lecture (access is password-protected). However, be aware that these slides are only provided to support the classroom teaching, not to replace it. Additional organisational information, such as examples and explanations that may be helpful or necessary to understand the content of the course (and thus relevant for the exam), will be provided in the lectures. It is solely your responsibility - not ours - to make sure that you receive this infomation. The topics given here are preliminary and will probably change slightly.

No.	Title	Date
1	Introduction and Basic Concepts	October 19
2	Theoretical Background I	October 26
3	Theoretical Background and Entropy Coders	November 2
4	Entropy Coders II	November 9
5	Arithmetic Coding I	November 16
6	Arithmetic Coding II and Adaptive Entropy Coding	November 23
7	Higher Order Coding, RLE, BWT, MTF, and Bzip2	November 30
8	Coding with Dictionaries	December 7
9	PPM, PAQ, and Data Reduction in Lossy Image Compression (20.12: Updated slide 11 to clarify PPMc algorithm) (07.02: Updated slide 11 to further clarify PPMc algorithm)	December 14
10	Image Compression I: PNG, JPEG-LS, and JBIG	December 21
11	Image Compression II: JPEG and JPEG 2000 (07.02: Corrected number of bits on slide 24)	January 11
12	Fractal Image Compression and Diffusion-based Inpainting	January 18
13	Diffusion-based Image Compression	January 25
14	Video Compression	February 1
	Exam	February 8

Here, you can find the sources for the programming assignments

Due date	Assignment
09.11	shannon.c
30.11	arithmetic_decoding.c

MIA Group
©2001-2020
The author is not
responsible for
the content of
external pages.

Imprint - Data protection