The course syllabus contains changes
See changesCourse syllabus adopted 2023-01-31 by Head of Programme (or corresponding).
Overview
- Swedish nameBildbehandling
- CodeRRY025
- Credits7.5 Credits
- OwnerMPWPS
- Education cycleSecond-cycle
- Main field of studyElectrical Engineering, Engineering Physics
- DepartmentSPACE, EARTH AND ENVIRONMENT
- GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail
Course round 1
- Teaching language English
- Application code 29130
- Maximum participants65 (at least 10% of the seats are reserved for exchange students)
- Block schedule
- Open for exchange studentsYes
Credit distribution
Module | Sp1 | Sp2 | Sp3 | Sp4 | Summer | Not Sp | Examination dates |
|---|---|---|---|---|---|---|---|
| 0107 Examination 7.5 c Grading: TH | 7.5 c |
|
In programmes
- MPCAS - COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 1 (compulsory elective)
- MPCAS - COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 2 (elective)
- MPDSC - DATA SCIENCE AND AI, MSC PROGR, Year 1 (compulsory elective)
- MPDSC - DATA SCIENCE AND AI, MSC PROGR, Year 2 (elective)
- MPHPC - HIGH-PERFORMANCE COMPUTER SYSTEMS, MSC PROGR, Year 2 (elective)
- MPICT - INFORMATION AND COMMUNICATION TECHNOLOGY, MSC PROGR, Year 1 (compulsory elective)
- MPICT - INFORMATION AND COMMUNICATION TECHNOLOGY, MSC PROGR, Year 2 (elective)
- MPMED - BIOMEDICAL ENGINEERING, MSC PROGR, Year 2 (elective)
- MPWPS - WIRELESS, PHOTONICS AND SPACE ENGINEERING, MSC PROGR, Year 2 (elective)
Examiner
Jouni Kainulainen- Associate Professor, Astronomy and Plasma Physics, Space, Earth and Environment
Eligibility
General entry requirements for Master's level (second cycle)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Specific entry requirements
English 6 (or by other approved means with the equivalent proficiency level)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Course specific prerequisites
Mathematical analysis in several variables and statistics, and experience with Matlab.
Aim
The aim of this course is for students to become familiar with a wide variety of techniques in modern Image Processing. These techniques can be used to subjectively improve image quality for the end-user (image enhancement), remove known image distortions (image restoration) and to reduce image data sizes for storage or transmission (image compression). These techniques are valuable in a range of applications and careers including, but not limited to, medical imaging, astronomy, remote sensing, automation etc. Stress is placed on deep understanding of the principles underlying the techniques rather than memory learning of algorithms.Learning outcomes (after completion of the course the student should be able to)
- Visualise via means of mental images the process of forming 1D and 2D Fourier transforms and also the convolution process. Describe the similarities and differences between the continuous and discrete Fourier transforms and their inter-relationship.
- Select and apply appropriate image enhancement methods for different applications. Discriminate between cases where automated image enhancement methods produce appropriate results and where they do not.
- Understand the differences between averaging and median filtering for reducing image noise.
- Demonstrate understanding of image smoothing and sharpening in both the image and Fourier domains. Select between optimum methods of edge detection in different applications.
- Describe common distorted images as convolutions of the true image with point spread functions (PSF). Describe and decide under which conditions different image restoration algorithms can be used and describe the strengths and weakness of these algorithms.
- Describe the Cosine transform and its relationship to the Fourier transform.
- Demonstrate a basic understanding of wavelets and know how to use them to compress and denoise data.
- Explain the difference between lossy and lossless compression methods and explain the concept of data redundancy as the source of compression. Describe the subcomponents of general compressor/decompressor algorithms. Calculate theoretical limits to lossless compression using the Shannon noiseless coding theorem and implement Huffman coding.
- Describe a variety of different mapping functions that can be used to obtain compression and decide when different methods are appropriate. Show via examples why Digital Pulse Code Modulation (DPCM) works and is stable in the face of quantisation errors.
- Describe the main components of the JPEG standard.
- Write computer code in MATLAB to implement selected image processing algorithms.
Content
Introduction. Image Enhancement: transform functions, and histogram, equalisation; image smoothing and sharpening; edge detection and noise reduction; Fourier domain methods. Continuous and Discrete 2D Fourier Transforms. Wavelets and Wavelet Applications. Image Compression: general compressor/decompressor, coding theorem, Huffman coding and multi-pixel coding; run length coding, predictive coding and digital pulse code modulation; cosine transform, block coding, zonal mask and threshold mask; JPEG. Image Restoration: linear space-invariant distortions, point spread function, inverse and pseudoinverse filters; Wiener filter; image reconstruction from projections.Organisation
Lectures, lab exercises, problem classes and project.Literature
'Digital Image Processing' 4th edition (2018) by Gonzalez and Woods.Examination including compulsory elements
Project and written exam.The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.
The course syllabus contains changes
- Changes to course rounds:
- 2024-10-01: Block Block changed from C+ to C by Calle Ekdahl schema
[Course round 1]
- 2024-10-01: Block Block changed from C+ to C by Calle Ekdahl schema