דלג לתוכן (מקש קיצור 's')
Logo of Technion
Logo of CS Department
אירועים

אירועים

Pixel Club: Graph Cut, Convex relaxation and Continuous Max-flow Problems
event speaker icon
סו-צ'נג תאי (אונ' ברגן, נורווגיה)
event date icon
יום חמישי, 9.5.2013, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
In this talk, we will explore the relationship between graph cut, convex relaxation and some recent continuous max-flow approaches proposed in the literature. 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 describe 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, Yuan, Liu and other collaborators.
[בחזרה לאינדקס האירועים]