Seminars and Colloquia by Series

A combinatorial spanning tree model for delta-graded knot Floer homology

Series
Geometry Topology Seminar
Time
Monday, April 18, 2011 - 14:20 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
John Baldwin – Princeton
I'll describe a new combinatorial method for computing the delta-graded knot Floer homology of a link in S^3. Our construction comes from iterating an unoriented skein exact triangle discovered by Manolescu, and yields a chain complex for knot Floer homology which is reminiscent of that of Khovanov homology, but is generated (roughly) by spanning trees of the black graph of the link. This is joint work with Adam Levine.

A Piecewise Smooth Image Segmentation Using Gamma-Convergence Approximation in Medical Imaging

Series
Applied and Computational Mathematics Seminar
Time
Monday, April 18, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
JungHa An – California State University, Stanislaus
Medical imaging is the application of mathematical and engineering models to create images of the human body for clinical purposes or medical science by using a medical device. One of the main objectives of medical imaging research is to find the boundary of the region of the interest. The procedure to find the boundary of the region of the interest is called a segmentation. The purpose of this talk is to present a variational region based algorithm that is able to deal with spatial perturbations of the image intensity directly. Image segmentation is obtained by using a Gamma-Convergence approximation for a multi-scale piecewise smooth model. This model overcomes the limitations of global region models while avoiding the high sensitivity of local approaches. The proposed model is implemented efficiently using recursive Gaussian convolutions. The model is applied to magnetic resonance (MR) images where image quality depends highly on the acquisition protocol. Numerical experiments on 2-dimensional human liver MR images show that our model compares favorably to existing methods.This work is done in collaborated with Mikael Rousson and Chenyang Xu.

Oral Comprehensive Exam

Series
Geometry Topology Seminar
Time
Monday, April 18, 2011 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Becca Winarski – Georgia Tech

Please Note: The actual talk will be 40 minutes. Note the unusual time.

The theorem of Birman and Hilden relates the mapping class group of a surface and its image under a covering map. I'll explore when we can extend the original theorem and possible applications for further work.

Atlanta Lecture Series in Combinatorics and Graph Theory III

Series
Other Talks
Time
Saturday, April 16, 2011 - 13:00 for 4 hours (half day)
Location
Klaus 1456
Speaker
Atlanta Lecture Series – School of Mathematics, Georgia Tech
Emory University, the Georgia Institute of Technology and Georgia State University will host a series of 9 mini-conferences from November, 2010 - April 2013. The conferences will stress a variety of areas and feature one prominent researcher giving 2 fifty minute lectures and 4 outstanding southern researchers each giving one fifty minute lecture. There will also be several 30 minute lecturers by young researchers or graduate students. The featured speaker is Maria Chudnovsky, Columbia University. The lectures begin at 1:00 PM Saturday, April 16 and end at noon on Sunday, April 17.

Generic rectangulations and pattern-avoiding permutations

Series
Combinatorics Seminar
Time
Friday, April 15, 2011 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Nathan Reading – North Carolina State University
A rectangulation is a tiling of a rectangle by rectangles. The rectangulation is called generic if no four of its rectangles share a corner. We will consider the problem of counting generic rectangulations (with n rectangles) up to combinatorial equivalence. This talk will present and explain an initial step in the enumeration: the fact that generic rectangulations are in bijection with permutations that avoid a certain set of patterns. I'll give background information on rectangulations and pattern avoidance. Then I'll make the connection between generic rectangulations and pattern avoiding permutations, which draws on earlier work with Shirley Law on "diagonal" rectangulations. I'll also comment on two theories that led to this result and its proof: the lattice theory of the weak order on permutations and the theory of combinatorial Hopf algebras.

[Special Date] Iterative 3D/4D Cone Beam CT Reconstruction on GPU in Cancer Radiation Therapy

Series
Applied and Computational Mathematics Seminar
Time
Friday, April 15, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Xun Jia – University of California, San Diego, Department of Radiation Oncology
Cone Beam Computer tomography (CBCT) has been broadly applied incancer radiation therapy, mainly for positioning patients to align withtreatment radiation beams. As opposed to tomography reconstruction problemsfor diagnostic purposes, CBCT reconstruction in radiotherapy requires a highcomputational efficiency, since it is performed while patient is lying on acouch, waiting for the treatment. Moreover, the excessive radiation dosefrom frequent scans has become a clinical concern. It is therefore desirableto develop new techniques to reconstruct CBCT images from low dose scans. Inthis talk, I will present our recent work on an iterative low dose CBCTreconstruction technique via total variation regularization and tight frameregularization. It is found that 40~60 x-ray projections are sufficient toreconstruct a volumetric image with satisfactory quality in about 2min. Wehave also studied 4 dimensional CBCT (4DCBCT) reconstruction problem viatemporal non-local means (TNLM) and high quality 4DCBCT images can beobtained. Our algorithms have been fully implemented on a graphicsprocessing unit. Detailed implementation techniques will also be addressed.

FoSoM Panel Discussion

Series
Other Talks
Time
Thursday, April 14, 2011 - 16:00 for 3 hours
Location
Skiles 005
Speaker
Math Alumni – School of Mathematics, Georgia Tech

Please Note: Refreshments will be served at 3:30.

The Friends of the School of Mathematics present a panel discussion on "Non-Academic Careers: Opportunities and Challenges for Students" A distinguished panel of alumni of the School will present their views on opportunities and challenges for students as they prepare for non-academic careers. The panelists will also answer questions from the audience. Graduate students and undergraduate majors in Mathematics are especially encouraged to attend.

Rumor Processes on $\bb{N}$

Series
Stochastics Seminar
Time
Thursday, April 14, 2011 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 171
Speaker
Fabio Machado – USP san paulo Brazil
We study four discrete time stochastic systems on \bbN modelingprocesses of rumour spreading. The involved individuals can eitherhave an active ora passive role, speaking up or asking for the rumour. The appetite inspreading or hearing the rumour is represented by a set of randomvariables whose distributionsmay depend on the individuals. Our goal is to understand - based on those randomvariables distribution - whether the probability of having an infiniteset of individuals knowing the rumour is positive or not.

On Steinberg's Conjecture: 3-coloring certain planar graphs

Series
Graph Theory Seminar
Time
Thursday, April 14, 2011 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Peter Whalen – Math, GT
Steinberg's Conjecture states that any planar graph without cycles of length four or five is three colorable. Borodin, Glebov, Montassier, and Raspaud showed that planar graphs without cycles of length four, five, or seven are three colorable and Borodin and Glebov showed that planar graphs without five cycles or triangles at distance at most two apart are three colorable. We prove a statement similar to both of these results: that any planar graph with no cycles of length four through six or cycles of length seven with incident triangles distance exactly two apart are three colorable. Special thanks to Robin Thomas for substantial contributions in the development of the proof.

Pages