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

Y. Sato; J. Ohya; K. Ishii

doi:10.1109/CVPR.1992.223197

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

Y. Sato, J. Ohya, K. Ishii

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Publisher	IEEE Computer Society
Pages	699-702
Number of pages	4
ISBN (Electronic)	0818628553
DOIs	https://doi.org/10.1109/CVPR.1992.223197
Publication status	Published - 1992
Externally published	Yes
Event	1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992 - Champaign, United States Duration: 1992 Jun 15 → 1992 Jun 18

Publication series

Name	Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Volume	1992-June
ISSN (Print)	1063-6919

Conference

Conference	1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992
Country/Territory	United States
City	Champaign
Period	92/6/15 → 92/6/18

ASJC Scopus subject areas

Software
Computer Vision and Pattern Recognition

Access to Document

10.1109/CVPR.1992.223197

Cite this

Sato, Y., Ohya, J., & Ishii, K. (1992). Recovery of hierarchical part structure of 3-D shape from range image. In Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 699-702). Article 223197 (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition; Vol. 1992-June). IEEE Computer Society. https://doi.org/10.1109/CVPR.1992.223197

Recovery of hierarchical part structure of 3-D shape from range image. / Sato, Y.; Ohya, J.; Ishii, K.
Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society, 1992. p. 699-702 223197 (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition; Vol. 1992-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sato, Y, Ohya, J & Ishii, K 1992, Recovery of hierarchical part structure of 3-D shape from range image. in Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition., 223197, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1992-June, IEEE Computer Society, pp. 699-702, 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992, Champaign, United States, 92/6/15. https://doi.org/10.1109/CVPR.1992.223197

Sato Y, Ohya J, Ishii K. Recovery of hierarchical part structure of 3-D shape from range image. In Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society. 1992. p. 699-702. 223197. (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition). doi: 10.1109/CVPR.1992.223197

@inproceedings{2b9cc6afc8104116937014d2c88640fc,

title = "Recovery of hierarchical part structure of 3-D shape from range image",

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.",

author = "Y. Sato and J. Ohya and K. Ishii",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992 ; Conference date: 15-06-1992 Through 18-06-1992",

year = "1992",

doi = "10.1109/CVPR.1992.223197",

language = "English",

series = "Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition",

publisher = "IEEE Computer Society",

pages = "699--702",

booktitle = "Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition",

}

TY - GEN

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

AU - Sato, Y.

AU - Ohya, J.

AU - Ishii, K.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027632340&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027632340&partnerID=8YFLogxK

U2 - 10.1109/CVPR.1992.223197

DO - 10.1109/CVPR.1992.223197

M3 - Conference contribution

AN - SCOPUS:85027632340

T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

SP - 699

EP - 702

BT - Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition

PB - IEEE Computer Society

T2 - 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992

Y2 - 15 June 1992 through 18 June 1992

ER -

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this