Efficient optimization algorithms for problems from biological image analysis
- Date
- Jun 7, 2017
- Time
- 11:00 AM - 12:00 PM
- Speaker
- Paul Swoboda, Ph.D
- Affiliation
- IST Vienna, Austria
- Language
- en
- Main Topic
- Biologie
- Other Topics
- Biologie
- Host
- Florian Jug
- Description
- In recent years, large scale combinatorial optimization problems with millions of variables and possibly more arising from biological image analysis have been increasingly studied. Examples are (i) the multicut problem for neurite reconstruction, (ii) graph matching for C. elegans annotation and (iii) cell tracking for cell lineage tree reconstruction. I will describe the optimization problem formulations for all three problems and present new efficient algorithms for these. The algorithms are all developed as part of the recently published framework "A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems", (CVPR 2017) and are freely available.
Last modified: Jun 8, 2017, 10:01:55 AM
Location
Max Planck Institute of Molecular Cell Biology and Genetics (CSBD Seminar Room 2)Pfotenhauerstraße10801307Dresden
- Phone
- +49 351 210-0
- Fax
- +49 351 210-2000
- MPI-CBG
- Homepage
- http://www.mpi-cbg.de
Organizer
Max Planck Institute of Molecular Cell Biology and GeneticsPfotenhauerstraße10801307Dresden
- Phone
- +49 351 210-0
- Fax
- +49 351 210-2000
- MPI-CBG
- Homepage
- http://www.mpi-cbg.de
Scan this code with your smartphone and get directly this event in your calendar. Increase the image size by clicking on the QR-Code if you have problems to scan it.
Legend
- Biology
- Chemistry
- Civil Eng., Architecture
- Computer Science
- Economics
- Electrical and Computer Eng.
- Environmental Sciences
- for Pupils
- Law
- Linguistics, Literature and Culture
- Materials
- Mathematics
- Mechanical Engineering
- Medicine
- Physics
- Psychology
- Society, Philosophy, Education
- Spin-off/Transfer
- Traffic
- Training
- Welcome