Speaker: Professor Xue-Cheng Tai University of Bergen, Norway
Time: Thu, Dec 3 2015, 4:10PM
Place: 3106 MSB
Host: Zhaojun Bai
Abstract: A network can often be represented as a graph. Max-flow/min-cuts over a given graph can be used to find optimal solutions for many complicated network problems. It is known that these kind of problems are often NP-hard and they pose some very challenging minimization problems for simulations. In this talk, we will show how to use graph and cuts methods for some image processing and computer vision problems. Especially, we shall present our recent work extending the concept of max-flow/min-cuts to “networks” that are infinite dimension, i.e we will talk about continuous max-flow/min-cuts problems. When we discrete these continuous max-flow problems, we come back to the ordinary finite dimension max-flow problems. The continuous max-flow models can be solved through the solution of some partial differential equations and convex optimization techniques. In the end of the talk, we will show two applications of these techniques for classifications of high dimensional data related to machine learning, especially for “Multli-class Transductive Learning” problems. We will also briefly show one application of these ideas for road condition detection from traffic cameras. This talk is based on some joint works with: E. Bae, A. Bertozzi, Y. Boykov, M. Ekaterina, J. Yuan.
3106 Mathematical Science Building