CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1998 vol.20 Issue No.05 - May
Issue No.05 - May (1998 vol.20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.682184
<p><b>Abstract</b>—Reconstruction of objects from a scene may be viewed as a data fitting problem using energy minimizing splines as the basic shape. The <it>process</it> of obtaining the minimum to construct the "best" shape can sometimes be important. Some of the potential problems in the Euler-Lagrangian variational solution proposed in the original formulation [<ref rid="bibi05461" type="bib">1</ref>], were brought to light in [<ref rid="bibi05462" type="bib">2</ref>], and a dynamic programming (DP) method was also suggested. In this paper we further develop the DP solution. We show that in certain cases, the discrete form of the solution in [<ref rid="bibi05462" type="bib">2</ref>], and adopted subsequently [<ref rid="bibi05463" type="bib">3</ref>], [<ref rid="bibi05464" type="bib">4</ref>], [<ref rid="bibi05465" type="bib">5</ref>], [<ref rid="bibi05466" type="bib">6</ref>] may also produce local minima, and develop a strategy to avoid this. 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."</p>
Dynamic programming, energy minimization, deformable contours, optimal solutions, active contours.
Sharat Chandran, A.k. Potty, "Energy Minimization of Contours Using Boundary Conditions", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.20, no. 5, pp. 546-549, May 1998, doi:10.1109/34.682184