Advertisement
Published in:
2005 | OriginalPaper | Chapter
A Gradient Descent Procedure for Variational Dynamic Surface Problems with Constraints
Authors : Jan Erik Solem, Niels Chr. Overgaard
Published in: Variational, Geometric, and Level Set Methods in Computer Vision
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.