Share Email Print

Proceedings Paper

Discrete active models in vision geometry
Author(s): Azriel Rosenfeld; Sandor Fejes
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Optimization processes based on `active models' have been used to solve many problems in computer vision. This paper describes a simple class of discrete active models, called migration processes, which can be defined without the use of sophisticated mathematical machinery. The processes are based on iterated averaging over neighborhoods defined by constant geodesic distance. They can be applied to derive natural solutions to a variety of optimization problems, including defining (minimal) surface patches given their boundary curves; and finding shortest paths joining set of points.

Paper Details

Date Published: 30 September 1996
PDF: 21 pages
Proc. SPIE 2826, Vision Geometry V, (30 September 1996); doi: 10.1117/12.251814
Show Author Affiliations
Azriel Rosenfeld, Univ. of Maryland/College Park (United States)
Sandor Fejes, Univ. of Maryland/College Park (United States)

Published in SPIE Proceedings Vol. 2826:
Vision Geometry V
Robert A. Melter; Angela Y. Wu; Longin Jan Latecki, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?