Graph cut, convex relaxation and continuous max-flow problems
, Department of Mathematics, University of Bergen, Norway
Date: Tuesday, February 25, 2014
Time: 3:00 PM to 4:00 PM Note: all times are in the Eastern Time Zone
Location: 32-D463 (Star)
Host: John W. Fisher
Contact: Guy Rosman, 857-207-5807, email@example.com
Speaker URL: None
TALK: Graph cut, convex relaxation and continuous max-flow problems
In this talk, we will explore the relationship between graph cut, convex relaxation and some recent continuous max-flow approaches. Especially, we will see the continuous versus discrete relationship between them. There are two advantages with these approaches: 1) different fast numerical algorithms have been used for these approaches; 2) global minimization can be guaranteed for some nonconvex problems. We shall explore the connections between some of these algorithms.
Image restoration and segmentation will be used as examples for applications of these algorithms. Extended application of ROF model, global minimization of the Chan-Vese model and different global minimization approach for multiphase labeling problems will be presented. This talk is based on collaborative work with Bae, Boykov, Yuan, Liu and other collaborators.
Please contact Guy Rosman (firstname.lastname@example.org) if you would like to meet with the speaker that day.
Created by Guy Rosman at Saturday, February 15, 2014 at 10:27 AM.