FI:PA170 Digital Geometry - Course Information

PA170 Digital Geometry

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

doc. RNDr. Pavel Matula, Ph.D. (lecturer)

Guaranteed by

prof. Ing. Jiří Sochor, CSc.
Department of Visual Computing – Faculty of Informatics
Contact Person: doc. RNDr. Pavel Matula, Ph.D.

Timetable

Fri 12:00–13:50 B411, Fri 14:00–14:50 B411

Prerequisites

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 / plans the course is directly associated with

• Applied Informatics (programme FI, N-AP)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics (programme FI, N-AP)
• Information Systems (programme FI, N-IN)
• Informatics (programme FI, N-IN)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Systems (programme FI, N-IN)
• Embedded Systems (eng.) (programme FI, N-IN)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
• Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
• Image Processing (programme FI, N-AP)

Course objectives

The course brings the basic overview of digital geometry. We will discuss problems that arise from object digitalization and their representation by the set of points on a grid (e.g, digital image). Especially, we will define the basic terms (adjacency, connectedness, boundary, etc.) and show how to measure geometric as well as topologic properties of digital sets (distance, length, volume, etc.).

Syllabus

• Digital image, pixel, voxel, image resolution
• Types of grids, grid point and grid cell models, adjacency vs. incidence, switch adjacency
• Connectedness and components, component labeling
• Digitalization
• Measurement in digital images: metrics, integer-valued metrics, regular metric, approximation to Euclidean metric, chamfer distance
• Distance transform
• Distance measurement between sets
• Digital sets: digital line, digital circle, etc.
• Estimation and computation of geometric and topological properties of digital sets: volume, surface, area, perimeter, length, curvature, Euler characteristic, etc.
• Boundary and border and their computation

Literature

• KLETTE, Reinhard and Azriel ROSENFELD. Digital geometry: geometric methods for digital picture analysis. Amsterdam: Elsevier, 2004, 656 pp. info

Assessment methods

optional homework, written test and then oral exam

Language of instruction

Czech

Further Comments

Study Materials
The course is taught annually.

• Enrolment Statistics (Autumn 2008, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2008/PA170