English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Shape Analysis with Subspace Symmetries

Berner, A., Wand, M., Mitra, N. J., Mewes, D., & Seidel, H.-P. (2011). Shape Analysis with Subspace Symmetries. Computer Graphics Forum, 30(2), 277-286. doi:10.1111/j.1467-8659.2011.01859.x.

Item is

Files

show Files
hide Files
:
subspace_symmetry_eg11.pdf (Any fulltext), 19MB
 
File Permalink:
-
Name:
subspace_symmetry_eg11.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Berner, Alexander1, Author           
Wand, Michael1, Author           
Mitra, Niloy J.2, Author
Mewes, Daniel1, Author           
Seidel, Hans-Peter1, Author           
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 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. The detected subspace symmetries along with the modeled variations are useful for a variety of applications including shape completion, non-local and non-rigid denoising. 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.

Details

show
hide
Language(s): eng - English
 Dates: 2012-02-282011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 618857
DOI: 10.1111/j.1467-8659.2011.01859.x
URI: http://www.mpi-inf.mpg.de/%7Eaberner/subspace_symmetry_eg11.pdf
BibTex Citekey: Berner2011SubspaceSymmetry
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computer Graphics Forum
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : North Holland
Pages: - Volume / Issue: 30 (2) Sequence Number: - Start / End Page: 277 - 286 Identifier: ISSN: 0167-7055
CoNE: https://pure.mpg.de/cone/journals/resource/954925483671

Source 2

show
hide
Title: EUROGRAPHICS 2011
  Abbreviation : EUROGRAPHICS 2011
  Other : EG 2011
  Subtitle : The European Associatoin for Computer Graphics 32nd Annual Conference ; Llandudno in Wales, UK, April 11th - 15th, 2011
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -