Shape Analysis with Subspace Symmetries

Simple item page
dc.contributor.authorBerner, Alexanderen_US
dc.contributor.authorWand, Michaelen_US
dc.contributor.authorMitra, Niloy J.en_US
dc.contributor.authorMewes, Danielen_US
dc.contributor.authorSeidel, Hans-Peteren_US
dc.contributor.editorM. Chen and O. Deussenen_US
dc.date.accessioned2015-02-27T10:20:45Z
dc.date.available2015-02-27T10:20:45Z
dc.date.issued2011en_US
dc.description.abstractWe address the problem of partial symmetry detection, i.e., the identification of building blocks a complex shape is composed of. Previous techniques identify parts that relate to each other by simple rigid mappings, similarity transforms, or, more recently, intrinsic isometries. Our approach generalizes the notion of partial symmetries to more general deformations. We introduce subspace symmetries whereby we characterize similarity by requiring the set of symmetric parts to form a low dimensional shape space. We present an algorithm to discover subspace symmetries based on detecting linearly correlated correspondences among graphs of invariant features. We evaluate our technique on various data sets. We show that for models with pronounced surface features, subspace symmetries can be found fully automatically. For complicated cases, a small amount of user input is used to resolve ambiguities. Our technique computes dense correspondences that can subsequently be used in various applications, such as model repair and denoising.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2011.01859.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleShape Analysis with Subspace Symmetriesen_US
Files
Collections
30-Issue 2
Full Papers 2011 - CGF 30-Issue 2