research-article

Shape Segmentation by Approximate Convexity Analysis

Authors:

Oliver Van Kaick,

Daniel Cohen-ORAuthors Info & Claims

ACM Transactions on Graphics (TOG), Volume 34, Issue 1

Article No.: 4, Pages 1 - 11

https://doi.org/10.1145/2611811

Published: 29 December 2014 Publication History

Abstract

We present a shape segmentation method for complete and incomplete shapes. The key idea is to directly optimize the decomposition based on a characterization of the expected geometry of a part in a shape. Rather than setting the number of parts in advance, we search for the smallest number of parts that admit the geometric characterization of the parts. The segmentation is based on an intermediate-level analysis, where first the shape is decomposed into approximate convex components, which are then merged into consistent parts based on a nonlocal geometric signature. Our method is designed to handle incomplete shapes, represented by point clouds. We show segmentation results on shapes acquired by a range scanner, and an analysis of the robustness of our method to missing regions. Moreover, our method yields results that are comparable to state-of-the-art techniques evaluated on complete shapes.

Supplementary Material

MP4 File (a4.mp4)

Download
14.44 MB

References

[1]

D. Anguelov, B. Taskarf, V. Chatalbashev, D. Koller, D. Gupta, G. Heitz, and A. Ng. 2005. Discriminative learning of markov random fields for segmentation of 3D scan data. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR'05). Vol. 2. 169--176.

Digital Library

[2]

S. Asafi, A. Goren, and D. Cohen-Or. 2013. Weak convex decomposition by lines-of-sight. Comput. Graph. Forum 32, 5, 23--31.

Digital Library

[3]

