Algorithms for stochastic approximations of curvature flows

Gozde Unal; Delphine Nain; Gerard Ben-Arous; Nahum Shimkin; Allen Tannenbaum; Ofer Zeitouni

Algorithms for stochastic approximations of curvature flows

Gozde Unal^*
, Delphine Nain
, Gerard Ben-Arous
, Nahum Shimkin
, Allen Tannenbaum
, Ofer Zeitouni

^*Corresponding author for this work

Georgia Institute of Technology
College of Computing
New York University
Technion-Israel Institute of Technology
University of Minnesota Twin Cities

Research output: Contribution to conference › Paper › peer-review

6 Citations (Scopus)

Abstract

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 converges toward 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.

Original language	English
Pages	651-654
Number of pages	4
Publication status	Published - 2003
Externally published	Yes
Event	Proceedings: 2003 International Conference on Image Processing, ICIP-2003 - Barcelona, Spain Duration: 14 Sept 2003 → 17 Sept 2003

Conference

Conference	Proceedings: 2003 International Conference on Image Processing, ICIP-2003
Country/Territory	Spain
City	Barcelona
Period	14/09/03 → 17/09/03

Cite this

@conference{bb19d6ed7f604d88b537f2d7eddf42b0,

title = "Algorithms for stochastic approximations of curvature flows",

abstract = "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 converges toward 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.",

author = "Gozde Unal and Delphine Nain and Gerard Ben-Arous and Nahum Shimkin and Allen Tannenbaum and Ofer Zeitouni",

year = "2003",

language = "English",

pages = "651--654",

note = "Proceedings: 2003 International Conference on Image Processing, ICIP-2003 ; Conference date: 14-09-2003 Through 17-09-2003",

}

TY - CONF

T1 - Algorithms for stochastic approximations of curvature flows

AU - Unal, Gozde

AU - Nain, Delphine

AU - Ben-Arous, Gerard

AU - Shimkin, Nahum

AU - Tannenbaum, Allen

AU - Zeitouni, Ofer

PY - 2003

Y1 - 2003

N2 - 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 converges toward 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.

AB - 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 converges toward 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.

UR - https://www.scopus.com/pages/publications/0344271954

M3 - Paper

AN - SCOPUS:0344271954

SP - 651

EP - 654

T2 - Proceedings: 2003 International Conference on Image Processing, ICIP-2003

Y2 - 14 September 2003 through 17 September 2003

ER -

Algorithms for stochastic approximations of curvature flows

Abstract

Conference

Other files and links

Fingerprint

Cite this