DIGITIZATION; MEASURING PROPERTIES
METRICS; DISTANCE TRANSFORMS
BORDERS; REGION ADJACENCY GRAPHS
GRID CELL TOPOLOGY; FRONTIERS
DSSs and MLPs; LENGTH OF A DIGITAL CURVE
STEPS INTO 3D PICTURE ANALYSIS
A solution should be submitted via email to the tutor, or to the e-dropbox, containing source code for testing, and explaining text in pdf format, all zipped into one file named by ID number and number of assignment (for example 1234567_4.zip, if for assignment A.4)
(A) Each student has to submit her/his solution to 4 of the assignments (e.g., A.1, A.2, and so forth). Deadline is 3 weeks after the lecture presenting the exercise (limited by the general deadline of one week after the end of the lectures).
(B) Each student has to obtain 10 marks or more for passing the coursework part. Assignments (e.g., A.1, A.2, and so forth) are labeled by marks, ranging between 3 and 7. Deadline is 1 week after the lecture presenting the exercise (limited by the general deadline of the end of the lectures).
(C) Each student has to solve two assignments (e.g., A.1, A.2, and so forth) for passing the coursework part, where "solve" means that at least 50 percent of the submission is correct. Deadline is 2 weeks after the lecture presenting the exercise (limited by the general deadline of the end of the lectures).
The questions in the exam will be (minor) modifications
of some of the exercises provided in the three exercise files above.
Calculators, computers, or any
hardcopies are not allowed for the exam.
(A) Written exam: two hours.
(B) Oral exam: 20 minutes.
CINVESTAV (Departmento de Control Automatico), Mexico-City, Mexico
in February 2005 (without assignments or exam),
The University of Auckland (Tamaki campus,
COMPSCI 375 FS 2005), Auckland, New Zealand,
in March - May 2005,
using option (A) for coursework and a written exam,
the University of Freiburg (Institut fuer Informatik,
Algorithms for Picture Analysis SS 2005),
in June - July 2005,
using option (B) for coursework and having an oral exam,
NTNU (Graduate Institute of Computer Science and Information Engineering,
Algorithms for Picture Analysis), Taipei, Taiwan,
in November - December 2005,
using option (C) for coursework and having a written exam, and
ISS (International School of Software,
Multimedia Imaging), Wuhan, China,
in September 2006.
[R. Klette and A. Rosenfeld: Digital Geometry - Geometric Methods for Picture Analysis.
Morgan Kaufmann, San Francisco, 2004].
If cited at all, then it should be cited with respect to this source. However,
some material in
these lecture notes is not contained in the book, and it could be cited as
[R. Klette: Algorithms for Picture Analysis. Lecture XX,
(date as at the bottom of pages of Lecture XX)].