A Gradient Descent Procedure for Variational Dynamic Surface Problems with Constraints
Author(s) -
Jan Erik Solem,
Niels Chr. Overgaard
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-29348-5
DOI - 10.1007/11567646_28
Subject(s) - generalization , gradient descent , dimension (graph theory) , descent (aeronautics) , variational analysis , surface (topology) , set (abstract data type) , projection (relational algebra) , computer science , variational inequality , variational method , balanced flow , interpretation (philosophy) , mathematics , mathematical optimization , algorithm , mathematical analysis , geometry , artificial intelligence , pure mathematics , artificial neural network , physics , programming language , meteorology
Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and surfaces, are determined as minimizers of functionals using e.g. the variational level set method. In this paper we consider such variational problems with constraints given by functionals. We use the geometric interpretation of gradients for functionals to construct gradient descent evolutions for these constrained problems. The result is a generalization of the standard gradient projection method to an infinite-dimensional level set framework. The method is illustrated with examples and the results are valid for surfaces of any dimension.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom