Generalized Fast Marching Method and applications

Add to your list(s) Download to your calendar using vCal

• Nicolas Forcadel (University Paris-Dauphine)
• Thursday 27 September 2012, 15:00-16:00
• MR 14, CMS.

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

The Fast Marching Method have been proposed by Sethian in 1996 to solve very efficiently front propagation problem when the front evolves in its normal direction with a positive speed depending only on space.

The goal of this presentation is to give a generalization of this algorithm when the normal velocity depends also on time and can change sign. We will prove that the proposed algorithm is convergent and that the complexity is essentially the same as in the classical case.

Finally, we will present some applications in dislocations dynamics and image segmentation.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• DAMTP info aggregator
• Featured lists
• Interested Talks
• MR 14, CMS
• My seminars
• Type the title of a new list here
• bld31

Note that ex-directory lists are not shown.