paper-with-me

홈 › Papers

3D Oral Modelling with Improved Vertex Distribution Using Matching-Based Learning

2026-06-06 · Jihun Cho, Soo-Yeon Jeong, Eun-Jeong Bae, Sun-Young Ihm arxiv

In our previous work, a deep learning-based framework for 3D intraoral reconstruction was proposed. The model directly predicts explicit 3D point cloud coordinates from ten fixed-angle intraoral images, employing MobileNetV2 and Multi-head Attention for multi-view feature fusion, with a combined L1 Loss and Chamfer Distance as the loss function. Although the model achieved an accuracy of 77.49%, predicted vertices tended to concentrate in high-density regions of the ground truth, leaving other regions largely uncovered. In this paper, an improved loss function is proposed to address this limitation. Hungarian matching with filtering and Repulsion Loss are introduced to enforce more uniform vertex distribution across the reconstructed model. The proposed model achieves an accuracy of 68.02%, which is numerically lower than the previous model. However, the vertex clustering issue observed in the prior work is substantially alleviated, with predicted vertices distributed more evenly across the entire reconstructed surface.

📄 PDF Abstract BibTeX arXiv:2606.07907

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Random Graph Matching with Improved Noise Robustness

2021-01-28 · Cheng Mao, Mark Rudelson, Konstantin Tikhomirov

Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in…

Graph Matching

The Power of $D$-hops in Matching Power-Law Graphs

2021-02-23 · Liren Yu, Jiaming Xu, Xiaojun Lin

This paper studies seeded graph matching for power-law graphs. Assume that two edge-correlated graphs are independently edge-sampled from a common parent graph with a power-law degree distribution. A set of correctly mat…

Graph Matching

Efficient random graph matching via degree profiles

2018-11-19 · Jian Ding, Zongming Ma, Yihong Wu, Jiaming Xu

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $…

Graph Matching

Kernelized multi-graph matching

2022-10-11 · François-Xavier Dupé, Rohit Yadav, Guillaume Auzias, S. Takerkart

Multigraph matching is a recent variant of the graph matching problem. In this framework, the optimization procedure considers several graphs and enforces the consistency of the matches along the graphs. This constraint …

Graph Matching

Clustered Graph Matching for Label Recovery and Graph Classification

2022-05-06 · Zhirui Li, Jesus Arroyo, Konstantinos Pantazis, Vince Lyzinski

Given a collection of vertex-aligned networks and an additional label-shuffled network, we propose procedures for leveraging the signal in the vertex-aligned collection to recover the labels of the shuffled network. We c…

ClassificationGraph ClassificationGraph Matching