Optimal Grouping of Line Segments into Convex Sets.

In this paper, we present a technique for grouping line segments into convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach is twofold: first we define an efficient approach for testing the global convexity criterion, and second, we develop an optimal search based on dynamic programming for grouping the line segments into convex sets. We show results on real images, and present a specific domain where this type of grouping can be directly applied.