Show simple item record

dc.contributor.authorKleiman, Yaniren_US
dc.contributor.authorOvsjanikov, Maksen_US
dc.contributor.editorChen, Min and Benes, Bedrichen_US
dc.date.accessioned2019-03-17T09:56:46Z
dc.date.available2019-03-17T09:56:46Z
dc.date.issued2019
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.13389
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13389
dc.description.abstractWe present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds. We demonstrate that the region‐wise matching that we obtain can be used to find correspondences between feature points, reveal the intrinsic self‐similarities of each shape and even construct point‐to‐point maps across shapes. Our method is both time and space efficient, leading to a pipeline that is significantly faster than comparable approaches. We demonstrate the performance of our approach through an extensive quantitative and qualitative evaluation on several benchmarks where we achieve comparable or superior performance to existing methods.We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds.en_US
dc.publisher© 2019 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subject3D shape matching
dc.subjectmodelling
dc.subjectdigital geometry processing
dc.subjectmodelling
dc.subjectI.3.5 [Computer Graphics]: Computational Geometry and Object Modelling Geometric algorithms
dc.titleRobust Structure‐Based Shape Correspondenceen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersArticles
dc.description.volume38
dc.description.number1
dc.identifier.doi10.1111/cgf.13389
dc.identifier.pages7-20


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record