Skip to Main content Skip to Navigation
Journal articles

Shape Matching via Quotient Spaces

Abstract : We 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Quentin Mérigot <>
Submitted on : Monday, February 17, 2014 - 2:15:23 PM
Last modification on : Friday, February 26, 2021 - 9:30:02 AM

Links full text




Maks Ovsjanikov, Quentin Mérigot, Viorica Pătrăucean, Leonidas J. Guibas. Shape Matching via Quotient Spaces. Computer Graphics Forum, Wiley, 2013, 32 (5), pp.1-11. ⟨10.1111/cgf.12167⟩. ⟨hal-00947802⟩



Record views