By Topic

A maximum likelihood approach to segmenting range data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. S. Cohen ; Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA ; R. D. Rimey

The problem of segmenting a range of image into homogeneous regions, in each of which the range data corresponds to a different surface, is discussed. A maximum-likelihood (ML) segmentation is sought. As most manufactured parts are well approximated by patches of planes, cylinders, and spheres, these three simple surfaces are considered to be the only surfaces 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. Grouping windows of the same surface types is cast as a weighted ML clustering problem. Mixed windows are segmented using a ML hierarchical segmentation algorithm. The resulting regions and their associated ML surface parameter and boundary estimates can then be used to perform ML object position estimation and matching. A similar approach is taken for segmenting visible-light images of Lambertian objects illuminated by a point source at infinity

Published in:

Robotics and Automation, 1988. Proceedings., 1988 IEEE International Conference on

Date of Conference:

24-29 Apr 1988