Partial Matching of Deformable Shapes

Simple item page
dc.contributor.authorCosmo, L.en_US
dc.contributor.authorRodolĂ , E.en_US
dc.contributor.authorBronstein, M. M.en_US
dc.contributor.authorTorsello, A.en_US
dc.contributor.authorCremers, D.en_US
dc.contributor.authorSahillioglu, Y.en_US
dc.contributor.editorA. Ferreira and A. Giachetti and D. Giorgien_US
dc.date.accessioned2016-05-04T16:04:59Z
dc.date.available2016-05-04T16:04:59Z
dc.date.issued2016en_US
dc.description.abstractMatching 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.en_US
dc.description.sectionheadersSHREC'16 Tracksen_US
dc.description.seriesinformationEurographics Workshop on 3D Object Retrievalen_US
dc.identifier.doi10.2312/3dor.20161089en_US
dc.identifier.isbn978-3-03868-004-8en_US
dc.identifier.issn1997-0471en_US
dc.identifier.pages61-67en_US
dc.identifier.urihttps://doi.org/10.2312/3dor.20161089en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.subjectShape Analysisen_US
dc.titlePartial Matching of Deformable Shapesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
061-067.pdf
Size:
5.91 MB
Format:
Adobe Portable Document Format
Download
Collections
3DOR 16