arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.13030cs.CV
收藏

无零件标注的三维零件细粒度分割学习

Learning Fine-Grained Segmentation of 3D Shapes without Part Labels

Southwest University(西南大学);State Key Laboratory of Virtual Reality Technology and Systems, Beihang University(北京航空航天大学虚拟现实技术与系统国家重点实验室);National University of Defense Technology(国防科技大学)

Xiaogang Wang, Xun Sun, Xinyu Cao, Kai Xu, Bin Zhou

摘要:

基于学习的3D形状分割通常被公式化为语义标记问题,假设训练形状的所有部分都用给定的标签集进行注释。然而,这种假设对于学习细粒度分割是不切实际的。虽然大多数现成的CAD模型在构造上都是由细粒度的部分组成的,但它们通常会丢失语义标记,并且标记这些细粒度的部分是非常繁琐的。我们使用深度聚类来解决这个问题,其中的关键思想是从具有细粒度分割但没有部分标签的形状数据集中学习部分先验。给定采样点的三维形状,我们建立了一个相似性矩阵的点的聚类先验模型,并通过最小化一个新的低秩损失实现部分分割。为了处理高密度采样点集,我们采用了分而治之的策略。我们将大的点集划分为若干块。每个块使用以类别不可知的方式训练的基于深度聚类的部分先验网络进行分割。然后我们训练一个图卷积网络来合并所有块的片段以形成最终的分割结果。我们的方法进行评估具有挑战性的基准细粒度分割,显示国家的最先进的性能。

英文摘要:

Learning-based 3D shape segmentation is usually formulated as a semantic labeling problem, assuming that all parts of training shapes are annotated with a given set of tags. This assumption, however, is impractical for learning fine-grained segmentation. Although most off-the-shelf CAD models are, by construction, composed of fine-grained parts, they usually miss semantic tags and labeling those fine-grained parts is extremely tedious. We approach the problem with deep clustering, where the key idea is to learn part priors from a shape dataset with fine-grained segmentation but no part labels. Given point sampled 3D shapes, we model the clustering priors of points with a similarity matrix and achieve part segmentation through minimizing a novel low rank loss. To handle highly densely sampled point sets, we adopt a divide-and-conquer strategy. We partition the large point set into a number of blocks. Each block is segmented using a deep-clustering-based part prior network trained in a category-agnostic manner. We then train a graph convolution network to merge the segments of all blocks to form the final segmentation result. Our method is evaluated with a challenging benchmark of fine-grained segmentation, showing state-of-the-art performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