CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1995 vol.17 Issue No.03 - March
Issue No.03 - March (1995 vol.17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.368194
<p><it>Abstract</it>—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.</p><p>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.</p><p>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.</p><p>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.</p>
Dynamic programming, deformable contours, snakes, contour segmentation, tracking, matching, optimal solutions.
Alok Gupta, Davi Geiger, John Vlontzos, "Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.17, no. 3, pp. 294-302, March 1995, doi:10.1109/34.368194