By Topic

Fast segmentation of range images into planar regions

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. Schmitt ; Ecole Nat. Superieure des Telecommun., Paris, France ; X. Chen

A split-and-merge algorithm is proposed for the segmentation of the digitized surface of a range image into planar regions. The geometric data structure used is a triangular tessellation of image domain. This data structure, combined with an adaptive surface approximation technique, allows a better adaptation of the range image segmentation to the surface boundaries. It also provides an efficient neighborhood referencing mechanism, thus resulting in a fast algorithm

Published in:

Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on

Date of Conference:

3-6 Jun 1991