This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours
March 1995 (vol. 17 no. 3)
pp. 294-302

Abstract—The problem of segmenting an image into separate regions and tracking them over time is one of the most significant problems in vision. Terzopoulos et al have proposed an approach to detect the contour regions of complex shapes, assuming a user selected initial contour not very far from the desired solution.

We propose to further explore the information provided by the user’s selected points and apply an optimal method to detect contours which allows a segmentation of the image. The method is based on dynamic programming (DP), and applies to a wide variety of shapes. It is exact and not iterative. We also consider a multiscale approach capable of speeding up the algorithm by a factor of 20, although at the expense of losing the guaranteed optimality characteristic.

The problem of tracking and matching these contours is addressed. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. For matching, a novel strategy is proposed where the solution is a smooth displacement field in which unmatched regions are allowed while cross vectors are not. The algorithm is again based on DP and the optimal solution is guaranteed.

We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation and automatic tracking of the regions of interest in medical images.

[1] 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.
[2] N. Ayache, I. Cohen, and I. Herlin, "Medical Image Tracking," Active Vision, chapter 17. MIT Press, Dec. 1992.
[3] D.H. Ballard and C.M. Brown, Computer Vision, Prentice Hall, Upper Saddle River, N.J., 1982.
[4] M. Barzohar and D.B. Cooper,“Automatic finding of main roads in aerial images by using geometric-stochastic models and estimation,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 459-464, 1993.
[5] R. E. Bellman,Applied Dynamic Programming, Princeton Univ. Press, 1962.
[6] A. Blake and R. Cipollo,“The dynamic analysis of apparent contours,” First ECCV, pp. 73-82, Springer-Verlag, Antibes, France, Apr. 1990.
[7] I. Cohen, L.D. Cohen, and N. Ayache, "Using Deformable Surfaces to Segment 3D Images and Infer Differential Structures," Computer Vision, Graphics, and Image Processing, vol. 26, no. 2, pp. 242-263, 1992.
[8] D. Geiger and J. Kogler,“Scaling images and image features via the renormalization group,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, 1993.
[9] D. Geiger,B. Ladendorf,, and A. Yuille,“Binocular stereo with occlusion,” Computer Vision-ECCV92, G. Sandini, ed., vol. 588, pp. 423-433, Springer-Verlag, Santa Margherita, Italy, 1992.
[10] J. Gregor and M. Thomason, “Dynamic Programming Alignment of Sequences Representing Cyclic Patterns,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, pp. 129-135, 1993.
[11] A. Gueziec and N. Ayache,“Smoothing and matching of 3D space curves,” Second European Conf. Computer Vision, pp. 620-629,Santa Margherita Ligure, Italy, Springer-Verlag, 1992.
[12] M. Hospital,H. Yamada,T. Kasvand,, and S. Umeyama,“3D curve based matching method using dynamic programming,” Proc. Int’l Conf. Computer Vision, pp. 728-732, 1987.
[13] M. Kass,A. Witkin,, and D. Terzopoulos,“Snakes: Active contour models,” Proc. Int’l Conf. Computer Vision, pp. 259-268,London, England, June 1987.
[14] U. Montanari, “On the Optimal Detection of Curves in Noisy Pictures,” Comm. ACM, vol. 15, no. 5, pp. 335-345, 1971.
[15] E. Mortensen,B. Morse,W. Barrett,, and J. Udupa,“Adaptive boundary detection usinglive-wiretwo dimensional dynamic programming,” Computers and Cardiology, pp. 635-638, 1992.
[16] A. Pentland and B. Horowitz, “Recovery of Non-Rigid Motion and Structure,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 7, pp. 730-742, July 1991.
[17] A. Pentland and J. Williams, “Good Vibrations: Modal Dynamics for Graphics and Animation,” Proc. ACM SIGGRAPH, pp. 215-222, 1989.
[18] D. Pope,D. Parker,P. Clayton,, and D. Gustafson,“Left ventricular border recognition using a dynamic search algorithm,” Radiology, vol. 155, no. 2, pp. 513-517, 1985.
[19] H. Sakoe and S. Chiba, "Dynamic Programming Optimization for Spoken Word Recognition," IEEE Trans. ASSP, vol. 26, pp. 623-625, 1980.
[20] A. Sha'ashua and S. Ullman, “Structural Saliency: The Detection of Globally Salient Structures Using a Locally Connected Network,” Proc. Int'l Conf. Computer Vision, pp. 321-327, 1988.
[21] D. Terzopoulos,A. Witkin,, and M. Kass,“Symmetry-seeking models for 3D object reconstruction,” Proc. Int’l Conf. Computer Vision, pp. 269-276,London, England, June 1987.
[22] N. Ueda and K. Mase,“Tracking moving contours using energy-minimizing elastic contour models,” Computer Vision-ECCV92, G. Sandini, ed., vol. 588, pp. 453-457, Springer-Verlag, Santa Margherita, Italy, 1992.
[23] Y. Wu and H. Maitre,“Registration of a spot image and a SAR image using multiresolution representation of a coastline,” Proc. Int’l Conf. Pattern Recognition, pp. 913-917, 1990.
[24] A.L. Yuille and P.W. Hallinan, “Deformable Templates,” A. Blake and A. Yuille, eds., Active Vision, MIT Press, 1992.

Index Terms:
Dynamic programming, deformable contours, snakes, contour segmentation, tracking, matching, optimal solutions.
Citation:
Davi Geiger, Alok Gupta, Luiz A. Costa, John Vlontzos, "Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 3, pp. 294-302, March 1995, doi:10.1109/34.368194
Usage of this product signifies your acceptance of the Terms of Use.