Snakes and Active Contours - Bezier and Splines in Image Processing and Machine Vision - page 201

Fig. 9.16. The Gunn and Nixon dual active contour approach to handle local
minimum problem applied to cell image segmentation problem (from [11]).
all half-snakes that meet at that joint. Once we know the common joint-end
position, we can follow the backward pointers of the Viterbi algorithm to
determine the position of all remaining points on the half-snake. The refined
half-snakes are then reconnected to form the final result as shown in Figure
9.19.