Lecture Series in Pattern Recognition
题 目 (TITLE)：Graph cut, convex relaxation and continuous max-flow problems
讲 座 人 (SPEAKER)：Prof. TAI XUE-CHENG (University of Bergen, Norway)
主 持 人 (CHAIR)：Prof. Ziqing Li
时 间 (TIME)：April 30 (Wednesday), 2014, 2:00 PM
地 点 (VENUE)：No.1 Conference Room (3rd floor), Intelligence Building
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 EgilBae, Yuri Boykov, Jing Yuan, Jun Liu and other collaborators.
Prof Tai Xue-Cheng is a member of the Department of Mathematics at the University of Bergen of Norway. In addition, he is also a member of Center of Mathematics for Application at University of Oslo and Center of Integrated Petroleum Research at Bergen. Prof. Tai is the winner of the 8th Feng Kang Prize for scientific computing. Prof. Tai is a member of the editor board for the several SCI international journals. His research interests include numerical PDEs, optimization techniques, inverse problems, and image processing. He has done significant research work his research areas and published over 100 top quality international conference and journal papers.