Meeting Agenda

Date:	November 15th
Location:	DC 1304
Time:	10:30
Chair:	Elodie Fourquet

1. Changes to the Agenda - additions or deletions

2. Coffee Hour

Coffee hour last week:: Jeff Dicker- thanks!
Coffee hour this week:: Rodolpho
Coffee hour next week:: Volunteers?

3. Forthcoming

Date:	November 22nd	November 29th	December 6th	December 13th
Location:	DC 1304 10:30	DC 1304 10:30	DC 1304 10:30	DC 1304 10:30
Chair:	Alex Kalaidjian	Ed Lank	Andrew Lauritzen	Vladimir Levin
Technical Presentation:	Gabriel Esteves	Elodie Fourquet	Alex Kalaidjian	Ed Lank

4. Technical Presentation

Jeff Dicker	Title : Propagation Algorithms: Fast Marching Methods and Level Set Methods. Abstract: Propagation algorithms appear in a wide variety of scientific applications. Mathematics formulates many problems as propagation problems; in Physics, fire, water or nearly any other wave motion can be readily represented by propagation; in Computer Science, less obvious uses such as image segmentation and planning can be represented as propagation problems. Thus, fast methods of propagation are very desirable. Level Set Methods are the foundation of general propagation formulation. Using these methods, an interface can be expanded and contracted using basic data structures and knowledge of level curves. Fast Marching Methods are built off of the principles used to solve the propagation formulation used for the Level Set Methods. Interfaces propagated by a Fast Marching Method can only be expanded, and require a heap structure, but the speed increase is well worth any restrictions and difficulties. Running in O(nlog(n)), Fast Marching Methods can propagate an interface very efficiently.

Jeff Dicker

Title : Propagation Algorithms: Fast Marching Methods and Level Set Methods.

Abstract:
Propagation algorithms appear in a wide variety of scientific applications. Mathematics formulates many problems as propagation problems; in Physics, fire, water or nearly any other wave motion can be readily represented by propagation; in Computer Science, less obvious uses such as image segmentation and planning can be represented as propagation problems. Thus, fast methods of propagation are very desirable. Level Set Methods are the foundation of general propagation formulation. Using these methods, an interface can be expanded and contracted using basic data structures and knowledge of level curves. Fast Marching Methods are built off of the principles used to solve the propagation formulation used for the Level Set Methods. Interfaces propagated by a Fast Marching Method can only be expanded, and require a heap structure, but the speed increase is well worth any restrictions and difficulties. Running in O(nlog(n)), Fast Marching Methods can propagate an interface very efficiently.

5. Discussion Items

None so far...

6. Action Items

7. Conferences and Special Journal Issues

8. Directors' Meeting

9. Seminars and Events

Friday, 17 November 2006, 1:30PM - Computer Science (Algorithms and Complexity Group), DC 1304: Tarique Islam: -- The Fixed-Parameter Complexity of Longest Common Subsequence and PDA Intersection Problems

Thursday, 16 November, 1:00PM - Cryptography, Security, and Privacy (CrySP) Group Seminar, DC1304: Dan Boneh, Stanford UniversityBroadcast Encryption and Traitor Tracing

Tuesday, 21 November, 14:30 - Bioinformatics Group Seminar, DC 1331: Jumping Hidden Markov Models for Recombination Detection in HIV

Also see other Math and CS postings.