no code implementations • 18 Apr 2024 • Viktoria Ehm, Maolin Gao, Paul Roetzer, Marvin Eisenberger, Daniel Cremers, Florian Bernard
Further, we generate a new inter-class dataset for partial-to-partial shape-matching.
no code implementations • 10 Sep 2023 • Viktoria Ehm, Paul Roetzer, Marvin Eisenberger, Maolin Gao, Florian Bernard, Daniel Cremers
Moreover, while in practice one often has only access to partial observations of a 3D shape (e. g. due to occlusion, or scanning artifacts), there do not exist any methods that directly address geometrically consistent partial shape matching.
no code implementations • 15 May 2023 • Viktoria Ehm, Daniel Cremers, Florian Bernard
Flows in networks (or graphs) play a significant role in numerous computer vision tasks.
1 code implementation • 8 Dec 2021 • Viktoria Ehm, Daniel Cremers, Florian Bernard
Traditionally, the concept of a shortest path is considered for graphs with scalar edge weights, which makes it possible to compute the length of a path by adding up the individual edge weights.