Research Seminar Combinatorial Image Analysis
Contents
This seminar is about combinatorial optimization problems with applications in the field of image analysis. This includes graph decomposition problems for image segmentation and multiple object tracking, assignment problems for object matching, and unconstrained multi-linear optimization problems for inference in discrete graphical models. For analyzing and solving these problems, the seminar covers techniques from the areas of combinatorial optimization, computational complexity and algorithm engineering.
Organization
- Creditability: CMS-SEM, INF-AQUA, INF-PM-FOR
- Registration: The seminar is aimed primarily at doctoral students and is open to all qualified students. Students interested in taking this seminar are expected to send a topic proposal to mlcv@tu-dresden.de prior to the kickoff meeting and present their proposal during the kickoff meeting. Inspiration for topics can be found e.g. here.
- Kickoff meeting: APB-2026, Tuesday, April 4th, 9:20-10:50
- Meetings: APB-2026, Tuesdays, 9:20-10:50
- Schedule:
Date Talk 2023-04-04 Kickoff 2023-04-11 (no seminar) 2023-04-18 (free slot) 2023-04-25 (no seminar) 2023-05-02 Multicuts of planar graphs 2023-05-09 On the min-max correlation clustering problem 2023-05-16 The linear word ordering problem 2023-05-23 Bird song classification 2023-05-30 A multicut game 2023-06-06 (no seminar) 2023-06-13 Graph neural networks and min cost multicuts 2023-06-20 On cut inequalities 2023-06-27 Efficient algorithms for some multicut problems 2023-07-04 A polyhedral algorithm for cubic clique partitioning 2023-07-11 Classification of organoid images
