Beyond Complete Shapes: A Benchmark for Quantitative Evaluation of 3D Shape Surface Matching Algorithms
MCML Authors
Daniel Cremers
Prof. Dr.
Director
Abstract
Daniel Cremers
Prof. Dr.
Director
Abstract
Finding correspondences between 3D deformable shapes is an important and long-standing problem in geometry processing, computer vision, graphics, and beyond. While various shape matching datasets exist, they are mostly static or limited in size, restricting their adaptation to different problem settings, including both full and partial shape matching. In particular the existing partial shape matching datasets are small (fewer than 100 shapes) and thus unsuitable for data-hungry machine learning approaches. Moreover, the type of partiality present in existing datasets is often artificial and far from realistic. To address these limitations, we introduce a generic and flexible framework for the procedural generation of challenging full and partial shape matching datasets. Our framework allows the propagation of custom annotations across shapes, making it useful for various applications. By utilising our framework and manually creating cross-dataset correspondences between seven existing (complete geometry) shape matching datasets, we propose a new large benchmark BeCoS with a total of 2543 shapes. Based on this, we offer several challenging benchmark settings, covering both full and partial matching, for which we evaluate respective state-of-the-art methods as baselines.
inproceedings
SGP 2025
Symposium on Geometry Processing. Bilbao, Spain, Jun 30-Jul 04, 2025.Authors
V. Ehm • N. El Amrani • Y. Xie • L. Bastian • M. Gao • W. Wang • L. Sang • D. Cao • Z. Lähner • D. Cremers • F. BernardLinks
DOI GitHubIn Collaboration
Research Areas
BibTeXKey: EEX+25