Learning Self-Prior for Mesh Inpainting Using Self-Supervised Graph Convolutional Networks

被引:0
作者
Hattori, Shota [1 ]
Yatagawa, Tatsuya [2 ]
Ohtake, Yutaka [1 ]
Suzuki, Hiromasa [1 ]
机构
[1] Univ Tokyo, Sch Engn, Tokyo 1138656, Japan
[2] Hitotsubashi Univ, Sch Social Data Sci, Tokyo 1868601, Japan
关键词
Shape; Point cloud compression; Geometry; Three-dimensional displays; Convolutional neural networks; Surface treatment; Electronics packaging; Geometric deep learning; graph convolutional networks; mesh inpainting; self-supervised learning; RESTORATION; BOUNDARY;
D O I
10.1109/TVCG.2024.3364365
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this article, we present a self-prior-based mesh inpainting framework that requires only an incomplete mesh as input, without the need for any training datasets. Additionally, our method maintains the polygonal mesh format throughout the inpainting process without converting the shape format to an intermediate one, such as a voxel grid, a point cloud, or an implicit function, which are typically considered easier for deep neural networks to process. To achieve this goal, we introduce two graph convolutional networks (GCNs): single-resolution GCN (SGCN) and multi-resolution GCN (MGCN), both trained in a self-supervised manner. Our approach refines a watertight mesh obtained from the initial hole filling to generate a complete output mesh. Specifically, we train the GCNs to deform an oversmoothed version of the input mesh into the expected complete shape. The deformation is described by vertex displacements, and the GCNs are supervised to obtain accurate displacements at vertices in real holes. To this end, we specify several connected regions of the mesh as fake holes, thereby generating meshes with various sets of fake holes. The correct displacements of vertices are known in these fake holes, thus enabling training GCNs with loss functions that assess the accuracy of vertex displacements. We demonstrate that our method outperforms traditional dataset-independent approaches and exhibits greater robustness compared with other deep-learning-based methods for shapes that infrequently appear in shape datasets.
引用
收藏
页码:1448 / 1464
页数:17
相关论文
共 71 条
  • [1] Alliez P, 2003, SMI 2003: SHAPE MODELING INTERNATIONAL 2003, PROCEEDINGS, P49
  • [2] [Anonymous], 1998, HDB BRAIN THEORY NEU
  • [3] [Anonymous], 2005, The Stanford 3D scanning repository
  • [4] [Anonymous], 2006, AIM@SHAPE digital shape workbench
  • [5] [Anonymous], NIPS, P5099, DOI [10.48550/arXiv.1706.02413, DOI 10.1109/CVPR.2017.16]
  • [6] A lightweight approach to repairing digitized polygon meshes
    Attene, Marco
    [J]. VISUAL COMPUTER, 2010, 26 (11) : 1393 - 1406
  • [7] FILLING GAPS IN THE BOUNDARY OF A POLYHEDRON
    BAREQUET, G
    SHARIR, M
    [J]. COMPUTER AIDED GEOMETRIC DESIGN, 1995, 12 (02) : 207 - 229
  • [8] SemanticKITTI: A Dataset for Semantic Scene Understanding of LiDAR Sequences
    Behley, Jens
    Garbade, Martin
    Milioto, Andres
    Quenzel, Jan
    Behnke, Sven
    Stachniss, Cyrill
    Gall, Juergen
    [J]. 2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, : 9296 - 9306
  • [9] Image inpainting
    Bertalmio, M
    Sapiro, G
    Caselles, V
    Ballester, C
    [J]. SIGGRAPH 2000 CONFERENCE PROCEEDINGS, 2000, : 417 - 424
  • [10] Automatic restoration of polygon models
    Bischoff, S
    Pavic, D
    Kobbelt, L
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (04): : 1332 - 1352