Shape analysis with subspace symmetries

Handle URI:
http://hdl.handle.net/10754/575800
Title:
Shape analysis with subspace symmetries
Authors:
Berner, Alexander; Wand, Michael D.; Mitra, Niloy J. ( 0000-0002-2597-0914 ) ; Mewes, Daniel; Seidel, Hans Peter
Abstract:
We 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. © 2010 The Author(s).
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Wiley-Blackwell
Journal:
Computer Graphics Forum
Conference/Event name:
32nd Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2011
Issue Date:
Apr-2011
DOI:
10.1111/j.1467-8659.2011.01859.x
Type:
Conference Paper
ISSN:
01677055
Sponsors:
This work has been partially funded by the Cluster of Excellence "Multi-Modal Computing and Interaction" and the IMPECS collaboration network. The authors wish to thank the anonymous reviewers for their valuable comments and Martin Bokeloh for discussions and his help with the implementation.
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorBerner, Alexanderen
dc.contributor.authorWand, Michael D.en
dc.contributor.authorMitra, Niloy J.en
dc.contributor.authorMewes, Danielen
dc.contributor.authorSeidel, Hans Peteren
dc.date.accessioned2015-08-24T09:26:31Zen
dc.date.available2015-08-24T09:26:31Zen
dc.date.issued2011-04en
dc.identifier.issn01677055en
dc.identifier.doi10.1111/j.1467-8659.2011.01859.xen
dc.identifier.urihttp://hdl.handle.net/10754/575800en
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. © 2010 The Author(s).en
dc.description.sponsorshipThis work has been partially funded by the Cluster of Excellence "Multi-Modal Computing and Interaction" and the IMPECS collaboration network. The authors wish to thank the anonymous reviewers for their valuable comments and Martin Bokeloh for discussions and his help with the implementation.en
dc.publisherWiley-Blackwellen
dc.titleShape analysis with subspace symmetriesen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalComputer Graphics Forumen
dc.conference.date11 April 2011 through 15 April 2011en
dc.conference.name32nd Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2011en
dc.conference.locationLlandudno, Walesen
dc.contributor.institutionMPI Informatik, Germanyen
dc.contributor.institutionSaarland University, Germanyen
kaust.authorMitra, Niloy J.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.