Unsupervised 3D shape segmentation and co-segmentation via deep learning

被引:79
作者
Shu, Zhenyu [1 ]
Qi, Chengwu [2 ]
Xin, Shiqing [1 ,3 ]
Hu, Chao [1 ]
Wang, Li [1 ]
Zhang, Yu [1 ]
Liu, Ligang [4 ]
机构
[1] Zhejiang Univ, Ningbo Inst Technol, Sch Informat Sci & Engn, Ningbo 315100, Zhejiang, Peoples R China
[2] Taiyuan Univ Sci & Technol, Sch Elect Informat Engn, Taiyuan 030024, Peoples R China
[3] Ningbo Univ, Sch Informat Sci & Engn, Ningbo 315211, Zhejiang, Peoples R China
[4] Univ Sci & Technol China, Graph & Geometr Comp Lab, Sch Math Sci, Hefei 230026, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
3D shapes; Segmentation; Co-segmentation; Deep learning; High-level features; MESH SEGMENTATION; CUTS;
D O I
10.1016/j.cagd.2016.02.015
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we propose a novel unsupervised algorithm for automatically segmenting a single 3D shape or co-segmenting a family of 3D shapes using deep learning. The algorithm consists of three stages. In the first stage, we pre-decompose each 3D shape of interest into primitive patches to generate over-segmentation and compute various signatures as low-level shape features. In the second stage, high-level features are learned, in an unsupervised style, from the low-level ones based on deep learning. Finally, either segmentation or co-segmentation results can be quickly reported by patch clustering in the high-level feature space. The experimental results on the Princeton Segmentation Benchmark and the Shape COSEG Dataset exhibit superior segmentation performance of the proposed method over the previous state-of-the-art approaches. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:39 / 52
页数:14
相关论文
共 45 条
[1]  
[Anonymous], 2015, ARXIV150400641
[2]  
Attene M, 2006, IEEE INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS 2006, PROCEEDINGS, P14
[3]   Mesh Segmentation with Concavity-Aware Fields [J].
Au, Oscar Kin-Chung ;
Zheng, Youyi ;
Chen, Menglin ;
Xu, Pengfei ;
Tai, Chiew-Lan .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2012, 18 (07) :1125-1134
[4]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[5]   Scale-invariant heat kernel signatures for non-rigid shape recognition [J].
Bronstein, Michael M. ;
Kokkinos, Iasonas .
2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, :1704-1711
[6]   A Benchmark for 3D Mesh Segmentation [J].
Chen, Xiaobai ;
Golovinskiy, Aleksey ;
Funkhouser, Thomas .
ACM TRANSACTIONS ON GRAPHICS, 2009, 28 (03)
[7]   Overfitting and undercomputing in machine learning [J].
Dietterich, T .
ACM COMPUTING SURVEYS, 1995, 27 (03) :326-327
[8]   Salient geometric features for partial shape matching and similarity [J].
Gal, R ;
Cohen-Or, D .
ACM TRANSACTIONS ON GRAPHICS, 2006, 25 (01) :130-150
[9]   Curvature maps for local shape comparison [J].
Gatzke, T ;
Grimm, C ;
Garland, M ;
Zelinka, S .
INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDINGS, 2005, :244-253
[10]   Consistent segmentation of 3D models [J].
Golovinskiy, Aleksey ;
Funkhouser, Thomas .
COMPUTERS & GRAPHICS-UK, 2009, 33 (03) :262-269