Robust and efficient detection of convex groups

An algorithm is presented that finds all convex sets of line segments in an image, such that the length of the line segments account for at least some fixed proportion of the length of the convex hull. This enables the algorithm to find convex groups whose contours are partially occluded or missing due to noise. An expected time analysis of the algorithm's performance is performed, together with experiments on real images that show that the algorithm is efficient and that tell when the groups found are unlikely to occur at random, and are likely to capture the underlying structure of a scene.<
>