The basic knowledge of mathematics and graph theory is recommended.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
Fields of study the course is directly associated with
there are 23 fields of study the course is directly associated with, display
At the end of the course students should be able to:
understand and explain basic problems that arise after object digitization and object representation using a grid of points (e.g., in the form of a digital image); measure geometric and topological properties of digital objects (e.g., length, area, perimeter, volume, Euler characteristic, and the number of holes); compare digital metrics; efficiently implement the key algorithms of digital geometry (e.g., region labeling, border tracing, and distance map computation); identify the fundamentals of the discussed methods.
Basic terms of digital geometry
Component labeling algrotithms
Measurements in digital spaces
Distance maps and their computation
Border tracing algorithms
Topological properties of digital spaces
Digital geometric figure recognition (line, arc, plane)
Estimation and computation of geometric and topological properties of digital sets (volume, surface, length, curvature, etc.)
Digital convex hull
Thinning and skeletons
KLETTE, Reinhard and Azriel ROSENFELD. Digital geometry: geometric methods for digital picture analysis. Amsterdam: Elsevier, 2004. 656 pp. info
Lectures followed by class exercises where we will solve practical problems by taking the advantage of lecture findings. Homework.
Written test, oral exam. Obligatory attandance at exercises. Homework score.