8 papers
Teaching DINOv3 About Partial 3D Geometry: A Self-Supervised Geometry-Aware Approach
Viktoria Ehm, Dongliang Cao, Riccardo Marin +4
Partial shape matching is a crucial yet underexplored problem in 3D vision, with significant relevance to real-world scenarios where shapes are often only partially observed. Exist…
Non-Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities
Aleksei Zhuravlev, Lennart Bastian, Dongliang Cao +12
Estimating correspondences between deformed shape instances is a long-standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling,…
An Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching
Viktoria Ehm, Paul Roetzer, Florian Bernard +1
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape m…
Beyond Complete Shapes: A Benchmark for Quantitative Evaluation of 3D Shape Surface Matching Algorithms
Viktoria Ehm, Nafie El Amrani, Yizheng Xie +9
Finding correspondences between 3D deformable shapes is an important and long-standing problem in geometry processing, computer vision, graphics, and beyond. While various shape ma…
Partial-to-Partial Shape Matching with Geometric Consistency
Viktoria Ehm, Maolin Gao, Paul Roetzer +3
Finding correspondences between 3D shapes is an important and long-standing problem in computer vision, graphics and beyond. A prominent challenge are partial-to-partial shape matc…
Geometrically Consistent Partial Shape Matching
Viktoria Ehm, Paul Roetzer, Marvin Eisenberger +3
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or…
Non-Separable Multi-Dimensional Network Flows for Visual Computing
Viktoria Ehm, Daniel Cremers, Florian Bernard
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to…
Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis
Viktoria Ehm, Daniel Cremers, Florian Bernard
Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic di…