News

Tutorial Update

Written on 15.04.25 by Pascal Peter

  1. The tutorials have now been assigned, you can check which slot you received on your personal status page. There, you can also create teams for submission.
     
  2. Rule change: If you cannot participate in the tutorials, you may also submit solutions to the class room assignments instead to receive… Read more
  1. The tutorials have now been assigned, you can check which slot you received on your personal status page. There, you can also create teams for submission.
     
  2. Rule change: If you cannot participate in the tutorials, you may also submit solutions to the class room assignments instead to receive the 12 participation points. This is intended as a compromise solution and tutorial participation is still encouraged. Submitted classroom submissions will not be graded and no feedback will be given. You receive the full 12 points if your submission documents a reasonable attempt at solving the assignments. Include them in the zip archive for the corresponding homework submission.
     
  3. Small rule change: Groups of 4 are now also accepted. However, this is the absolute limit, groups of >5 are not allowed, also not on request.
     
  4. If you have participated in the group roulette, you should have received a mail by now. Please reply to this mail until tomorrow, 16.12., 16:00 if you consent to your CMS mail address to being forwarded to your group members. Please also inform me if you have received a roulette assignment, but dropped the course or joined a group outside of the roulette.

 

Video Mirror on CMS

Written on 08.04.25 by Pascal Peter

Since some students reported troubles with video access on Teams, I am uploading the videos in zip archives to CMS as well (material category 06 at the bottom). In particular, this means that you can attend the whole course without using Teams at all. I still recommend to join the lecture Team for… Read more

Since some students reported troubles with video access on Teams, I am uploading the videos in zip archives to CMS as well (material category 06 at the bottom). In particular, this means that you can attend the whole course without using Teams at all. I still recommend to join the lecture Team for additional discussion opportunities.

Waiting List

Written on 08.04.25 by Pascal Peter

Unfortunately, the registration situation has not improved since yesterday. If you still want to register, please send me a mail or Teams message until  Monday 14.04. to join the waiting list. (You can click my name below the course title for contact info.)

Course Registration and Teams Access

Written on 07.04.25 by Pascal Peter

Currently, there is a large demand for course registration and temporarily the course migh run full. Due to our limited tutorial resources, I cannot open up arbitrary many slots. If you have already registered and decide that you won't take the course, please either change your personal status to "No,… Read more

Currently, there is a large demand for course registration and temporarily the course migh run full. Due to our limited tutorial resources, I cannot open up arbitrary many slots. If you have already registered and decide that you won't take the course, please either change your personal status to "No, I am  not going to take the exams/participate in the tutorials." if you want to keep access to the lecture materials or deregister from the course. This will help opening up additional slots for your fellow students. If you could not register yet, please check back regularly if new slots have opened up. If this situation persists for a longer period of time, I might consider other options like a waiting list.

Regarding access to Teams and the video materials, please follow this guide after you have registered for the course in the CMS.
 

Image Compression


Registration is closed and the waiting list has been resolved. No further registrations will be accepted.


Description

Motivation: High resolution image data is becoming increasingly popular in research and commercial applications (e.g. entertainment, medical imaging). In addition, there is also a high demand for content distribution via the internet. Due to the resulting increase in storage and bandwith requirements, image compression is a highly relevant and very active area of research.

Teaching Goals: 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 understand the theoretical foundations of image compression and be familiar with a wide range of classical and contemporary compression methods.

Contents: The lecture spans the whole evolution of image compression from the dawn of information theory to recent machine-learning approaches. It is seperated into two parts:

The first half of the lecture deals with lossless image compression. We discuss the information theoretic background of so-called entropy coders (e.g. Huffman-coding, arithmetic coding, ...), talk about dictionary methods (e.g. LZW), and cover state-of-the-art approaches like PPM and PAQ. These tools are not limited to compressing image data, but also form core parts of general data compression software such as BZIP2. Knowledge about entropy coding and prediction is key for understanding the classic and contemporary lossless codecs like PNG, gif or JBIG.

The second part of the lecture is dedicated to lossy image compression techniques. We deal with classic transformation based compression (JPEG, JPEG2000), but also with emerging approaches like inpainting-based, fractal, or neural network compression. Furthermore, we consider related topics like human perception, and error measures.

 

Entrance Requirements

Basic mathematics courses (such as Mathematik für Informatiker I-III) 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. For the programming assignments, some elementary programming skills are required.

 

Assessments / Exams

There will be two written exams with a limited open book format.

21. July 14-17, E1.3, HS002
30. September 14-17, E1.3, HS002

Detailed rules for our exams are published in the self test assignment which also provides an impression of the structure and assignment types to be expected from the real exams.

You can participate in both exams, and the better grades counts. Please remember that you have to register online for the exam in the LSF system of Saarland University.

If you cannot attend the exam, contact Pascal Peter as early as possible. In case you have proof that you cannot take part for medical reasons or you have another exam on the same day, we can offer you an oral exam as a replacement. Note that we need written proof (e.g. a certificate from a physician/Krankenschein) for the exact date of the exam.


Lecture Format

The lecture takes place in an inverted class room format. Each weak, you have a self-study session where you watch lecture videos or read the materials. This prepares the active components of the lecture. In a weekly meeting we discuss the lecture contents in a Q&A format and you can participate in an anonymous weekly quiz. Additionally, the weekly tutorials provide class room assignments in addition to discussions of the homework.

Weekly meetings:
Monday 12:15-14:00, E1.3, HS001
First lecture: 07.04.2024

There is no meeting on Wednesdays, the LSF time slot is only a recommendation for the self-study slot. You can choose any slot you want for the preparation of the Monday meetings.

Find more information on joining the lectures here.

 

Lecture Materials / Assignments

All slides, videos, assignments, example solutions, and an exam formulary are offered for download in the CMS.

 

References

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

Further references will be given during the lecture.

Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators.