Robust Structure‐Based Shape Correspondence
| dc.contributor.author | Kleiman, Yanir | en_US |
| dc.contributor.author | Ovsjanikov, Maks | en_US |
| dc.contributor.editor | Chen, Min and Benes, Bedrich | en_US |
| dc.date.accessioned | 2019-03-17T09:56:46Z | |
| dc.date.available | 2019-03-17T09:56:46Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | 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. 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.description.number | 1 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 38 | |
| dc.identifier.doi | 10.1111/cgf.13389 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 7-20 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13389 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13389 | |
| dc.publisher | © 2019 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | 3D shape matching | |
| dc.subject | modelling | |
| dc.subject | digital geometry processing | |
| dc.subject | modelling | |
| dc.subject | I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling Geometric algorithms | |
| dc.title | Robust Structure‐Based Shape Correspondence | en_US |