|
|
Graph Cuts and Related Discrete or Continuous Optimization Problems
February 25 - 29, 2008
Organizing Committee |
Scientific Overview |
Speaker List
Application/Registration |
Contact Us
Organizing Committee
Yuri Boykov
(University of Western Ontario)
Daniel Cremers
(University of Bonn)
Jerome Darbon
(University of California, Los Angeles (UCLA))
Hiroshi Ishikawa
(Nagoya City University)
Vladimir Kolmogorov
(University College London)
Stanley Osher
(University of California, Los Angeles (UCLA), Mathematics)
Back to Top
Scientific Overview
Many computer vision and image processing problems can be formulated as a discrete
optimization problem. Among several available optimization schemes, combinatorial min-cut
algorithms on graphs emerged as an increasingly useful tool for performing these
optimizations. This success is mainly twofold. First, in some cases graph cuts produce
globally optimal solutions. More generally, there are iterative graph-cut based techniques
that produce provably good local optimizer that are also high-quality solutions in practice.
Second, graph-cuts allow for a geometric interpretation. Provided some assumptions, a cut
on a graph can be seen as a hypersurface in N-D space embedding the corresponding graph.
This point of view has been very fruitful in computer vision for computing hypersurfaces.
Besides, graph-cut approaches have been shown to be very fast in practice. Finally some
links between graph-cuts, message passing and belief propagation have been recently shown.
Back to Top
Invited Speakers
Ronen Basri
(Weizmann Institute of Science)
Andrew Blake
(Microsoft Research)
Endre Boros
(Rutgers University)
Yuri Boykov
(University of Western Ontario)
Achi Brandt
(Weizmann Institute of Science)
Daniel Cremers
(University of Bonn)
Jerome Darbon
(University of California, Los Angeles (UCLA))
Jose Dias
(Instituto Superior Tecnico)
Pedro Felzenszwalb
(University of Chicago)
Andrew Goldberg
(Microsoft Research)
Don Goldfarb
(Columbia University)
Leo Grady
(Siemens Corporate Research, Inc.)
Dorit Hochbaum
(University of California, Berkeley (UC Berkeley))
Hiroshi Ishikawa
(Nagoya City University)
Jens Keuchel
(BrainLAB)
Vladimir Kolmogorov
(University College London)
Nikos Komodakis
(University of Crete)
Stanley Osher
(University of California, Los Angeles (UCLA))
Pradeep Ravikumar
(University of California, Berkeley (UC Berkeley))
M.I. Schlesinger
(Institute of Cybernetics)
Christoph Schnörr
(University of Heidelberg)
Gilbert Strang
(Massachusetts Institute of Technology)
John Sullivan
(Technishche Universtitat Berlin)
Hugues Talbot
(École Supérieure d'Ingénieurs en Électrotechnique et Électronique)
Philip Torr
(Oxford Brookes University)
Olga Veksler
(University of Western Ontario)
Martin Wainwright
(University of California, Berkeley (UC Berkeley))
Wotao Yin
(Rice University)
Boris Zalesky
(United Institute of Informatics Problems, National Academy of Belarus)
Back to Top
Contact Us:
Institute for Pure and Applied Mathematics (IPAM)
Attn: GC2008
460 Portola Plaza
Los Angeles CA 90095-7121
Phone: 310 825-4755
Fax: 310 825-4756
Email: ipam@ucla.edu
Website:
http://www.ipam.ucla.edu/programs/gc2008/
Back to Top
|