Discrete active models in vision geometry

Azriel Rosenfeld; Sandor Fejes

doi:10.1117/12.251814

30 September 1996 Discrete active models in vision geometry

Azriel Rosenfeld, Sandor Fejes

Proceedings Volume 2826, Vision Geometry V; (1996) https://doi.org/10.1117/12.251814
Event: SPIE's 1996 International Symposium on Optical Science, Engineering, and Instrumentation, 1996, Denver, CO, United States

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.

Citation Download Citation

Azriel Rosenfeld and Sandor Fejes "Discrete active models in vision geometry", Proc. SPIE 2826, Vision Geometry V, (30 September 1996); https://doi.org/10.1117/12.251814

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available