FORM-8

MIDDLE EAST TECHNICAL UNIVERSITY Graduate School of Natural and Applied Sciences Department of Computer Engineering NEW COURSE PROPOSAL
1. Course Code1 5710XXX 2. Course Title Shape Analysis 3. Course Category Undergraduate Seminar M.S. Thesis Summer Term Practice 4. Credit Credits2* ECTS Credits* Lecture Credits* Laboratory Credits* 5. Catalog Description Modeling boundaries and interiors of objects in 2 or 3 dimensions for computer processing. Discrete versus continuous input: Point clouds, indicator functions, surface meshes. Discrete versus continuous processing. Theoretical foundations: links to discrete mathematics concepts; complete lattices; Minkowski Algebra; Partial Differential Equations; Graph Laplacian. Explicit features; convexity, symmetry, parts, skeletons. Implicit coding of shape; continuous field models. Shape deformations. Shape averages. Shape spaces. Building shape priors for applications. Full and partial shape matching; structural and spectral signatures. Recent methods and applications. 6. Frequency Fall Semesters Spring Semesters 7. Can be given by: Sibel Tar Tolga Can Ouz Akyz 8. Background Requirements(s) Graduate standing Fall/Alternate Years Spring/Alternate Years Fall/Upon Request Spring/Upon Request
(3-0)3 8 3

Graduate Laboratory Ph.D. Thesis

Doctorate Term Project Thesis Studies

Choose a course code which does not appear on View Course Archieve 151. Give credit rating and distribution, credit rating should comply with one of the following : (3-0)3, (2-2)3, (1-4) 3, (0-6) 3, (1-0)1 * These areas must be filled.
2

9.

Complementing/Overlapping Courses Part of the fourth week on Minkowski Algebra overlaps with CENG 773 Computational Geometry. The content of the second week on explicit shape features, which is intended as a background material, may partly overlap with the contents of any vision/graphics related course. The main content, however, does not overlap with any course. Nevertheless, the new course, complements computer vision, graphics, vision, image processing, pattern recognition courses in a number of ways, including the following: 1. The representation schemes covered in this course can be utilized for building statistical shape priors that may guide processing of images. Thus, a student who has taken both this course and CENG566 may address shape based image segmentation. 2. A student who has taken both this course and CENG564 may combine the techniques in CENG564 with the similarity metrics and shape space construction ideas developed in this course to address 2D or 3D shape retrieval. 3. Eikonal PDE, which is examined thoroughly in this course, sheds light into the solution of Shape from Shading, a classic problem covered in CENG583.

10. Course in relation to the programs Despite growing importance of shape analysis in computer science and engineering, no shape analysis course is being offered at METU. Several other institutions, however, offer dedicated courses in shape analysis. Currently, at METU, the notions, representation schemes and processing algorithms related to shape are briefly covered in image processing, computer vision or graphics courses. The proposed course provides theoretically well-founded exposure to modeling boundaries and interiors of objects in 2 or 3 dimensions for computer processing, and intends to equip students with the necessary means for integrating shape concepts to image processing tasks such as filtering, registration and segmentation. Thus, the course primarily targets the students who are interested in geometric image processing, shape based object retrieval, shape based registration, or geometry processing side of computer graphics. The course can also be offered to students from other engineering disciplines, provided that they are fluent in data structures and algorithms. 11. Course Objectives At the end of the course, students are expected to acquire insight into computing an average of two or more shapes; building shape spaces and metrics; comparing two or more shapes; integrating shape influence into filtering, registration and segmentation of images. Along the way, starting from either of the point sets, surface meshes or continuous indicator functions, they will learn algorithms for partitioning shapes into constituent components; computing skeletons and distance transforms; performing basic Minkowski operations using both discrete algorithms and PDEs

12. Course Outline WEEKS SUBJECT Introduction DETAILS Course introduction. Syllabus. Foundations. Input shape in the form of point sets, surface meshes and indicator functions. Modeling boundary. Modelling interior. Explicit shape features Convexity, curvature, full and partial symmetries, medial axis transform, skeletons.

Deformations

Transformation groups. Finite dimensional groups. Diffeomorphisms.

Set theoretic formulations

Minkowski Algebra. Ordering. Rank filters. Connection to complete lattices.

PDE based formulations

PDEs for Minkowski sums. Eikonal PDE. Poisson PDE.

Screened

Implicit Representations

Continuous field models. Distance Transforms and variants.

Shape Spaces

Basic notions. Geometry of shape spaces. Metrics. Similarity.

Shape Space Statistics

Shape averages. Principal Component Analysis(PCA) on non-Euclidean spaces.

Generalized Shape Operators

Positive

definite

matrices

and

their

spectra.

Connections between Minkowski sums and PDEs.

10

Concepts from Discrete Topology

Persistence graphs. Randomized trees. Non-generic configurations. Association graphs; diffeomorphic matching;

11

Shape Matching

comparing distributions; metrics in the space of trees. Applications I Applications II Student presentations Computational symmetry. Shape from shading. Shape prior based segmentation of images.

12 13 14

13. Textbooks Lecture notes. 14. Reference Material 1) Innovations for Shape Analysis: Models and Algorithms. M. Breuss, A. Bruckstein and P. Maragos. Series for Mathematics and Visualization. Springer. 2012. 2) Numerical Geometry of Non-rigid Shapes. A. Bronstein, M. Bronstein and R. Kimmel. Monographs in Computer Science. Springer. 2009. 3) Shape: Talking about Seeing and Doing. G. Stiny. MIT Press. 2006. 15. Course Conduct Formal lectures, written and programming assignments, final project presentation. 16. Grading Written and programming assignments 40% Midterm Exam 30% Final Project Presentation 30% 17. Effective Date Spring 2013 18. Proposed by: Prof. Dr. Sibel Tar 19. Prerequisite Courses No formal prerequisites. However, students are expected to know fundamental data structures and design and analysis of algorithms. 20. Equivalent courses None Course accepted by Graduate Committee / Departmental Academic-Board in meeting held on../..../ Signature Head of Department