Seminars and Colloquia Schedule

Rigid and Nonrigid Registration Models for Medical Images

Series
Applied and Computational Mathematics Seminar
Time
Tuesday, August 18, 2009 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Justin W. L. WanComputer Science, University of Waterloo
In image guided procedures such as radiation therapies and computer-assisted surgeries, physicians often need to align images that are taken at different times and by different modalities. Typically, a rigid registration is performed first, followed by a nonrigid registration. We are interested in efficient registrations methods which are robust (numerical solution procedure will not get stuck at local minima) and fast (ideally real time). We will present a robust continuous mutual information model for multimodality regisration and explore the new emerging parallel hardware for fast computation. Nonrigid registration is then applied afterwards to further enhance the results. Elastic and fluid models were usually used but edges and small details often appear smeared in the transformed templates. We will propose a new inviscid model formulated in a particle framework, and derive the corresponding nonlinear partial differential equations for computing the spatial transformation. The idea is to simulate the template image as a set of free particles moving toward the target positions under applied forces. Our model can accommodate both small and large deformations, with sharper edges and clear texture achieved at less computational cost. We demonstrate the performance of our model on a variety of images including 2D and 3D, mono-modal and multi-modal, synthetic and clinical data.

Submodular Function Minimization

Series
Combinatorics Seminar
Time
Wednesday, August 19, 2009 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Satoru IwataKyoto University
In this lecture, I will review combinatorial algorithms for minimizing submodular functions. In particular, I will present a new combinatorial algorithm obtained in my recent joint work with Jim Orlin.

Submodular Function Approximation

Series
Combinatorics Seminar
Time
Friday, August 21, 2009 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Satoru IwataKyoto University
In this lecture, I will explain the greedy approximation algorithm on submodular function maximization due to Nemhauser, Wolsey, and Fisher. Then I will apply this algorithm to the problem of approximating an monotone submodular functions by another submodular function with succinct representation. This approximation method is based on the maximum volume ellipsoid inscribed in a centrally symmetric convex body. This is joint work with Michel Goemans, Nick Harvey, and Vahab Mirrokni.