AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION

Slides:



Advertisements
Similar presentations
Data Modeling and Least Squares Fitting COS 323. Data Modeling Given: data points, functional form, find constants in functionGiven: data points, functional.
Advertisements

As-Rigid-As-Possible Surface Modeling
Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.
Character Animation from 2D Pictures and 3D Motion Data ACM Transactions on Graphics 2007.
Data Modeling and Parameter Estimation Nov 9, 2005 PSCI 702.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 9: Extrinsic Deformations Fall 2012.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 10: Extrinsic Deformations Fall 2014.
Modeling the Shape of People from 3D Range Scans
Some Ideas Behind Finite Element Analysis
Lecture 3 Jack Tanabe Old Dominion University Hampton, VA January 2011 Conformal Mapping.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
Motion Analysis Slides are from RPI Registration Class.
Interactive Animation of Structured Deformable Objects Mathieu Desbrun Peter Schroder Alan Barr.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Face Poser: Interactive Modeling of 3D Facial Expressions Using Model Priors Manfred Lau 1,3 Jinxiang Chai 2 Ying-Qing Xu 3 Heung-Yeung Shum 3 1 Carnegie.
Real-time Combined 2D+3D Active Appearance Models Jing Xiao, Simon Baker,Iain Matthew, and Takeo Kanade CVPR 2004 Presented by Pat Chan 23/11/2004.
Recovering Articulated Object Models from 3D Range Data Dragomir Anguelov Daphne Koller Hoi-Cheung Pang Praveen Srinivasan Sebastian Thrun Computer Science.
FiberMesh: Designing Freeform Surfaces with 3D Curves
Non-Euclidean Embedding
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
CSci 6971: Image Registration Lecture 5: Feature-Base Regisration January 27, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart,
CS 450: Computer Graphics 2D TRANSFORMATIONS
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2014.
Classification and Prediction: Regression Analysis
Input: Original intensity image. Target intensity image (i.e. a value sketch). Using Value Images to Adjust Intensity in 3D Renderings and Photographs.
Junjun Pan 1, Xiaosong Yang 1, Xin Xie 1, Philip Willis 2, Jian J Zhang 1
Laplacian Surface Editing
Lecture VII Rigid Body Dynamics CS274: Computer Animation and Simulation.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
A Survey on FFD Reporter: Gang Xu Mar 15, Overview Volumn-based FFD Surface-based FFD Curve-based FFD Point-based FFD Accurate FFD Future Work Outline.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
An Algebraic Model for Parameterized Shape Editing Martin Bokeloh, Stanford Univ. Michael Wand, Saarland Univ. & MPI Hans-Peter Seidel, MPI Vladlen Koltun,
13 th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2008 October 8-10, 2008 Konstanz, Germany Strike a Pose Image-Based Pose Synthesis.
Digital Image Processing Lecture 7: Geometric Transformation March 16, 2005 Prof. Charlene Tsai.
A Novel Wave-Propagation Approach For Fully Conservative Eulerian Multi-Material Simulation K. Nordin-Bates Lab. for Scientific Computing, Cavendish Lab.,
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Collisions & Contact.
Curve-Fitting Regression
Global Parametrization of Range Image Sets Nico Pietroni, Marco Tarini, Olga Sorkine, Denis Zorin.
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2013.
Detail-Preserving Fluid Control N. Th ű rey R. Keiser M. Pauly U. R ű de SCA 2006.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
Image Deformation Using Moving Least Squares Scott Schaefer, Travis McPhail, Joe Warren SIGGRAPH 2006 Presented by Nirup Reddy.
ADALINE (ADAptive LInear NEuron) Network and
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
using Radial Basis Function Interpolation
CS274 Spring 01 Lecture 7 Copyright © Mark Meyer Lecture VII Rigid Body Dynamics CS274: Computer Animation and Simulation.
Spring 2014 CS274: Automatic Rigging
CS274 Spring 01 Lecture 8 Copyright © Mark Meyer Lecture VIII Deformable Bodies CS274: Computer Animation and Simulation.
Introduction to Parametric Curve and Surface Modeling.
Clothing Manipulation Takeo Igarashi John F.Hughes Computer Science Department University of Tokyo Computer Science Department Brown University.
Chapter 7. Classification and Prediction
Morphing and Shape Processing
You can check broken videos in this slide here :
Random walk initialization for training very deep feedforward networks
CSE 554 Lecture 9: Laplacian Deformation
© University of Wisconsin, CS559 Spring 2004
Real-time Skeletal Skinning with Optimized Centers of Rotation
Chapter XIII Character Animation
CSE 554 Lecture 10: Extrinsic Deformations
Computer Animation Algorithms and Techniques
Introduction to Parametric Curve and Surface Modeling
Presentation transcript:

AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION TAKEO IGARASHI THE UNIVERSITY OF TOKYO TOMER MOSCOVICH BROWN UNIVERSITY JOHN F. HUGHES BROWN UNIVERSITY

INTRODUCTION We present a two-step closed-form algorithm that achieves real-time interaction. The first step finds an appropriate rotation for each triangle. The second step adjusts its scale. Each step uses a quadratic error metric so that the minimization problem is formulate as a set of simultaneous linear equations. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

RELATED WORK SHAPE MANIPULATION TECHNIQUES FALL ROUGHLY INTO TWO CATEGORIES: Deform the space in which the target shape is embedded. [Lewis et al. 2000]--using predefined skeleton. [McCracken and Joy 1996]--each point is associated with a closed region in a FFD grid. Deform the shape while taking its structure into account. [Gibson and Mirtich1997]--mass-spring models. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

OVERVIEW a)Triangulation and registration(pre-computed) INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK a)Triangulation and registration(pre-computed) Input a 2D model Silhouette : marching squares algorithm Triangulation : Delaunay triangulation Registration : accelerate the computation during interaction

OVERVIEW b)Compilation(pre-computed) User clicks on the shape to place handles. So far, user can only place handles at existing mesh vertices. c)Manipulation User drags the handles to make a deformation of the shape. Also support multiple-point input devices. During interaction, update the handle configuration to solve the quadratic error functions. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Overview of the algorithm INTRODUCTION RELATED WORK OVERVIEW EXTENSIONS RESULTS FUTURE WORK Overview of the algorithm

ALGORITHM Step 1 : scale-free construction(allow rotation and uniform scaling) INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 1 : scale-free construction(allow rotation and uniform scaling) The error between v2desired and v2’ is then represented as We can define v0desired and v1desired similarly, so the error associated with the triangle is INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 1 : scale-free construction(allow rotation and uniform scaling) The error for the entire mesh is simply the sum of errors for all triangles in the mesh. We can express it in matrix form: The minimization problem is solved by setting the partial Derivatives of the function E1{v’} with respect to the free variables u in v’ to zero. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 1 : scale-free construction(allow rotation and uniform scaling) Rewrite as G’ and B are fixed and only q changes during manipulation. Therefore, we can obtain u by simple matrix multiplication by pre-computing G’-1B at the beginning. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 2 : scale adjustment Fitting the original triangle to the intermediate triangle INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 2 : scale adjustment Fitting the original triangle to the intermediate triangle Given a triangle{v0’,v1’,v2’}in the intermediate result and corresponding triangle in the rest shape{v0,v1,v2},the first problem is to find a new triangle{v0fitted,v1fitted,v2fitted}that is congruent to{v0,v1,v2}and minimizes the following function. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 2 : scale adjustment Fitting the original triangle to the intermediate triangle We minimize Ef by setting the partial derivatives of Ef to zero. By solving this equation, we obtain a newly fitted triangle {v0fitted,v1fitted, v2fitted} that is similar to the original triangle {v0, v1, v2}. We make it congruent simply by scaling the fitted triangle by the factor of INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 2 : scale adjustment Generating the final result using the fitted triangles We can define the quadratic error function by INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Step 2 : scale adjustment Generating the final result using the fitted triangles The error for the entire mesh can be represented as : We minimize E2 by setting the partial derivatives of E2 to zero. Rewrite as INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

ALGORITHM Algorithm summary INTRODUCTION RELATED WORK OVERVIEW EXTENSIONS RESULTS FUTURE WORK

EXTENSIONS Collision detection and depth adjustment INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

EXTENSIONS Weights for controlling rigidity INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

EXTENSIONS Animations INTRODUCTION RELATED WORK OVERVIEW ALGORITHM RESULTS FUTURE WORK

EXTENSIONS As-rigid-as-possible curve editing INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

EXTENSIONS As-rigid-as-possible curve editing INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK

RESULTS INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS FUTURE WORK

FUTURE WORK Determine the depth order of the overlapping regions. Extend the technique to 3D shapes. Allow users to put handles at arbitrary locations. Volume preservation. INTRODUCTION RELATED WORK OVERVIEW ALGORITHM EXTENSIONS RESULTS FUTURE WORK