A maximum-likelihood approach to segmenting range data

Abstract

The problem of segmenting a range image into homogeneous regions in each of which the range data correspond to a different surface is considered. The segmentation sought is a maximum-likelihood (ML) segmentation. Only planes, cylinders, and spheres are considered as presented in the image. The basic approach to segmentation is to divide the range image into windows, classify each window as a particular surface primitive, and group like windows into surface regions. Mixed windows are detected by testing the hypothesis that a window is homogeneous. Homogeneous windows are classified according to a generalized likelihood ratio test which is computationally simple and incorporates information from adjacent windows. Grouping windows of the same surface types is cast as a weighted ML clustering problem. Finally, mixed windows are segmented using an ML hierarchical segmentation algorithm. A similar approach is taken for segmenting visible-light images of Lambertian objects illuminated by a point source at infinity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>