Label-Efficient Learning on Point Clouds using Approximate Convex Decompositions
Label-Efficient Learning on Point Clouds using Approximate Convex Decompositions
复制标题
DOI:
10.1007/978-3-030-58607-2_28
复制
发表时间:
2020-03
期刊:
影响因子:
--
通讯作者:
Matheus Gadelha;Aruni RoyChowdhury;Gopal Sharma;E. Kalogerakis;Liangliang Cao;E. Learned-Miller;Rui Wang;Subhransu Maji
中科院分区:
文献类型:
--
作者:
Matheus Gadelha;Aruni RoyChowdhury;Gopal Sharma;E. Kalogerakis;Liangliang Cao;E. Learned-Miller;Rui Wang;Subhransu Maji
The problems of shape classification and part segmentation from 3D point clouds have garnered increasing attention in the last few years. Both of these problems, however, suffer from relatively small training sets, creating the need for statistically efficient methods to learn 3D shape representations. In this paper, we investigate the use of Approximate Convex Decompositions (ACD) as a self-supervisory signal for label-efficient learning of point cloud representations. We show that using ACD to approximate ground truth segmentation provides excellent self-supervision for learning 3D point cloud representations that are highly effective on downstream tasks. We report improvements over the state-of-the-art for unsupervised representation learning on the ModelNet40 shape classification dataset and significant gains in few-shot part segmentation on the ShapeNetPart dataset. Our source code is publicly available ( https://github.com/matheusgadelha/PointCloudLearningACD ).