1.The Challenge of Interactivity 2.Parametric Blending -Building Blend-Spaces -Building Blend-Spaces -Using Virtual Example Grids for Parameterization.

Slides:



Advertisements
Similar presentations
Synchronized Multi-character Motion Editing Manmyung Kim, Kyunglyul Hyun, Jongmin Kim, Jehee Lee Seoul National University.
Advertisements

LOCOMOTION IN INTERACTIVE ENVIRONMENTS Navjot Garg.
*time Optimization Heiko, Diego, Thomas, Kevin, Andreas, Jens.
Verbs and Adverbs: Multidimensional Motion Interpolation Using Radial Basis Functions Presented by Sean Jellish Charles Rose Michael F. Cohen Bobby Bodenheimer.
Animation Following “Advanced Animation and Rendering Techniques” (chapter 15+16) By Agata Przybyszewska.
Automating Graph-Based Motion Synthesis Lucas Kovar Michael Gleicher University of Wisconsin-Madison.
 Mankyu Sung Scalable, Controllable, Efficient and convincing crowd simulation (2005)  Michael Gleicher “I have a bad case of Academic Attention Deficit.
Summary & Homework Jinxiang Chai. Outline Motion data process paper summary Presentation tips Homework Paper assignment.
Visual Recognition Tutorial
Online Performance Auditing Using Hot Optimizations Without Getting Burned Jeremy Lau (UCSD, IBM) Matthew Arnold (IBM) Michael Hind (IBM) Brad Calder (UCSD)
On the parameterization of clapping Herwin van Welbergen Zsófia Ruttkay Human Media Interaction, University of Twente.
Physically Based Motion Transformation Zoran Popović Andrew Witkin SIGGRAPH ‘99.
Introduction to Data-driven Animation Jinxiang Chai Computer Science and Engineering Texas A&M University.
Foundations of Computer Graphics (Spring 2010) CS 184, Lecture 24: Animation Many slides courtesy Adam Finkelstein,
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 24: Motion Capture Ravi Ramamoorthi Most slides courtesy.
Precomputed Search Trees: Planning for Interactive Goal-Driven Animation Manfred Lau and James Kuffner Carnegie Mellon University.
Radial Basis Functions
Automated Extraction and Parameterization of Motions in Large Data Sets SIGGRAPH’ 2004 Lucas Kovar, Michael Gleicher University of Wisconsin-Madison.
Instance Based Learning
UNC Chapel Hill M. C. Lin Reading Assignments Principles of Traditional Animation Applied to 3D Computer Animation, by J. Lasseter, Proc. of ACM SIGGRAPH.
1cs426-winter-2008 Notes  Collision notes part 1 (primitive operations) should be up on the weekend.
Kinematics. ILE5030 Computer Animation and Special Effects2 Kinematics The branch of mechanics concerned with the motions of objects without regard to.
Articulated Body Dynamics The Basics Comp 768 October 23, 2007 Will Moss.
Three Dimensional Fast Exact Euclidean Distance (3D-FEED) Maps January 2006 Theo Schouten Harco Kuppens Egon van den Broek.
Behavior Planning for Character Animation Manfred Lau and James Kuffner Carnegie Mellon University.
1 An Empirical Study on Large-Scale Content-Based Image Retrieval Group Meeting Presented by Wyman
Support Vector Machines
Human Computer Interaction 7. Advanced User Interfaces (I) Data Scattering and RBF Course no. ILE5013 National Chiao Tung Univ, Taiwan By: I-Chen Lin,
CS Instance Based Learning1 Instance Based Learning.
A Simple, Efficient Method for Realistic Animation of Clouds
Computer Animation CS 445/645 Fall Let’s talk about computer animation Must generate 30 frames per second of animation (24 fps for film) Issues.
Radial Basis Function Networks
Motion Blending (Multidimensional Interpolation) Jehee Lee.
Facial animation retargeting framework using radial basis functions Tamás Umenhoffer, Balázs Tóth Introduction Realistic facial animation16 is a challenging.
Learning Human Pose and Motion Models for Animation Aaron Hertzmann University of Toronto.
Cartographic Applications
A Fast Simulation Method Using Overlapping Grids for Interactions between Smoke and Rigid Objects Yoshinori Dobashi (Hokkaido University) Tsuyoshi Yamamoto.
Character Animation for Realtime Applications Michael Putz Klaus Hufnagl Institute of Computer Graphics Graz University of Technology Austria.
Computer Graphics 2 In the name of God. Outline Introduction Animation The most important senior groups Animation techniques Summary Walking, running,…examples.
Automated Construction of Parameterized Motions Lucas Kovar Michael Gleicher University of Wisconsin-Madison.
Dynamic Programming. What is dynamic programming? Break problem into subproblems Work backwards Can use ‘recursion’ ‘Programming’ - a mathematical term.
Computing & Information Sciences Kansas State University Lecture 15 of 42CIS 636/736: (Introduction to) Computer Graphics Lecture 15 of 42 William H. Hsu.
Research Into the Time Reversal of Cellular Automata Team rm -rf / Daniel Kaplun, Dominic Labanowski, Alex Lesman.
Adapting Wavelet Compression to Human Motion Capture Clips Philippe Beaudoin 1 Pierre Poulin 1 Michiel van de Panne 2 1 Université de Montréal, LIGUM 2.
Fast and Accurate Goal- Directed Motion Synthesis For Crowds Mankyu Sung Lucas Kovar Michael Gleicher University of Wisconsin- Madison
Coordinate-Invariant Methods For Motion Analysis and Synthesis Jehee Lee Dept. Of Electric Engineering and Computer Science Korea Advanced Institute of.
Multifactor GPs Suppose now we wish to model different mappings for different styles. We will add a latent style vector s along with x, and define the.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
CS-378: Game Technology Lecture #13: Animation Prof. Okan Arikan University of Texas, Austin Thanks to James O’Brien, Steve Chenney, Zoran Popovic, Jessica.
UNC Chapel Hill M. C. Lin Basics of Motion Generation let X i = position,orient. of O i at t k = t 0,  i END = false while (not END) do display O i, 
Flexible Automatic Motion Blending with Registration Curves
Hierarchical Radial Basis Function Networks for 3-D Surface Reconstruction ( Borghese and Ferrari, Neurocomputing, 1998) A constructive hierarchical RBF.
Motion Graphs By Lucas Kovar, Michael Gleicher, and Frederic Pighin Presented by Phil Harton.
The synthesis of motion capture data Author : Tomáš Sako Supervisor : RNDr. Stanislav Stanek.
Facial Animation Wilson Chang Paul Salmon April 9, 1999 Computer Animation University of Wisconsin-Madison.
Reverse Engineering of Point Clouds to Obtain Trimmed NURBS Lavanya Sita Tekumalla Advisor: Prof. Elaine Cohen School of Computing University of Utah Masters.
Animation Animation is about bringing things to life Technically: –Generate a sequence of images that, when played one after the other, make things move.
MotionVis Donovan Parks. Outline  Project motivation and goal  Details of projects  Video showing results  Future work and conclusions.
CS 8751 ML & KDDInstance Based Learning1 k-Nearest Neighbor Locally weighted regression Radial basis functions Case-based reasoning Lazy and eager learning.
2014 Animation Programming for Music Video Games Jessica Scott Harmonix Music Systems, Inc. October 10, 2014 #GHC
Part 3: Estimation of Parameters. Estimation of Parameters Most of the time, we have random samples but not the densities given. If the parametric form.
1 Bilinear Classifiers for Visual Recognition Computational Vision Lab. University of California Irvine To be presented in NIPS 2009 Hamed Pirsiavash Deva.
Computer Animation CS 446 September 5, 2001.
Physically-Based Motion Synthesis in Computer Graphics
Character Animation Forward and Inverse Kinematics
Real-Time Soft Shadows with Adaptive Light Source Sampling
Computer Animation cgvr.korea.ac.kr.
Reading Assignments Principles of Traditional Animation Applied to 3D Computer Animation, by J. Lasseter, Proc. of ACM SIGGRAPH 1987 Computer Animation:
WELCOME.
Synthesis of Motion from Simple Animations
Presentation transcript:

