CUED Publications database

Shape matching via quotient spaces

Ovsjanikov, M and Mérigot, Q and Pǎtrǎucean, V and Guibas, L (2013) Shape matching via quotient spaces. Computer Graphics Forum, 32. pp. 1-11. ISSN 0167-7055

Full text not available from this repository.


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. © 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.

Item Type: Article
Divisions: Div D > Construction Engineering
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:34
Last Modified: 23 Nov 2017 04:16