Shape Matching via Quotient Spaces

Simple item page
dc.contributor.authorOvsjanikov, Maksen_US
dc.contributor.authorMérigot, Quentinen_US
dc.contributor.authorPatraucean, Vioricaen_US
dc.contributor.authorGuibas, Leonidasen_US
dc.contributor.editorYaron Lipman and Hao Zhangen_US
dc.date.accessioned2015-02-28T15:50:27Z
dc.date.available2015-02-28T15:50:27Z
dc.date.issued2013en_US
dc.description.abstractWe introduce a novel method for non-rigid shape matching, designed to address the symmetric ambiguity problem present when matching shapes with intrinsic symmetries. Unlike the majority of existing methods which try to overcome this ambiguity by sampling a set of landmark correspondences, we address this problem directly by performing shape matching in an appropriate quotient space, where the symmetry has been identified and factored out. This allows us to both simplify the shape matching problem by matching between subspaces, and to return multiple solutions with equally good dense correspondences. Remarkably, both symmetry detection and shape matching are done without establishing any landmark correspondences between either points or parts of the shapes. This allows us to avoid an expensive combinatorial search present in most intrinsic symmetry detection and shape matching methods. We compare our technique with state-of-the-art methods and show that superior performance can be achieved both when the symmetry on each shape is known and when it needs to be estimated.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/cgf.12167en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12167en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.3.3 [Computer Graphics]en_US
dc.subjecten_US
dc.subjectShape Analysisen_US
dc.titleShape Matching via Quotient Spacesen_US
Files
Collections
32-Issue 5
SGP13: Eurographics Symposium on Geometry Processing (CGF 32-5)