1.The Challenge of Interactivity 2.Parametric Blending -Building Blend-Spaces -Building Blend-Spaces -Using Virtual Example Grids for Parameterization -Using Virtual Example Grids for Parameterization -Combined and Layered Blend-Spaces 3.Comparison with Academic Research 4.Procedural Animations Talk Overview

1 – Blend-Weights can be complex to calculate 2 – Blend-Weights are not intuitive 3 – Blend-Weights can give unpredictable results Is this always a problem? Is this always a problem? When is it a problem? When is it a problem? Issues with Animation Blending

Part 2 Parametric Blending

1. What is it? An extension of animation blending An extension of animation blending A method to create predictable blending-results A method to create predictable blending-results 2. How does it work? It uses the captured properties of a motion-clip directly It uses the captured properties of a motion-clip directly It generates the blend-weights in relation to these properties It generates the blend-weights in relation to these properties 3. What can we use it for? Parametric Blending

Animation vs Parametric Blending The hard part is to generate Correct Blend-Weights and Natural Results! Getting both at the same time can be an extremely difficult process

1.Accurate Parameter Mapping 2.Artist-Directed Blending 3.Continuous-Control 4.Runtime Efficient 5.Memory Efficient Conclusion: if only one of these features is missing, then it’s very hard to use it in game-productions. The 5 Features a Parameterizer must have!

