In recent years, graphs have emerged as a unified representation for image analysis and processing. Many powerful image processing methods have been formulated on pixel adjacency graphs, i.e., a graph whose vertex set is the set of image elements (pixels), and whose edge set is determined by an adjacency relation among the image elements. Due to its discrete nature and mathematical simplicity, this graph based image representation lends itself well to the development of efficient, and provably correct, methods for image processing. In this course, we will give an overview of recent developments in this field. Topics covered include graph-based methods for:
To sign up for the course, send an email to Filip Malmberg. The deadline for registration is June 30.
All lectures are given in room 2115, house 2, ITC, Polacksbacken. Directions to Polacksbacken can be found here.
To access the wireless network at Uppsala University, we recommend that you configure your computer to use eduroam. Ask your IT support for more information if needed. If you are not affiliated with a university, you may not be authorized to use eduroam. In this case, you will get a temporary user account on arrival.
The course will be free of charge for PhD students and advanced undergraduate students in image analysis and computer vision. For other participants the fee is 3000 SEK. All participants must be members of SSBA. Lunches and a social dinner are included in addition to the course itself. Travel and accomodation are not covered.
PhD students who complete the course recieve 3 hp. The examiner is Filip Malmberg.
The course will start Tuesday August 18 with lunch, and end on Thursday August 20 at 15:00. We walk together from Centre for Image Analysis to the lunch restaurant 12:00 on August 18. The detailed schedule below is preliminary and subject to change.
|Tuesday August 18|
|13:15-15:00||Course introduction, Basic graph theory. (Notes.)|
|15:00-17:00||Introduction to combinatorial optimization, and applications in image processing. (Notes.)|
|17:00-||Social activities. To join, send an email to Damian Matuszewski (damian.matuszewski (at) it.uu.se)|
|Wednesday August 19|
|9:15-12:00||Optimal trees and forests. (Notes.)|
|13:15-15:00||Maximal flows and minimal cuts (Notes1, Notes2)|
|15:15-17:00||Computer exercises. (Instructions,Source code, Linux/Mac build instructions..)|
|19:00-||Dinner at Biztron|
|Thursday August 20|
|9:15-12:00||Random walks and anisotropic interpolation on graphs. (Notes.)|
|13:15-14:00||A unifying framework for energy minimization on graphs. (Notes.). Course wrap up.|
Examples of hotels in Uppsala. Please contact the hotels directly for current room rates.