Recovery of hierarchical part structure of 3-D shape from range image

Author

Sato, Yoshinobu ; Ohya, Jun ; Ishii, Kenichiro

Author_Institution

NTT Human Interface Labs., Kanagawa, Japan

fYear

1992

fDate

15-18 Jun 1992

Firstpage

699

Lastpage

702

Abstract

A formulation of the part decomposition problem motived by the minimum-description-length (MDL) criteria is presented. Unlike previous MDL approaches which use analytic functions, a general geometric constraint, convexity, is used as a part constraint. Therefore, the method is suitable for complex natural shapes such as human faces. The recovery process consists of a bottom-up grouping process and a subsequent optimization process based on the MDL criteria. The definite causal relations of part structure between different sensitivity levels are used to recover the hierarchy of part structure. Part decomposition experiments involving real 3-D range images are reported

Keywords

computer vision; image segmentation; optimisation; 3-D range images; 3-D shape; bottom-up grouping; causal relations; complex natural shapes; convexity; geometric constraint; hierarchical part structure; human faces; minimum-description-length; optimization; part constraint; part decomposition problem; sensitivity levels; Computer vision; Educational institutions; Geometry; Greedy algorithms; Humans; Image segmentation; Noise shaping; Optimization methods; Shape; Solid modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92., 1992 IEEE Computer Society Conference on

Conference_Location

Champaign, IL

ISSN

1063-6919

Print_ISBN

0-8186-2855-3

Type

conf

DOI

10.1109/CVPR.1992.223197

Filename

223197