Building-Blocks for a Parameterizer

Virtual Example Grids The Offline Process The step-by-step process how to setup a parametric group for locomotion.

Virtual Example Grids The Offline Process Step 1: Asset Selection

Virtual Example Grids The Offline Process Step 2: Parameter Extraction

Virtual Example Grids The Offline Process Step 3: Setup of the Blend-Space

Virtual Example Grids The Offline Process Step 4: Blending Annotations Weird Issue: Different combinations of Blend-Weights, can give you a blended motion with Identical Parameter, but totally different Visual Poses

Virtual Example Grids The Offline Process Advantages of Annotations 1.Artist Directed Blending 2.No “Scattered Data Interpolation” Problem 3.Continuous Control 4.Control over Performance 5.Simple, Precise and Easy to Debug

Virtual Example Grids The Offline Process Step 5: Extrapolated Pseudo Examples

Virtual Example Grids The Offline Process Step 6: Virtual Example Grids

The Runtime Process

Virtual Example Grids The Runtime Process Step 1: Parameterization:

Virtual Example Grids The Runtime Process Step 2: Time-Warping

Virtual Example Grids The Runtime Process Step 3: Pose-Blending

Exponential Asset Explosion Exponential Asset Explosion 1D - 3 assets for move-speed 2D - 9 assets for move-speed / turn left-right 3D - 27 assets for speed / turn left-right / uphill-downhill 4D – 27*8 assets for speed / turn left-right / uphill-downhill multiply by 8 move-directions =216 (for 1 parametric group) -This is the raw bare minimum for a full featured character, regardless of the blending method. -This is the raw bare minimum for a full featured character, regardless of the blending method. -Our practical maximum was 34 assets per group -Our practical maximum was 34 assets per group Debugging Nightmare Debugging Nightmare -More then 3 dimensions are hard to visualize & debug -More then 3 dimensions are hard to visualize & debug -Dimensionality-Problem is the Dead End for Parametric Blending -Dimensionality-Problem is the Dead End for Parametric Blending Curse of Dimensionality

But 3D is not enough! But 3D is not enough! - with 3D you have only 3 Parameters to control -in a game you will need much more What’s the Solutions? What’s the Solutions? -build small Blend-Spaces and combine them -or we can layer Blend-Spaces Curse of Dimensionality

Combined Blend-Spaces Our Blend-Spaces are limited to 3 dimensions Our Blend-Spaces are limited to 3 dimensions But it is possible to combine small blend-spaces But it is possible to combine small blend-spaces

The Layer Model The Layer Model Types of Layered Animations Types of Layered Animations - Overwrite Animations - Additive Animations - Combination of both Methods in one Asset Layered Blending

Parametric Weapon Aiming Parametric Weapon Aiming Parametric Blending used in Layers

Parametric Gaze-control (including eye-lids) Parametric Gaze-control (including eye-lids) Parametric Blending used in Layers

We used only small Blend-Spaces (max 3D) We used only small Blend-Spaces (max 3D) With combinations it was possible to control 4D With combinations it was possible to control 4D With layering it was possible to control up to 8D With layering it was possible to control up to 8D Virtual Example Grids Summary

Part 3 Comparison with Academic Research

Techniques for a Parameterizer

Virtual Example Grids vs Radial Basis Functions “Verbs and Adverbs: Multidimensional motion interpolation.” by Charles Rose, Bobby Bodenheimer and Michael Cohen (1998) “Artist directed IK using RBF interpolation.” by Charles Rose, Peter-Pike Sloan and Michael Cohen (2001)

Virtual Example Grids vs K-Nearest Neighbors “Automated extraction and parameterization of motions” by Lucas Kovar and Michael Gleicher (2004)

Combination of IK-solvers IK-Solvers (2B, 3B & CCD-IK) generate new poses IK-Solvers (2B, 3B & CCD-IK) generate new poses Procedural Motion Warping Procedural Motion Warping Typical Applications Fix of Blending-Artifacts Fix of Blending-Artifacts Ground Alignment Ground Alignment Recoil Recoil Kinematic Methods

From RBF to VEG 1.We started with an RBF implementation -was slow, no control over blending -was slow, no control over blending 2.We combined RBF with KNN -faster, but now we had snaps in the motions -faster, but now we had snaps in the motions 3.Smoothing of Blend-Weights to avoid snaps -worked, but smoothing messed up the parameterization -worked, but smoothing messed up the parameterization 4.Manual Annotation -this fixed all issues and made SDI redundant -this fixed all issues and made SDI redundant 5.We used VEGs to maximize performance

