Graph Cuts and Related Discrete or Continuous Optimization Problems - IPAM

Graph Cuts and Related Discrete or Continuous Optimization Problems

February 25 - 29, 2008

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, February 25, 2008

Morning Session

08:00
Discussion Leader: Tony Chan
09:00-09:10
Welcome and Opening Remarks
09:10-10:40
Leo Grady (Siemens Corporate Research, Inc.)
Reformulating and Solving Continuous Functionals and PDEs on Graphs: Applications in Computer Vision
10:45-11:10
Break
11:10-11:55
Nikos Komodakis (École Nationale des Ponts-et-Chaussées)
MRF optimization based on linear programming relaxations

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:45
Philip Torr (Oxford Brookes University)
An Analysis of Convex Relaxations for MAP Estimation (Part I) & Minimizing Higher order Energy Functions using Graph Cuts (Part II)
14:50-15:05
Break
15:05-15:50
Andrew Goldberg (Microsoft Research)
New Tricks for an Old Dog: Improved Maximum Flow Algorithms
15:55-16:10
Break
16:10-16:55
Yuri Boykov (University of Western Ontario)
Optimization of surface functionals using discrete graph cut algorithms
17:00-19:00
Poster Session & Reception (hosted by IPAM)

Tuesday, February 26, 2008

Morning Session

08:00
Discussion Leader: Fadil Santosa
08:00-09:00
Continental Breakfast
09:00-09:45
Dorit Hochbaum (University of California, Berkeley (UC Berkeley))
Efficient cut-based image segmentation techniques
09:50-10:05
Break
10:05-10:50
Boris Zalesky (United Institute of Informatics Problems, National Academy of Belarus)
Multiresolution Graph Cut Methods in Image Processing and Gibbs Estimation
10:55-11:10
Break
11:10-11:55
()
Title not available

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:45
Jerome Darbon (Brown University)
Global MRF optimization and the particular case of TV
14:50-15:05
Break
15:05-15:50
Stanley Osher (University of California, Los Angeles (UCLA))
Bregman iterative algorithms for compressed sensing
15:55-16:10
Break
16:10-16:55
Jose Dias (Instituto Superior Tecnico)
Multi-source Absolute Phase Estimation: A Multi-precision Approach Based on Graph Cuts

Wednesday, February 27, 2008

Morning Session

08:00
Discussion Leader: Selim Esedoglu
08:00-09:00
Continental Breakfast
09:00-09:45
Hiroshi Ishikawa (Nagoya City University)
Organizing higher-order cliques by sparse representation
09:50-10:05
Break
10:05-10:50
Pedro Felzenszwalb (University of Chicago)
Efficient Belief Propagation for Early Vision
10:55-11:10
Break
11:10-11:55
Vladimir Kolmogorov (University College London)
A faster algorithm for computing the principal sequence of partitions of a graph

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:45
Jens Keuchel (BrainLAB)
Semidefinite Programming Relaxations for Combinatorial Optimization Problems
14:50-15:05
Break
15:05-15:50
Achi Brandt (Weizmann Institute of Science)
Multilevel Processing of large graph problems
15:55-16:10
Break
16:10-16:55
Ronen Basri (Weizmann Institute of Science)
Multiscale Image Segmentation

Thursday, February 28, 2008

Morning Session

08:00
Discussion Leader: Davi Geiger
08:00-09:00
Continental Breakfast
09:00-09:45
Daniel Cremers (University of Bonn)
Global Solutions for Shape Optimization in Computer Vision
09:50-10:05
Break
10:05-10:50
Endre Boros (Rutgers University)
A strongly polynomial preprocessing for quadratic binary optimization
10:55-11:10
Break
11:10-11:55
Andrew Blake (Microsoft Research)
LogCut - Efficient Graph Cut Optimization for Markov Random Fields

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:45
Olga Veksler (University of Western Ontario)
Multi-label Moves for Multi-Label Energies
14:50-15:05
Break
15:05-15:50
Gilbert Strang (Massachusetts Institute of Technology)
Minimum Cuts, Maximum Area, and Duality
15:55-16:10
Break
16:10-16:55
Hugues Talbot (École Supérieure d'Ingénieurs en Électrotechnique et Électronique)
Continuous maximal flows and applications

Friday, February 29, 2008

Morning Session

09:00-09:45
M.I. Schlesinger (Institute of Cybernetics)
SOLUTION TO (MAX,+)-LABELLING PROBLEMS ON THE BASE OF THEIR EQUIVALENT TRASFORMATIONS
09:50-10:05
Break
10:05-10:50
Martin Wainwright (University of California, Berkeley (UC Berkeley))
Tree-reweighted max-product and linear programming relaxation: Algorithmic connections and some randomized analysis
10:55-11:10
Break
11:10-11:55
Pradeep Ravikumar (Carnegie Mellon University)
Title not available

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:45
Christoph Schnörr (University of Heidelberg)
On TV Regularization of Image Flows and MRF-Inference by DC-Programming
14:50-15:05
Break
15:05-15:50
John Sullivan (Technishche Universtitat Berlin)
From Continuous to Discrete: the Example of Minimal Surfaces
Printable Version