CageR: Cage-Based Reverse Engineering of Animated 3D Shapes

We present CageR: A novel framework for converting animated 3D shape sequences into compact and stable cage‐based representations. Given a raw animated sequence with one‐to‐one point correspondences together with an initial cage embedding, our algorithm automatically generates smoothly varying cage...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 31; no. 8; pp. 2303 - 2316
Main Authors: Thiery, Jean-Marc, Tierny, Julien, Boubekeur, Tamy
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.12.2012
Wiley
Subjects:
3-D graphics
Algorithms
Analysis
Animated
animated 3D mesh
Cage
cage coordinates
CageR
Computational Geometry
Computer graphics
Computer Science
Deformation
Graphics
I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling Geometric algorithms
I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling Geometric algorithms, languages and systems
Image processing systems
Inversions
languages and systems
linear algebra
maxvol
Regularization
Representations
reverse engineering
spectral analysis
Studies
Three dimensional
Computer Graphics
Deformation
Shape Modeling
Animated Data
Shape Analysis
4D Data
Computer Animation
Space Coordinates
Optimization
Performance Capture
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present CageR: A novel framework for converting animated 3D shape sequences into compact and stable cage‐based representations. Given a raw animated sequence with one‐to‐one point correspondences together with an initial cage embedding, our algorithm automatically generates smoothly varying cage embeddings which faithfully reconstruct the enclosed object deformation. Our technique is fast, automatic, oblivious to the cage coordinate system, provides controllable error and exploits a GPU implementation. At the core of our method, we introduce a new algebraic algorithm based on maximum volume sub‐matrices (maxvol) to speed up and stabilize the deformation inversion. We also present a new spectral regularization algorithm that can apply arbitrary regularization terms on selected subparts of the inversion spectrum. This step allows to enforce a highly localized cage regularization, guaranteeing its smooth variation along the sequence. We demonstrate the speed, accuracy and robustness of our framework on various synthetic and acquired data sets. The benefits of our approach are illustrated in applications such as animation compression and post‐editing. We present a novel framework for converting animated 3D shape sequences into compact and stable cage‐based representations. Given a raw animated sequence with one‐to‐one point correspondences together with an initial cage embedding, our algorithm automatically generates smoothly varying cage embeddings which faithfully reconstruct the enclosed object deformation. Our technique is fast, automatic, oblivious to the cage coordinate system, provides controllable error and exploits a GPU implementation. The benefits of our approach are illustrated in applications such as animation compression and post‐editing.
Bibliography:istex:41652DAA76890BC30FBD174E93E47A902FB1E669
ark:/67375/WNG-2SDV1H0R-M
ArticleID:CGF3159
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2012.03159.x