As-Rigid-As-Possible Surface Modeling

Slides:



Advertisements
Similar presentations
Large Mesh Deformation Using the Volumetric Graph Laplacian
Advertisements

Bayesian Belief Propagation
Real-Time Template Tracking
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The Linear Prediction Model The Autocorrelation Method Levinson and Durbin.
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
2D/3D Shape Manipulation, 3D Printing
Ming Chuang and Misha Kazhdan Johns Hopkins University
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 9: Extrinsic Deformations Fall 2012.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 10: Extrinsic Deformations Fall 2014.
SGP 2008 A Local/Global Approach to Mesh Parameterization Ligang Liu Lei Zhang Yin Xu Zhejiang University, China Craig Gotsman Technion, Israel Steven.
Eurographics 2012, Cagliari, Italy GPU based ARAP Deformation using Volumetric Lattices M. Zollhöfer, E. Sert, G. Greiner and J. Süßmuth Computer Graphics.
Mesh Parameterization: Theory and Practice Differential Geometry Primer.
3D Shape Histograms for Similarity Search and Classification in Spatial Databases. Mihael Ankerst,Gabi Kastenmuller, Hans-Peter-Kriegel,Thomas Seidl Univ.
Interactive Inverse 3D Modeling James Andrews Hailin Jin Carlo Séquin.
2D/3D Shape Manipulation, 3D Printing
Pseudo-Skeleton based ARAP Mesh Deformation M. Zollhöfer, A. Vieweg, J. Süßmuth and G. Greiner Computer Graphics Group, FAU Erlangen-Nuremberg, Germany.
1 Free-Form Deformations Dr. Scott Schaefer. 2/28 Deformation.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
A Sketch-Based Interface for Detail-Preserving Mesh Editing Andrew Nealen Olga Sorkine Marc Alexa Daniel Cohen-Or.
Accurate Non-Iterative O( n ) Solution to the P n P Problem CVLab - Ecole Polytechnique Fédérale de Lausanne Francesc Moreno-Noguer Vincent Lepetit Pascal.
Iterative closest point algorithms
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Polygonal Mesh – Data Structure and Smoothing
Andrei Sharf Dan A. Alcantara Thomas Lewiner Chen Greif Alla Sheffer Nina Amenta Daniel Cohen-Or Space-time Surface Reconstruction using Incompressible.
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
FiberMesh: Designing Freeform Surfaces with 3D Curves
Andrew Nealen, TU Berlin, CG 11 Andrew Nealen TU Berlin Takeo Igarashi The University of Tokyo / PRESTO JST Olga Sorkine Marc Alexa TU Berlin Laplacian.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
1 Free-Form Deformations Free-Form Deformation of Solid Geometric Models Fast Volume-Preserving Free Form Deformation Using Multi-Level Optimization Free-Form.
Laplacian Surface Editing
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
Multiresolution Motion Analysis with Applications Jehee Lee Sung Yong Shin Dept of EE&CS, KAIST Jehee Lee Sung Yong Shin Dept of EE&CS, KAIST.
Multimodal Interaction Dr. Mike Spann
Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Recent Work on Laplacian Mesh Deformation Speaker: Qianqian Hu Date: Nov. 8, 2006.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Shape Deformation Reporter: Zhang, Lei 5/30/2006.
Global Parametrization of Range Image Sets Nico Pietroni, Marco Tarini, Olga Sorkine, Denis Zorin.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Coordinate-Invariant Methods For Motion Analysis and Synthesis Jehee Lee Dept. Of Electric Engineering and Computer Science Korea Advanced Institute of.
Computer Animation Algorithms and Techniques Chapter 4 Interpolation-based animation.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION
Image Deformation Using Moving Least Squares Scott Schaefer, Travis McPhail, Joe Warren SIGGRAPH 2006 Presented by Nirup Reddy.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Hierarchical Deformation of Locally Rigid Meshes Josiah Manson and Scott Schaefer Texas A&M University.
Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.
using Radial Basis Function Interpolation
Extended Free-Form Deformation Xiao, Yongqin CMPS260 Winter 2003 Instructor: Alex Pang.
Motivation 2 groups of tools for free-from design Images credits go out to the FiberMesh SIGGRAPH presentation and other sources courtesy of Google.
Differential Coordinates and Laplacians Nicholas Vining Technical Director, Gaslamp Games.
How are shapes deformed in computer graphics? In order to deform a shape, a planar map is used. A map is a vector function that changes the coordinates.
CSE 554 Lecture 8: Alignment
Morphing and Shape Processing
You can check broken videos in this slide here :
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
CSE 554 Lecture 9: Laplacian Deformation
Y. Lipman D. Levin D. Cohen-Or
(deformacija objektov)
CSE 554 Lecture 10: Extrinsic Deformations
Jeff Ballard Nick Rasmussen
Y. Lipman D. Levin D. Cohen-Or
Jeff Ballard Nick Rasmussen
Presentation transcript:

As-Rigid-As-Possible Surface Modeling Olga Sorkine Marc Alexa TU Berlin

Surface deformation – motivation Interactive shape modeling Digital content creation Scanned data Modeling is an interactive, iterative process Tools need to be intuitive (interface and outcome) Allow quick experimentation

What do we expect from surface deformation? Smooth effect on the large scale As-rigid-as-possible effect on the small scale (preserves details)

Previous work FFD (space deformation) Pros: Cons: Lattice-based (Sederberg & Parry 86, Coquillart 90, …) Curve-/handle-based (Singh & Fiume 98, Botsch et al. 05, …) Cage-based (Ju et al. 05, Joshi et al. 07, Kopf et al. 07) Pros: efficiency almost independent of the surface resolution possible reuse Cons: space warp, so can’t precisely control surface properties images taken from [Sederberg and Parry 86] and [Ju et al. 05]

“On Linear Variational Surface Deformation Methods” Previous work Surface-based approaches Multiresolution modeling Zorin et al. 97, Kobbelt et al. 98, Lee 98, Guskov et al. 99, Botsch and Kobbelt 04, … Differential coordinates – linear optimization Lipman et al. 04, Sorkine et al. 04, Yu et al. 04, Lipman et al. 05, Zayer et al. 05, Botsch et al. 06, Fu et al. 06, … Non-linear global optimization approaches Kraevoy & Sheffer 04, Sumner et al. 05, Hunag et al. 06, Au et al. 06, Botsch et al. 06, Shi et al. 07, … “On Linear Variational Surface Deformation Methods” M. Botsch and O. Sorkine to appear at IEEE TVCG NEW! images taken from PriMo, Botsch et al. 06

Surface-based approaches Pros: direct interaction with the surface control over surface properties Cons: linear optimization suffers from artifacts (e.g. translation insensitivity) non-linear optimization is more expensive and non-trivial to implement

Direct ARAP modeling Preserve shape of cells covering the surface Cells should overlap to prevent shearing at the cells boundaries Equally-sized cells, or compensate for varying size

Direct ARAP modeling Let’s look at cells on a mesh

Cell deformation energy Ask all star edges to transform rigidly by some rotation R, then the shape of the cell is preserved vj2 vi vj1

Cell deformation energy If v, v׳ are known then Ri is uniquely defined So-called shape matching problem Build covariance matrix S = VV׳T SVD: S = UWT Ri = UWT (or use [Horn 87]) v׳j2 vj2 vi v׳i v׳j1 Ri vj1 Ri is a non-linear function of v׳

Total deformation energy Can formulate overall energy of the deformation: We will treat v׳ and R as separate sets of variables, to enable a simple optimization process

Energy minimization Alternating iterations Given initial guess v׳0, find optimal rotations Ri This is a per-cell task! We already showed how to define Ri when v, v׳ are known Given the Ri (fixed), minimize the energy by finding new v׳

Uniform mesh Laplacian Energy minimization Alternating iterations Given initial guess v׳0, find optimal rotations Ri This is a per-cell task! We already showed how to define Ri when v, v׳ are known Given the Ri (fixed), minimize the energy by finding new v׳ Uniform mesh Laplacian

The advantage Each iteration decreases the energy (or at least guarantees not to increase it) The matrix L stays fixed Precompute Cholesky factorization Just back-substitute in each iteration (+ the SVD computations)

First results Non-symmetric results

Need appropriate weighting The problem: lack of compensation for varying shapes of the 1-ring

Need appropriate weighting Add cotangent weights [Pinkall and Polthier 93]: Reformulate Ri optimization to include the weights (weighted covariance matrix) vi ij ij vj

Weighted energy minimization results This gives symmetric results

Initial guess Can start from naïve Laplacian editing as initial guess and iterate initial guess 1 iteration 2 iterations initial guess 1 iterations 4 iterations

Initial guess Faster convergence when we start from the previous frame (suitable for interactive manipulation)

Some more results Demo

Discussion Works fine on small meshes fast propagation of rotations across the mesh On larger meshes: slow convergence slow rotation propagation A multi-res strategy will help e.g., as in Mean-Value Pyramid Coordinates [Kraevoy and Sheffer 05] or in PriMo [Botsch et al. 06]

More discussion Our technique is good for preserving edge length (relative error is very small) No notion of volume, however “thin shells for the poor”? Can easily extend to volumetric meshes

Conclusions and future work Simple formulation of as-rigid-as-possible surface-based deformation Iterations are guaranteed to reduce the energy Uses the same machinery as Laplacian editing, very easy to implement No parameters except number of iterations per frame (can be set based on target frame rate) Is it possible to find better weights? Modeling different materials – varying rigidity across the surface

Acknowledgement Alexander von Humboldt Foundation Leif Kobbelt and Mario Botsch SGP Reviewers

Thank you! Olga Sorkine sorkine@gmail.com Marc Alexa marc@cs.tu-berlin.de