Algorithms for Picture Analysis SS 2005 (2 SWS)

Lectures:
Wednesday, 4 - 6 p.m.
Friday, 11 - 12 a.m.

Exercises:
Friday, 12 - 1 p.m.

Programming Exercises:
Friday, 2 p.m - 4 p.m.

Geb. 101, SR 01-016 (wednesday)
Geb. 101, SR 01-018 (friday morning)
Geb. 052, Laborraum 02-003/005 (friday afternoon)

10 points total in the programming exercises;
you can achieve between 3-6 points in each exercise.

1. Pictures; Pixels and Voxels; Adjacency and Connectedness
2. History of Digital Picture Analysis
3. Component Labeling
4. Digitization of Curves; Bresenham Algorithm
5. Approximation of pi; Failure of “Staircase Counts”
6. Multigrid Convergence: Gauss Digitization and Area of a Planar Set
7. Metrics: Euclidean and Integer-Valued Metrics
8. Basic Distance Transforms; Distances between Sets
9. MAT and Euclidean Distance Transform
10. Borders and Border Tracing
11. Holes, Planarity, and Region Adjacency
12. Properties of 2D Regions; Frontier Grid
13. The 2D and 3D Cellular Grid; Grid Cell Topology
14. 2D Frontier Tracing and Euler Characteristic
15. DSSs: Definition and Characterization
16. DSS Approximation of Frontiers (K1990)
17. DSS Approximation of Borders (DR1995)
18. Relative Convex Hull; MLP Approximation of Borders
19. The Length of a Digital Curve; MLP
20. Experimental Evaluation of Length Estimators
21. Definition of Curvature for Planar Curves
22. Algorithms for Curvature Estimation
23. Algorithms for Corner Detection
24. Evaluation of Curvature/Corner Algorithms
25. 3D Components, Borders, and Frontiers
26. Artzy-Herman Algorithm for Frontier Tracing

Image Template
BMP Images : RGB , GRAY, Faces(A8) , ScaledImages(A9), ConvexRegions(A10)
Algoritms: FILL, K1990, DR1995, MLP