BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Optimization for Pixel Labeling Problems With Structured Layout - 
 Olga Veksler\, the University of Western Ontario
DTSTART:20110318T130000Z
DTEND:20110318T134500Z
UID:TALK30384@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Pixel labeling problems are pervasive in computer vision resea
 rch. In this talk\, we discuss optimization approaches for labeling proble
 ms which have some structure imposed on the layout of the labels. In other
  words\, the relationships between labels is not arbitrary but has a well 
 defined spatial structure. We will describe two approaches for structured 
 layout scenes. The first approach is for a more restrictive type of scenes
 \, for which we develop new graph-cut moves which we call order-preserving
 . The advantage of order preserving moves is that they act on all labels s
 imultaneously\, unlike the popular expansion algorithm\, and\, therefore\,
  escape local minima more easily. The second approach is for a more genera
 l type of structured layout scenes and it is based on dynamic programming.
  In the second case\, the exact minimum can be found efficiently. This is 
 very rare for a 2D labeling problem to have an efficient and global optimi
 zer. For both approaches\, our applications include geometric class labeli
 ng and segmentation with a shape prior.
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR