Research Article

Contour Detection and Completion for Inpainting and Segmentation Based on Topological Gradient and Fast Marching Algorithms

Figure 6

(a) Admissible set of points (i.e., most negative values of the topological gradient) in blue, and 3 keypoints automatically selected in black; (b) Distance function computed from these 3 keypoints with the fast marching algorithm; (c) Corresponding Voronoï diagram, with the 3 keypoints and saddle points; (d) Identified minimal path between the keypoints represented on the distance function; (e) Minimal path between the keypoints represented on the original image; (f) Another identified continuous contour from other keypoints.
592924.fig.006a
(a)
592924.fig.006b
(b)
592924.fig.006c
(c)
592924.fig.006d
(d)
592924.fig.006e
(e)
592924.fig.006f
(f)