Welcome to the Homepage of the Lecture

Image Compression

Winter Term 2013 / 2014

Image Compression

Dr. Christian Schmaltz


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

Lectures: Monday 10-12 c.t., Building E1.7, Room 001
Tutorials: Thursday 16-18 c.t., Building E1.7, Room 001

First lecture: Monday, October 21, 2013.


You had to register for this course. The registration was open until Oct. 28, 2013. If you still want to participate, please contact me.
NOTE: 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.



AnnouncementsDescriptionEntrance requirementsExams Download



10/04/2014: The certificates are ready, and can be fetched at our secretary.
14/03/2014: The results of the second exam are now available.
10/02/2014: The results of the first exam are now available.
09/01/2014: The tutorial on 23.01.2014 will take place in room 029, building E1.5 (MPI for Software Systems).
15/11/2013: The lecture on 25.11.2013 will take place in seminar room 14, building E1.3.
21/10/2013: Registration is open.
13/08/2013: Website is online


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. After some theoretical background, we will introduce 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 lossless image compression algorithms based on predictions (PNG, JPEG-LS, JBIG), as well as lossy image compression algorithms based on transformations (JPEG, JPEG 2000). Furthermore, algorithms based on diffusion or fractals are introduced, before giving 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 specific topics, but not necessary.


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.
If you have qualified for the exam, you may participate in both exams. The better grade counts.

There will be written open-book exams. The dates of the exams have been discussed in the lecture. The following dates will be used (if rooms are available):
For the first written exam: Monday, February 3, 2014 at 10:00 am, Lecture Hall 003, Building E1.3.
For the second written exam: Thursday, March 6, 2014 at 2:00 pm, Lecture Hall 001, Building E1.3.


These are some of the rules during the exams:

  • For the exams, you can use the lecture slides, the example solutions, and hand-written notes, but neither books nor any other printed material (except for a dictionary).
  • Pocket calculators are not allowed.
  • Mobile phones, PDAs, laptops and other electronic devices have to be turned off and put away.
  • Please keep the student ID card ready for an attendance check during the exam.
  • Solutions that are written with pencil will not be graded.

It might be advisable to bring a ruler and a coloured pencil.

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

The following thresholds were applied for the second exam to determine the grades:

  • 1.0 : 61 - 50 points
  • 1.3 : 49 - 47
  • 1.7 : 46 - 44
  • 2.0 : 43 - 41
  • 2.3 : 40 - 38
  • 2.7 : 37 - 36
  • 3.0 : 35 - 34
  • 3.3 : 33 - 32
  • 3.7 : 31 - 30
  • 4.0 : 29 - 28
  • 5.0 : 27 - 0

You can inspect your exam sheets on Thursday, March 20, 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).

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

The following thresholds were applied for the first exam to determine the grades:

  • 1.0 : 61 - 51 points
  • 1.3 : 50 - 48
  • 1.7 : 47 - 45
  • 2.0 : 44 - 42
  • 2.3 : 41 - 39
  • 2.7 : 38 - 37
  • 3.0 : 36 - 35
  • 3.3 : 34 - 33
  • 3.7 : 32 - 31
  • 4.0 : 30 - 29
  • 5.0 : 28 - 0


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 will be 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 might change slightly.

No. Title Date
1 Introduction and Basic Concepts October 21   
2 Theoretical Background I October 28
3 Theoretical Background and Entropy Coders
(18.11: Updated slide 19 to clarify Tunstall code)
November 4
4 Entropy Coders II November 11
5 Arithmetic Coding I
(21.11: Replaced all x by y on slides 14 and 15 to prevent confusion with the operations used in the tables)
November 18
6 Arithmetic Coding II and Adaptive Entropy Coding
(29.11: Updated slide 18 to fix example)
November 25
7 Higher Order Coding, RLE, BWT, MTF, and Bzip2 December 2
8 Coding with Dictionaries December 9
9 PPM, PAQ, and Data Reduction in Lossy Image Compression
(13.01: Updated slide 11 to clarify PPMc algorithm)
December 16
10 Image Compression I: PNG, JPEG-LS, and JBIG January 6
12 Fractal Image Compression and Diffusion-based Inpainting January 9
11 Image Compression II: JPEG and JPEG 2000 January 13
13 Diffusion-based Image Compression January 20
14 Introduction to Video Compression January 27
-- Exam February 3



Participants of the course will be able to download example solutions here after the tutorial (access password-protected). As with the slides of the lecture, you should be aware that these slides are only provided to support the classroom teaching, not to replace it. Additional examples and explanations that may be helpful or necessary to understand the solutions or parts of the lecture (and thus relevant for the exam), will be provided in the tutorials. It is solely your responsibility - not ours - to make sure that you receive this infomation.

Furthermore, you should be aware that the example solutions provided here are not guaranteed to be error-free, and that there may be shorter, nicer, easier, or otherwise "better" solutions.

Date Assignment
31.10 1
07.11 2
14.11 3
21.11 4
28.11 5
5.12 6
19.12 7
19.12 8
16.01 9
16.01 10
23.01 11
30.01 12


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

Imprint - Data protection