30 September 1996 Discrete active models in vision geometry
Author Affiliations +
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.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Azriel Rosenfeld, Azriel Rosenfeld, Sandor Fejes, Sandor Fejes, } "Discrete active models in vision geometry", Proc. SPIE 2826, Vision Geometry V, (30 September 1996); doi: 10.1117/12.251814; https://doi.org/10.1117/12.251814

Back to Top