Share Email Print

Proceedings Paper

Global minima via dynamic programming: energy minimizing active contours
Author(s): Sharat Chandran; Tsukasa Maejima; Sanae Miyazaki
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Reconstruction of objects from a scene may be viewed as a data fitting problem using energy minimizing splines as the basic shape. The process of obtaining the minimum to construct the "best" shape can sometimes be important. Recently, [AWJ9O] brought to light some of the potential problems in the Euler-Lagrangian variational solution proposed in the original formulation [KWT87], and suggested a dynamic programming method. In this paper we further develop the dynamic programming solution. We show that in certain cases, the discrete form of the solution in [AWJ9O] may also produce local minimums, and develop a strategy to avoid this. In the continuous domain, we provide a stronger form of the conditions necessary to derive a solution when the energy depends on the second derivative, as in the case of "active contours."

Paper Details

Date Published: 1 September 1991
PDF: 12 pages
Proc. SPIE 1570, Geometric Methods in Computer Vision, (1 September 1991); doi: 10.1117/12.48441
Show Author Affiliations
Sharat Chandran, NTT Data Communication Systems Corp. (Japan)
Tsukasa Maejima, NTT Data Communication Systems Corp. (Japan)
Sanae Miyazaki, NTT Data Communication Systems Corp. (Japan)

Published in SPIE Proceedings Vol. 1570:
Geometric Methods in Computer Vision
Baba C. Vemuri, 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?