Welcome to the homepage of the lecture Numerical Algorithms for Visual Computing I Summer Term 2010 |
||||||

Home |
Lectures (3h) with exercises (1h), summer term 2010, 6 credits
This is a course in numerical methods useful in the field of visual computing. Covered are interpolation, approximation, splines, least-squares-computation, the fast Fourier transform (FFT) and other issues. Entrance requirements – Contents – Assessments / Exams – References
Undergraduate knowledge of mathematics. For computer science students,
this requirement is met by having completed the
The course is concerned with numerical methods useful for image analysis (image processing, computer vision, pattern recognition) and synthesis (computer graphics, scientific visualisation, geometric modelling). Topics include: - interpolation (splines)
- approximation (least squares, total least squares, pseudoinverse)
- Fast Fourier transform
There will be two written exams. The first will be close to
the end of the semester. The second one will be in the lecturing-free period.
It is required for qualifying for the written exams to have 50% of the available points from the exercises. I would like to encourage you to do these in teams of up to three students. Very likely, I will offer the opportunity to do a small project around the middle of the semester to gain extra points.
Details on this will be given in the script. This will be made available via this webpage.
Participants of the course can download the assignment sheets here:
The example solutions are based on the TeX-files of Tanja Dorst, Verena Marold and Michael Stoll. Many thanks to them for providing the files! |
|||||

MIA Group |