Show simple item record

dc.contributor.authorSahillioÄ lu, Y.en_US
dc.contributor.authorYemez, Y.en_US
dc.contributor.editorHolly Rushmeier and Oliver Deussenen_US
dc.date.accessioned2015-02-28T15:16:49Z
dc.date.available2015-02-28T15:16:49Z
dc.date.issued2013en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12007en_US
dc.description.abstractWe address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting dense correspondence algorithm with state-of-the-art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance-wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence. Our key idea of tracking symmetric flips can be considered as a meta-approach that can be applied to other multi-resolution shape matching algorithms, as we also demonstrate by experiments.We address the symmetric flip problem that is inherent to multiresolution isometric shape matching algorithms.To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting dense correspondence algorithm with state-of-the-art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance-wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence.en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subject3D Shape Correspondenceâ ''Coarseen_US
dc.subjecttoen_US
dc.subjectfine samplingen_US
dc.subjectcombinatorial matchingen_US
dc.subjectisometric dense shape correspondenceen_US
dc.subjectsymmetric flipsen_US
dc.subjectcombinatorial matchingen_US
dc.subjectisometric dense shape correspondenceen_US
dc.subjectsymmetric flipsen_US
dc.titleCoarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flipsen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume32
dc.description.number1


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record