The lectures are given in building 324, room H070, on Thursdays from 1 pm – 2.30 pm (approximately). The computer exercises take place immediately after the lectures in the same room; a teaching assistant will be present. The computer exercises are on the topic of the current week’s lecture. The exercises should be carried out in groups of 2-3.
Lecture notes and exercise texts and materials are available through CampusNet (one week in advance - as a rule).
For each subject considered in the course an exercise is carried out and an exercise report must be prepared and handed in. The course examination consists of an oral examination in the course topics based on the course theory and exercise reports. The oral examination will be held during the period 5-22 December 2016 (the exact date will be announced later).
This is a 5 ECTS point course corresponding to a work load of 8-10 hours work per week and most of this time is used to implement the image analysis models in the exercises. Some of the algorithms are complicated and the computations can be time-consuming. You can only understand these algorithms fully by implementing them, so that you can test the effect of varying data and parameters. Hence a successful completion of the course (and exam) requires that your implementation works and that you demonstrate a good understanding of the strengths and weaknesses of the models.
Introduction; Fitting of image functions (Course note pp. 1-14)
Linear basis function models;
maximum likelihood estimation and least squares;
regularization; image smoothing;
|I. MR bias field correction|
|2||8 Sep||kvle||Landmark based registration (Course note pp. 15-24)||II. Landmark-based registration|
Intensity based methods for registration (Course note pp. 25-32)
Sum-of-squared differences; correlation;
mutual information; principal axis transform
|III. Mutual information based registration|
|4||22 Sep||kvle||Non-linear deformations (Course note pp. 32-47)||IV. Non-linear intensity-based registration|
|5||29 Sep||kvle||Surface based registration (Course note pp. 53-57)||IV. Non-linear intensity-based registration (cont.)|
|6||6 Oct||Tim Dyrby||Guest lecture||V. Surface-based registration|
|7||13 Oct||Tron Darvann||EXCURSION: 3D laboratory. School of Dentistry||No exercise|
Surface-based segmentation (Course note pp. 57-57)
Active contour model; dynamic programming
|VI. Dynamic programming|
|9||3 Nov||Kristoffer Hougaard Madsen||EXCURSION: Danish Research Center for Magnetic Resonance (DRCMR)||No exercise|
Voxel-based segmentation I (Course note pp. 65-75)
Gaussian mixture model; Markov random field priors; mean-field approximation
|VII. Brain tumor segmentation|
Voxel-based segmentation II (Course note pp. 75-87)
Expectation-Maximization algorithm; MR bias field correction
|VIII. Expectation-Maximization algorithm|
Atlases (Course note pp. 95-104)
Reference templates; group-wise registration; probabilistic atlases; label propagation
|13||1 Dec||kvle||Course wrap-up||No exercise|