This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Energy Minimization of Contours Using Boundary Conditions
May 1998 (vol. 20 no. 5)
pp. 546-549

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. Some of the potential problems in the Euler-Lagrangian variational solution proposed in the original formulation [1], were brought to light in [2], 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 [2], and adopted subsequently [3], [4], [5], [6] 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."

[1] M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active Contour Models," Int'l J. Computer Vision, vol. 1, pp. 321-331, 1988.
[2] A.A. Amini,T.E. Weymouth,, and R.C. Jain,“Using dynamic programming for solving variational problems in vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 9, pp. 855-867, 1990.
[3] Y. Ohnishi and Y. Ohta, "Extracting Energy Minimized Contours Using Dynamic Programming." bachelor's thesis, Tsukuba Univ., Mar. 1990. In Japanese.
[4] N. Ueda and K. Mase, "Minimization of Active Contour Energy Using Dynamic Programming," Spring Nat'l Convention Record, Inst. Electronics, Information, and Comm. Engineers, 1991. In Japanese.
[5] K. Fujimura, N. Yokoya, and K. Yamamoto, "Motion Tracking of Deformable Objects by Active Contour Models Using Multi-Scale Dynamic Programming," J. Visual Comm. Image Representation, Dec. 1993.
[6] D. Geiger, A. Gupta, L.A. Costa, and J. Vlontzos, Dynamical Programming for Detecting, Tracking and Matching Deformable Contours IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 3, pp. 294-302, Mar. 1995.
[7] T. Poggio, V. Torre, and C. Koch, "Computational Vision&Regularisation Theory," Nature, vol. 317, pp. 314-319, 1985.
[8] D.J. Williams and M. Shah, "A Fast Algorithm for Active Contours," Third Int'l Conf. Computer Vision, pp. 592-595, 1990.
[9] R. Bellman, Dynamic Programming.Princeton, N.J.: Princeton Univ. Press, 1957.
[10] A.K. Potty Master's thesis, IIT Bombay, 1995.

Index Terms:
Dynamic programming, energy minimization, deformable contours, optimal solutions, active contours.
Citation:
Sharat Chandran, A.k. Potty, "Energy Minimization of Contours Using Boundary Conditions," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 546-549, May 1998, doi:10.1109/34.682184
Usage of this product signifies your acceptance of the Terms of Use.