Sciweavers

ICIP
2003
IEEE

Algorithms for stochastic approximations of curvature flows

15 years 1 months ago
Algorithms for stochastic approximations of curvature flows
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame propagation, and computer vision. In some previous work [1], we have described a random particle system, evolving on the discretized unit circle, whose profile convergestoward the Gauss-Minkowsky transformation of solutions of curve shortening flows initiated by convex curves. The present note shows that this theory may be implemented as a new way of evolving curves and as a possible alternative to level set methods.
Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum
Added 24 Oct 2009
Updated 24 Oct 2009
Type Conference
Year 2003
Where ICIP
Authors Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum Shimkin, Allen Tannenbaum, Ofer Zeitouni
Comments (0)