SHREC 16 Partial Matching of Deformable Shapes

Date

2016-06-15

Author

Cosmo, Luca
Rodola, Emanuele
Bronstein, Michael
Torsello, Andrea
Cremers, Daniel
Sahillioğlu, Yusuf

Metadata

Show full item record

Item Usage Stats

88
views

0
downloads

Matching deformable 3D shapes under partiality transformations is a challenging problem that has received limited focus in the computer vision and graphics communities. With this benchmark, we explore and thoroughly investigate the robustness of existing matching methods in this challenging task. Participants are asked to provide a point-to-point correspondence (either sparse or dense) between deformable shapes undergoing different kinds of partiality transformations, resulting in a total of 400 matching problems to be solved for each method – making this benchmark the biggest and most challenging of its kind. Five matching algorithms were evaluated in the contest; this paper presents the details of the dataset, the adopted evaluation measures, and shows thorough comparisons among all competing methods.

Subject Keywords

Computational Geometry and Object Modeling, Shape Analysis

URI

https://hdl.handle.net/11511/84266
https://dl.acm.org/doi/10.5555/3056462.3056476

Conference Name

3DOR '16: Proceedings of the Eurographics 2016 Workshop on 3D Object Retrieval (2016)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Partial matching of deformable shapes Cosmo, Luca; Rodola, Emanuele; Bronstein, Michael; Torsello, Andrea; Cremers, Daniel; Sahillioğlu, Yusuf (null; 2016-05-08) Matching deformable 3D shapes under partiality transformations is a challenging problem that has received limited focus in the computer vision and graphics communities. With this benchmark, we explore and thoroughly investigate the robustness of existing matching methods in this challenging task. Participants are asked to provide a point-to-point correspondence (either sparse or dense) between deformable shapes undergoing different kinds of partiality transformations, resulting in a total of 400 matchin...
SHREC 15 track non rigid 3D shape retrieval Lıan, Zz; Zhang, Z; S, Choı; Elnaghy, H El; Sana, J El; Furuya, T; Gıachettı, A; Güler, Alp; Laı, L; Lı, C; Lı, H; Lımberger, Fa; Martın, R; Nakanıshı, Ru; Neto, Ap; Nonato, Lg; Ohbuchı, Ro; Pevzner, Kp; Pıckup, David; et.al. (null; 2015-05-02) Non-rigid 3D shape retrieval has become a research hotpot in communities of computer graphics, computer vision, pattern recognition, etc. In this paper, we present the results of the SHREC’15 Track: Non-rigid 3D Shape Retrieval. The aim of this track is to provide a fair and effective platform to evaluate and compare the performance of current non-rigid 3D shape retrieval methods developed by different research groups around the world. The database utilized in this track consists of 1200 3D watertight trian...
Matching of deformable shapes with topological noise Lahner, Zorah; Rodola, Emanuele; Bronstein, Michael; Cremers, Daniel; Burghard, Oliver; Cosmo, Luca; Dieckmann, Alexander; Klein, Reinhard; Sahillioğlu, Yusuf (2016-05-08) A particularly challenging setting of the shape matching problem arises when the shapes being matched have topological artifacts due to the coalescence of spatially close surface regions - a scenario that frequently occurs when dealing with real data under suboptimal acquisition conditions. This track of the SHREC'16 contest evaluates shape matching algorithms that operate on 3D shapes under synthetically produced topological changes. The task is to produce a pointwise matching (either sparse or dense) betw...
Multi-baseline stereo correction for silhouette-based 3D model reconstruction from multiple images Mulayim, AY; Atalay, Mehmet Volkan (2001-01-25) Silhouette based reconstruction algorithm is simple and robust for 3D volume estimation of an object. However? it has two main drawbacks: insufficient number of viewing positions and the inability to detect concavity regions. Starting from an initial convex hull of the object to be modeled which is generated by a silhouette based reconstruction, an algorithm based on photoconsistency is described. The algorithm basically carves the excess volume elements using the multi-baseline stereo information. Result o...
Steganography through perspective invariance Yaşaroğlu, Yağız; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2012) A novel approach for watermarking of 3D models is introduced, for which data is embedded into 3D models, whereas extracted from their projected 2D visual or 2D-plus-depth representations. Such a watermarking system is valuable, since most of the 3D content is being consumed as 2D visual data. Apart from the efficiency of embedding data into 3D models before generation of arbitrary 2D projections, in some use cases, such as free viewpoint video or computer games, 2D content has to be rendered at the client, ...

Citation Formats

L. Cosmo, E. Rodola, M. Bronstein, A. Torsello, D. Cremers, and Y. Sahillioğlu, “SHREC 16 Partial Matching of Deformable Shapes,” Goslar, Germany, 2016, p. 61, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/84266.