|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
Show all the abstracts
Thursday 11:00:00 Timetabling in education and sport Room 126 - Chair: G. Vanden Berghe
Thursday 11:00:00 Transportation management Room 130 - Chair: F. Semet
Thursday 11:00:00 Networks Room 138 - Chair: B. Fortz
Thursday 11:00:00 Nonconvex optimization 1 Room 035 - Chair: F. Bach
Thursday 14:00:00 Constraint programming models 1 Room 126 - Chair: Y. Deville
Thursday 14:00:00 Vehicle routing Room 130 - Chair: S. Limbourg
Thursday 14:00:00 Combinatorial optimization and IP applications Room 138 - Chair: Q. Louveaux
Thursday 14:00:00 Nonconvex Optimization 2 Room 035 - Chair: R. Sepulchre
- Discriminative Clustering for Image Co-segmentation
Francis Bach (INRIA - Ecole Normale Superieure) Abstract: Purely bottom-up, unsupervised segmentation of a single image into two segments remains a challenging task for computer vision. The co-segmentation problem is the process of jointly segmenting several images with similar foreground objects but different backgrounds. In this work, we combine existing tools from bottom-up image segmentation such as normalized cuts, with kernel methods commonly used in object recognition.
These two sets of techniques are used within a discriminative clustering framework: we aim to assign foreground/background labels jointly to all images, so that a supervised classifier trained with these labels leads to maximal separation of the two classes.
In practice, we obtain a combinatorial problem which is relaxed to a continuous convex optimization problem, that can be solved efficiently for up to dozens of images (using appropriate manifold optimization techniques). We show that our framework works well on images with very similar foreground objects, which are usually considered in the literature, as well as on more challenging problems with objects with higher intra-class variations.
- Fast Oriented Bounding Box Computation Using Particle Swarm Optimization
Pierre Borckmans (UCL (INMA)) Co-authors: Pierre-Antoine Absil
- The time-optimal helicopter trajectory is a circle segment
Natalya Usotskaya (Maastricht University) Co-authors: A.Berger, A.Grigoriev
- BFO: a simple "brute-force" optimizer
Philippe Toint (Fac. Universitaires Notre-Dame de la Paix)
Thursday 16:10:00 Constraint programming models 2 Room 126 - Chair: P. Schaus
Thursday 16:10:00 Performance modeling Room 130 - Chair: G. Janssens
Thursday 16:10:00 Scheduling Room 138 - Chair: K. Sorensen
Thursday 16:10:00 Planning under uncertainty Room 035 - Chair: R. Leus
Friday 09:00:00 Metaheuristics Room 126 - Chair: J. Teghem
Friday 09:25:00 Production and distribution (9:25) Room 130 - Chair: Y. Arda
Friday 09:00:00 Multiple criteria Room 138 - Chair: R. Bisdorff
Friday 09:25:00 Stochastic models (9:25) Room 035 - Chair: L. Esch
Friday 11:00:00 Constraint programming and Supply Chain Management Room 126 - Chair: Y. Deville
Friday 11:00:00 OR in health management Room 130 - Chair: P. De Causmaecker
Friday 11:00:00 Rankings and importance indices Room 138 - Chair: JL. Marichal
Friday 11:00:00 Queueing Room 035 - Chair: S. Wittevrongel
Friday 15:10:00 Optimization software Room 126 - Chair: E. Loute
Friday 15:10:00 Integrated operations planning Room 130 - Chair: B. Raa
Friday 15:10:00 Cycles in graphs Room 138 - Chair: F. Spieksma
|
|