M. Attene, S. Katz, M. Mortara, G. Patane, M. Spagnuolo, and A. Tal. 2006. Mesh segmentation -- A comparative study. In Proceedings of the Shape Modeling International Conference (SMI'06).

Digital Library

[4]

M. Attene, M. Mortara, M. Spagnuolo, and B. Falcidieno. 2008. Hierarchical convex approximation of 3D shapes for fast region selection. Comput. Graph. Forum 27, 5, 1323--1332.

Digital Library

[5]

M. Attene and G. Patane. 2010. Hierarchical structure recovery of point-sampled surfaces. Comput. Graph. Forum 29, 6, 1905--1920.

[6]

O.-C. Au, Y. Zheng, M. Chen, P. Xu, and C.-L. Tai. 2012. Mesh segmentation with concavity-aware fields. IEEE Trans. Vis. Comput. Graph. 18, 7, 1125--1134.

Digital Library

[7]

X. Chen, A. Golovinskiy, and T. Funkhouser 2009. A benchmark for 3D mesh segmentation. ACM Trans. Graph. 28, 3, 73:1--73:12.

Digital Library

[8]

R. Gal, A. Shamir, T. Hassner, M. Pauly, and D. Cohen-Or. 2007. Surface reconstruction using local shape priors. In Proceedings of the Symposium on Geometry Processing (SGP'07). 253--262.

Digital Library

[9]

A. Golovinskiy and T. Funkhouser. 2008. Randomized cuts for 3D mesh analysis. ACM Trans. Graph. 27, 5, 145:1--145:12.

Digital Library

[10]

A. Golovinskiy and T. Funkhouser. 2009. Min-cut based segmentation of point clouds. In Proceedings of the IEEE Workshop on Search in 3D and Video (S3DV) at International Conference on Computer Vision (ICCV'09).

[11]

D. D. Hoffman and W. A. Richards. 1984. Parts of recognition. Cogn. 18, 1--3, 65--96.

[12]

R. Hu, L. Fan, and L. Liu. 2012. Co-segmentation of 3D shapes via subspace clustering. Comput. Graph. Forum 31, 5, 1703--1713.

Digital Library

[13]

Q. Huang, V. Koltun, and L. Guibas. 2011. Joint shape segmentation with linear programming. ACM Trans. Graph. 30, 6, 125:1--125:12.

Digital Library

[14]

E. Kalogerakis, A. Hertzmann, and K. Singh. 2010. Learning 3D mesh segmentation and labeling. ACM Trans. Graph. 29, 3, 102:1--102:12.

Digital Library

[15]

Y. M. Kim, N. J. Mitra, D.-M. Yan, and L. Guibas. 2012. Acquiring 3D indoor environments with variability and repetition. ACM Trans. Graph. 31, 6, 138:1--138:11.

Digital Library

[16]

H. S. Koppula, A. Anand, T. Joachims, and A. Saxena. 2011. Semantic labeling of 3D point clouds for indoor scenes. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS'11).

[17]

V. Kraevoy, D. Julius, and A. Sheffer. 2007. Model composition from interchangeable components. In Proceedings of the Pacific Graphics Conference. 129--138.

Digital Library

[18]

F. Lafarge and P. Alliez. 2013. Surface reconstruction through point set structuring. Comput. Graph. Forum 32, 2, 225--234.

[19]

Y. Li, X. Wu, Y. Chrysathou, A. Sharf, D. Cohen-Or, and N. J. Mitra. 2011. Globfit: Consistently fitting primitives by discovering global relations. ACM Trans. Graph. 30, 4, 52:1--52:12.

Digital Library

[20]

J. Lien and N. Amato. 2007. Approximate convex decomposition of polyhedra. In Proceedings of the ACM Symposium on Solid and Physical Modeling. 121--131.

Digital Library

[21]

R. Liu, H. Zhang, A. Shamir, and D. Cohen-Or. 2009. A part-aware surface metric for shape analysis. Comput. Graph. Forum 28, 2, 397--406.

[22]

L. Lu, Y.-K. Choi, W. Wang, and M.-S. Kim. 2007. Variational 3D shape segmentation for bounding volume computation. Comput. Graph. Forum 26, 3, 329--338.

[23]

M. Meng, J. Xia, J. Lou, and Y. He. 2013. Unsupervised co-segmentation for 3D shapes using iterative multi-label optimization. Comput. Aid. Des. 45, 2, 312--320.

Digital Library

[24]

L. Nan, K. Xie, and A. Sharf. 2012. A search-classify approach for cluttered indoor scene understanding. ACM Trans. Graph. 31, 6, 137:1--137:10.

Digital Library

[25]

Z. Ren, J. Yuan, C. Li, and W. Liu. 2011. Minimum near-convex decomposition for robust shape representation. In Proceedings of the International Conference on Computer Vision (ICCV'11). 303--310.

Digital Library

[26]

R. Schnabel, P. Degener, and R. Klein. 2009. Completion and reconstruction with primitive shapes. Comput. Graph. Forum 28, 2, 503--512.

[27]

A. Shamir. 2008. A survey on mesh segmentation techniques. Comput. Graph. Forum 27, 6, 1539--1556.

[28]

T. Shao, W. Xu, K. Zhou, J. Wang, D. Li, and B. Guo. 2012. An interactive approach to semantic modeling of indoor scenes with an RGBD camera. ACM Trans. Graph. 31, 6, 136:1--136:11.

Digital Library

[29]

L. Shapira, A. Shamir, and D. Cohen-Or. 2008. Consistent mesh partitioning and skeletonization using the shape diameter function. The Vis. Comput. 24, 4, 249--259.

Digital Library

[30]

J. Shotton, A. Fitzgibbon, M. Cook, T. Sharp, M. Finocchio, R. Moore, A. Kipman, and A. Blake. 2011. Real-time human pose recognition in parts from a single depth image. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR'11). 1297--1304.

Digital Library

[31]

O. Sidi, O. van Kaick, Y. Kleiman, H. Zhang, and D. Cohen-Or. 2011. Unsupervised co-segmentation of a set of shapes via descriptor-space spectral clustering. ACM Trans. Graph. 30, 6, 126:1--126:10.

Digital Library

[32]

P. Simari, D. Nowrouzezahrai, E. Kalogerakis, and K. Singh. 2009. Multi-objective shape segmentation and labeling. Comput. Graph. Forum 28, 5, 1415--1425.

Digital Library

[33]

J.-M. Thiery, E. Guy, and T. Boubekeur. 2013. Sphere-meshes: Shape approximation using spherical quadric error metrics. ACM Trans. Graph. 32, 6, 178:1--178:12.

Digital Library

[34]

X. Xiong, D. Munoz, J. Bagnell, and M. Hebert. 2011. 3-D scene analysis via sequenced predictions over points and regions. In Proceedings of the IEEE Robotics and Automation Conference (ICRA'11). 2609--2616.

[35]

J. Zhang, J. Zheng, C. Wu, and J. Cai. 2012. Variational mesh decomposition. ACM Trans. Graph. 31, 3, 21:1--21:14.

Digital Library

Cited By

Li LFu WZhang BYang YGe YShen C(2025)Branch segmentation and phenotype extraction of apple trees based on improved Laplace algorithmComputers and Electronics in Agriculture10.1016/j.compag.2025.109998232(109998)Online publication date: May-2025
https://doi.org/10.1016/j.compag.2025.109998
Liu ALin CLiu YLong XDou ZGuo HLuo PWang W(2024)Part123: Part-aware 3D Reconstruction from a Single-view ImageACM SIGGRAPH 2024 Conference Papers10.1145/3641519.3657482(1-12)Online publication date: 13-Jul-2024
https://dl.acm.org/doi/10.1145/3641519.3657482
Shu ZWu TShen JXin SLiu L(2024)Semi-Supervised 3D Shape Segmentation via Self RefiningIEEE Transactions on Image Processing10.1109/TIP.2024.337420033(2044-2057)Online publication date: 12-Mar-2024
https://dl.acm.org/doi/10.1109/TIP.2024.3374200
Show More Cited By

Recommendations

Hierarchical part-type segmentation using voxel-based curve skeletons

We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of critical points on the efficiently computed curve skeleton, either fully automatically as the junctions ...
Joint shape segmentation with linear programming

We present an approach to segmenting shapes in a heterogenous shape database. Our approach segments the shapes jointly, utilizing features from multiple shapes to improve the segmentation of each. The approach is entirely unsupervised and is based on an ...
Joint shape segmentation with linear programming
SA '11: Proceedings of the 2011 SIGGRAPH Asia Conference

We present an approach to segmenting shapes in a heterogenous shape database. Our approach segments the shapes jointly, utilizing features from multiple shapes to improve the segmentation of each. The approach is entirely unsupervised and is based on an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics

ACM Transactions on Graphics Volume 34, Issue 1

November 2014

153 pages

ISSN:0730-0301

EISSN:1557-7368

DOI:10.1145/2702692

Editor:
Julie Dorsey
Yale University

Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 December 2014

Accepted: 01 April 2014

Revised: 01 April 2014

Received: 01 October 2013

Published in TOG Volume 34, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

81
Total Citations
View Citations
1,178
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)3

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li LFu WZhang BYang YGe YShen C(2025)Branch segmentation and phenotype extraction of apple trees based on improved Laplace algorithmComputers and Electronics in Agriculture10.1016/j.compag.2025.109998232(109998)Online publication date: May-2025
https://doi.org/10.1016/j.compag.2025.109998
Liu ALin CLiu YLong XDou ZGuo HLuo PWang W(2024)Part123: Part-aware 3D Reconstruction from a Single-view ImageACM SIGGRAPH 2024 Conference Papers10.1145/3641519.3657482(1-12)Online publication date: 13-Jul-2024
https://dl.acm.org/doi/10.1145/3641519.3657482
Shu ZWu TShen JXin SLiu L(2024)Semi-Supervised 3D Shape Segmentation via Self RefiningIEEE Transactions on Image Processing10.1109/TIP.2024.337420033(2044-2057)Online publication date: 12-Mar-2024
https://dl.acm.org/doi/10.1109/TIP.2024.3374200
Shu ZSun XPang CXin S(2024)3D Shape Segmentation via Attentive Nonuniform DownsamplingIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2024.343209534:12_Part_1(12184-12196)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1109/TCSVT.2024.3432095
Park CSung M(2024)Split, Merge, and Refine: Fitting Tight Bounding Boxes via Over-Segmentation and Iterative Search2024 International Conference on 3D Vision (3DV)10.1109/3DV62453.2024.00146(1468-1477)Online publication date: 18-Mar-2024
https://doi.org/10.1109/3DV62453.2024.00146
Xue YWang WSong Q(2024)Variational sparse diffusion and its application in mesh processingEngineering Computations10.1108/EC-07-2023-039041:2(289-306)Online publication date: 4-Mar-2024
https://doi.org/10.1108/EC-07-2023-0390
Zhang SXie WWang CZhang S(2024)ScenePalette: Contextually Exploring Object Collections Through Multiplex Relations in 3D ScenesJournal of Computer Science and Technology10.1007/s11390-022-2194-639:5(1180-1192)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s11390-022-2194-6
Sulaiman Gezawa AWang QChiroma HLei Y(2023)A Deep Learning Approach to Mesh SegmentationComputer Modeling in Engineering & Sciences10.32604/cmes.2022.021351135:2(1745-1763)Online publication date: 2023
https://doi.org/10.32604/cmes.2022.021351
Kim JMo KSung MWoo W(2023)Seg&Struct: The Interplay Between Part Segmentation and Structure Inference for 3D Shape Parsing2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)10.1109/WACV56688.2023.00128(1226-1235)Online publication date: Jan-2023
https://doi.org/10.1109/WACV56688.2023.00128
Wang RXue YSurianarayanan BTian DFeng C(2023)Concavity-Induced Distance for Unoriented Point Cloud DecompositionIEEE Robotics and Automation Letters10.1109/LRA.2023.32883758:8(4807-4814)Online publication date: Aug-2023
https://doi.org/10.1109/LRA.2023.3288375
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents