Tracking Deformable Templates Using a Shortest Path Algorithm

✍ Scribed by Marie-Pierre Dubuisson-Jolly; Alok Gupta

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 698 KB
• Volume: 81
• Category: Article
• ISSN: 1077-3142
• DOI: 10.1006/cviu.2000.0883

✦ Synopsis

This paper proposes a new technique to track deformable templates. We extend the typical graph algorithms that have been used for active contour recovery to incorporate shape information. The advantage of graph algorithms is that they are guaranteed to find the global minimum of the energy function. The difficulty with their traditional use for active contours is that they consider only two pixels at a time when recovering the contour, making it impossible to enforce shape constraints. We define the deformable template as a polygonal contour, demonstrate the proper mapping between the image, the contour, and a graph, and show how to apply Dijkstra's algorithm to track contours in image sequences. Examples are shown for deforming contours, articulated objects, and smooth contours being tracked in simple and complicated backgrounds. We also provide an analysis of the computational requirements.