DocumentCode :
2619246
Title :
Fast segmentation of range images into planar regions
Author :
Schmitt, Francis ; CHEN, Xin
Author_Institution :
Ecole Nat. Superieure des Telecommun., Paris, France
fYear :
1991
fDate :
3-6 Jun 1991
Firstpage :
710
Lastpage :
711
Abstract :
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
Keywords :
computational geometry; computerised pattern recognition; computerised picture processing; data structures; adaptive surface approximation technique; digitized surface; geometric data structure; image domain; neighborhood referencing mechanism; planar regions; range image segmentation; range images; split-and-merge algorithm; surface boundaries; triangular tessellation; Application software; Approximation algorithms; Approximation error; Computational efficiency; Computer errors; Computer vision; Data structures; Image segmentation; Merging; Q measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on
Conference_Location :
Maui, HI
ISSN :
1063-6919
Print_ISBN :
0-8186-2148-6
Type :
conf
DOI :
10.1109/CVPR.1991.139793
Filename :
139793
Link To Document :
بازگشت