Part 4 Procedural Animations

Just Ragdolls Just Ragdolls Ragdolls & Animation Blending Ragdolls & Animation Blending Procedural Hit-Reactions Procedural Hit-Reactions Animated Hit-Reactions Animated Hit-Reactions Inverse Dynamics Inverse Dynamics Physically Based Animations

Summary 1.Animation-Data is the foundation 2.Blend-Spaces and Parametric Animations 3.Annotations -Annotations to improve the motion-quality -Annotations to improve the motion-quality -Annotations to eliminate the SDI problem -Annotations to eliminate the SDI problem -Annotations to accelerate the pose-blender -Annotations to accelerate the pose-blender -Annotations with Pseudo-Examples to save memory -Annotations with Pseudo-Examples to save memory 4.Virtual Example Grids 5.Combined and Layered Blend-Spaces 6.Procedural Techniques

Special thanks for the Help with this Presentation: Benjamin Block, Chris Butcher, Daniele Duri, Frieder Erdman, Ivo Zoltan Frey, Mathias Lindner, Michelle Martin Peter North, David Ramos, Sven van Soom, Peter Söderbaum, Alex Taube, Karlheinz Watemeier, The Best is Yet to Come You can find a more detailed comparison between different Parametric Methods after the Q&A Slide

The Best is Yet to Come You can find a more detailed comparison between different Parametric Methods

Reference & Comparison

1.Accurate Parameter Mapping 2.Artist-Directed Blending 3.Continuous-Control 4.Runtime Efficient 5.Memory Efficient Requirements for a Parameterizer

Interpolation Synthesis “Interpolation synthesis for articulated figure motion” by Douglas Wiley and James Hahn (1997) 1.Accurate Parameter Mapping: YES (but depends mainly on the density of the grid) 2.Artist-Directed Blending: YES (but artist are forced to fill a grid with motions) 3.Continuous-Control: YES 4.Run-time Efficient: YES 5.Memory Efficient: NO (memory requirements and the amount of assets were insane) Regular Grid

Scattered Data Interpolation (1/5) Radial Basis Functions “Verbs and adverbs: Multidimensional motion interpolation.” by Charles Rose, Bobby Bodenheimer and Michael Cohen (1998) 1.Accurate Parameter Mapping: ??? (For IK-tasks very inaccurate) 2.Artist-Directed Blending: NO (In many cases blend-poses were more or less random) 3.Continuous-Control: YES (RBFs are smooth) 4.Run-time Efficient: NO (The parameterizer was using interpolation per DOF) 5.Memory Efficient: YES (Only key-examples are needed)

Scattered Data Interpolation (2/5) Cardinal Radial Basis Functions “Artist directed IK using RBF interpolation.” by Charles Rose, Peter-Pike Sloan and Michael Cohen (2001) 1.Accurate Parameter Mapping: YES (precision is coming mainly from the pseudo-examples) 2.Artist-Directed Blending: NO (in many cases blend-poses were more or less random) 3.Continuous-Control: YES (RBFs are smooth) 4.Run-time Efficient: ??? (The more pseudo-examples, the slower) 5.Memory Efficient: ??? (Depends on the amount of Pseudo-Examples)

Scattered Data Interpolation (3/5) K-Nearest Neighbors “Automated extraction and parameterization of motions” by Lucas Kovar and Michael Gleicher (2004) 1.Accurate Parameter Mapping: YES (only with enough pseudo examples) 2.Artist-Directed Blending: NO (they use random sampling. The result was more or less luck) 3.Continuous-Control: NO (Continuous-control was impossible) 4.Run-time Efficient: YES (KNN is simple and fast) 5.Memory Efficient: NO (requires high amount if pseudo-example)

Scattered Data Interpolation (4/5) Geostatistical Interpolation “Geostatistical Motion Interpolation” by Tomohiko Mukai and Shigeru Kuriyama (2005) 1.Accurate Parameter Mapping: YES (accurate, but not 100%) 2.Artist-Directed Blending: NO (same issue as RBFs) 3.Continuous-Control: YES (RBFs are smooth) 4.Run-time Efficient: NO (Kringing is slower then RBFs) 5.Memory Efficient: YES (it is memory efficient at the cost of more CPU power)

Scattered Data Interpolation (5/5) Virtual Example Grids 1.Accurate Parameter Mapping: YES (depends on the density of the grid) 2.Artist-Directed Blending: YES (annotations for interpolation and extrapolation) 3.Continuous-Control: YES 4.Run-time Efficient: YES (all you need is a simple look-up and linear blend) 5.Memory Efficient: YES (depends on the density of the grid)