Algorithms for stochastic approximations of curvature flows

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationIEEE International Conference on Image Processing
Pages651-654
Number of pages4
Volume2
StatePublished - 2003
EventProceedings: 2003 International Conference on Image Processing, ICIP-2003 - Barcelona, Spain
Duration: Sep 14 2003Sep 17 2003

Other

OtherProceedings: 2003 International Conference on Image Processing, ICIP-2003
CountrySpain
CityBarcelona
Period9/14/039/17/03

Fingerprint

Crystal growth
Computer vision

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Cite this

Unal, G., Nain, D., Ben-Arous, G., Shimkin, N., Tannenbaum, A., & Zeitouni, O. (2003). Algorithms for stochastic approximations of curvature flows. In IEEE International Conference on Image Processing (Vol. 2, pp. 651-654)

Algorithms for stochastic approximations of curvature flows. / Unal, Gozde; Nain, Delphine; Ben-Arous, Gerard; Shimkin, Nahum; Tannenbaum, Allen; Zeitouni, Ofer.

IEEE International Conference on Image Processing. Vol. 2 2003. p. 651-654.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Unal, G, Nain, D, Ben-Arous, G, Shimkin, N, Tannenbaum, A & Zeitouni, O 2003, Algorithms for stochastic approximations of curvature flows. in IEEE International Conference on Image Processing. vol. 2, pp. 651-654, Proceedings: 2003 International Conference on Image Processing, ICIP-2003, Barcelona, Spain, 9/14/03.
Unal G, Nain D, Ben-Arous G, Shimkin N, Tannenbaum A, Zeitouni O. Algorithms for stochastic approximations of curvature flows. In IEEE International Conference on Image Processing. Vol. 2. 2003. p. 651-654
Unal, Gozde ; Nain, Delphine ; Ben-Arous, Gerard ; Shimkin, Nahum ; Tannenbaum, Allen ; Zeitouni, Ofer. / Algorithms for stochastic approximations of curvature flows. IEEE International Conference on Image Processing. Vol. 2 2003. pp. 651-654
@inproceedings{033c0b113607409c8f1545fcaa7306e6,
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 (US)",
volume = "2",
pages = "651--654",
booktitle = "IEEE International Conference on Image Processing",

}

TY - GEN

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 - http://www.scopus.com/inward/record.url?scp=0344271954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0344271954&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0344271954

VL - 2

SP - 651

EP - 654

BT - IEEE International Conference on Image Processing

ER -