ML Anthology

Recovery of Hierarchical Part Structure of 3-D Shape from Range Image

Yoshinobu Sato, Jun Ohya, Kenichiro Ishii
CVPR 1992 pp. 699-702
doi:10.1109/CVPR.1992.223197 /cvpr/1992/sato1992cvpr-recovery/

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

CVPR Semantic Scholar

Cite

Text

Sato et al. "Recovery of Hierarchical Part Structure of 3-D Shape from Range Image." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223197

Markdown

[Sato et al. "Recovery of Hierarchical Part Structure of 3-D Shape from Range Image." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/sato1992cvpr-recovery/) doi:10.1109/CVPR.1992.223197

BibTeX

@inproceedings{sato1992cvpr-recovery,
  title     = {{Recovery of Hierarchical Part Structure of 3-D Shape from Range Image}},
  author    = {Sato, Yoshinobu and Ohya, Jun and Ishii, Kenichiro},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1992},
  pages     = {699-702},
  doi       = {10.1109/CVPR.1992.223197},
  url       = {https://mlanthology.org/cvpr/1992/sato1992cvpr-recovery/}
}