Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.

Slides:



Advertisements
Similar presentations
Nonnegative Matrix Factorization with Sparseness Constraints S. Race MA591R.
Advertisements

Zhen Lu CPACT University of Newcastle MDC Technology Reduced Hessian Sequential Quadratic Programming(SQP)
Nonlinear Programming McCarl and Spreen Chapter 12.
Engineering Optimization
Optimization Methods TexPoint fonts used in EMF.
Siddharth Choudhary.  Refines a visual reconstruction to produce jointly optimal 3D structure and viewing parameters  ‘bundle’ refers to the bundle.
Spacetime Constraints David Coyne Joe Ishikura. The challenge of kinematics Successful animation requires control, but looks real Traditional principles.
Optimization methods Review
Easy Optimization Problems, Relaxation, Local Processing for a small subset of variables.
Empirical Maximum Likelihood and Stochastic Process Lecture VIII.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
Jonathan Richard Shewchuk Reading Group Presention By David Cline
Numerical Optimization
Function Optimization Newton’s Method. Conjugate Gradients
Motion Analysis (contd.) Slides are from RPI Registration Class.
Methods For Nonlinear Least-Square Problems
CSci 6971: Image Registration Lecture 4: First Examples January 23, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI Dr.
CES 514 – Data Mining Lecture 8 classification (contd…)
12 1 Variations on Backpropagation Variations Heuristic Modifications –Momentum –Variable Learning Rate Standard Numerical Optimization –Conjugate.
Advanced Topics in Optimization
Why Function Optimization ?
Optimization Methods One-Dimensional Unconstrained Optimization
Today Wrap up of probability Vectors, Matrices. Calculus

9 1 Performance Optimization. 9 2 Basic Optimization Algorithm p k - Search Direction  k - Learning Rate or.
UNCONSTRAINED MULTIVARIABLE
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 9. Optimization problems.
Collaborative Filtering Matrix Factorization Approach
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Kinematic Linkages.
Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.
ENCI 303 Lecture PS-19 Optimization 2
84 b Unidimensional Search Methods Most algorithms for unconstrained and constrained optimisation use an efficient unidimensional optimisation technique.
Ordinary Least-Squares Emmanuel Iarussi Inria. Many graphics problems can be seen as finding the best set of parameters for a model, given some data Surface.
Nonlinear programming Unconstrained optimization techniques.
Ken YoussefiMechanical Engineering Dept. 1 Design Optimization Optimization is a component of design process The design of systems can be formulated as.
LTSI (1) Faculty of Mech. & Elec. Engineering, University AL-Baath, Syria Ahmad Karfoul (1), Julie Coloigner (2,3), Laurent Albera (2,3), Pierre Comon.
1 Optimization Multi-Dimensional Unconstrained Optimization Part II: Gradient Methods.
Computational Intelligence: Methods and Applications Lecture 23 Logistic discrimination and support vectors Włodzisław Duch Dept. of Informatics, UMK Google:
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
Quasi-Newton Methods of Optimization Lecture 2. General Algorithm n A Baseline Scenario Algorithm U (Model algorithm for n- dimensional unconstrained.
Dan Simon Cleveland State University Jang, Sun, and Mizutani Neuro-Fuzzy and Soft Computing Chapter 6 Derivative-Based Optimization 1.
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
1 Chapter 6 General Strategy for Gradient methods (1) Calculate a search direction (2) Select a step length in that direction to reduce f(x) Steepest Descent.
Rick Parent - CIS681 Motion Capture Use digitized motion to animate a character.
Gradient Methods In Optimization
Chapter 2-OPTIMIZATION
Variations on Backpropagation.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Parameter estimation class 5 Multiple View Geometry CPSC 689 Slides modified from Marc Pollefeys’ Comp
Spacetime Constraints Chris Moore CS 552. Purpose Physically Accurate Realistic Motion.
Numerical Methods for Inverse Kinematics Kris Hauser ECE 383 / ME 442.
Optimal Control.
Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams
Character Animation Forward and Inverse Kinematics
LINEAR CLASSIFIERS The Problem: Consider a two class task with ω1, ω2.
Computational Optimization
Ellipse Fitting COMP 4900C Winter 2008.
Non-linear Least-Squares
Collaborative Filtering Matrix Factorization Approach
Variations on Backpropagation.
Variations on Backpropagation.
Performance Optimization
Computer Animation Algorithms and Techniques
Presentation transcript:

Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus of variations

Computer Animation Rick Parent Enforcing Soft and Hard Constraints Soft constraints - Minimizing energy terms Hard constraints – constrained optimization Example: Space-time constraints

Computer Animation Rick Parent Constrained optimization Use whenever the best, shortest, least error, is needed: Fit surface with least curvature to set of points Reach for object with minumu torque Find motion in database whose start pose is closest to end of current motion

Computer Animation Rick Parent Minimum (or maximum) of a function f(x) f’(x) = 0 Ballistic motion Analytic derivative & solution

Computer Animation Rick Parent Minimum (or maximum) of a function Multivariate case Gradient / Jacobian

Computer Animation Rick Parent Energy function Search parameter space modify parameters to reduce energy Parametric position function P(u,v) Surface normal function, N(u,v) Implicit function I(x) – distance to surface Useful geometric features– easy to compute Define energy terms in terms of geometric features =0 for desirable configuration increases for less desirable configurations

Computer Animation Rick Parent Useful Constraints

Computer Animation Rick Parent Pipe assembly

Computer Animation Rick Parent Finding the minimum Analytic derivative/gradient Numeric solution by iterative search Newton’s method Steepest Descent Conjugate Gradient Method Analytic solution minimize Numeric approximation to derivative/gradient

Computer Animation Rick Parent Newton’s method

Computer Animation Rick Parent Steepest descent – step in direction of negative of gradient

Computer Animation Rick Parent Conjugate gradient method

Computer Animation Rick Parent Constrained Optimization Equality constraints minimize Inequality constraints

Computer Animation Rick Parent Lagrange multipliers.

Computer Animation Rick Parent Spacetime constraints Constrained optimization problem in time and space Constraints – e.g. locating certain points in time and space Non penetration constraints Objective function – e.g. Minimize the amount of force used over time interval Minimize maximum torque.

Computer Animation Rick Parent Spacetime constraint example Particle position is function of time, x(t) Time-varying force function, f(t) Equation of motion Given f(t), x(t 0 ),- integrate to get x(t).

Computer Animation Rick Parent Spacetime constraint example Need to determine f(t) x(t 0 ) = a x(t 1 ) = b Objective: to minimize total force Objective function: Subject to constraints

Computer Animation Rick Parent Spacetime constraint example R – minimize discrete version subject to constraints. Use discrete x(t), f(t), R, constraints Time derivatives approximated by finite differences Constraints:

Computer Animation Rick Parent Spacetime constraint canonical form Numerical Solution – canonical form S j – collection of scalar independent variables R(S j ) – objective function to be minimized C i (S j ) – collection of scalar constraint functions => 0. x, y, z components of the x i ’s and f i ’s sum of forces squared used at each time step components of p i ’s, c a, and c b.

Computer Animation Rick Parent Spacetime constraint - canonical Numerical problem statement Find S j that minimizes R(S j ) subject to C i (S j ) = 0 Numerical solution method: - Request values of R and C i for given S j - Access to derivatives of R and C i with respect to S j - Iteratively provides updated values for solution vector S j.

Computer Animation Rick Parent Spacetime constraint Sequential Quadratic Programming (SQP) Computes second-order Newton-Raphson step in R Projects the first onto the null space of the second to the hyperplane for which all the C i ’s are constant to the first order. Computes first-order Newton-Raphson step in the C i ’s

Computer Animation Rick Parent Spacetime constraint using SQP Sequential Quadratic Programming (SQP) Computes first-order Newton-Raphson step in the C i ’s Jacobian: Computes second-order Newton-Raphson step in R Hessian Plus the first derivative vector:

Computer Animation Rick Parent Spacetime constraint example Matrices i=j i=j-1, j+1 otherwise i=j Otherwise.

Computer Animation Rick Parent Spacetime constraint example Matrices i=j Otherwise.

Computer Animation Rick Parent Spacetime constraint example SQP step Solve 2 linear systems in sequence Yields a step that minimizes a 2 nd order approx. to R Yields a step that drives linear approx. to C i ’s to zero And projects optimization step S j to null space of constraint Jacobian. 1 2

Computer Animation Rick Parent Spacetime constraint example Final update: Reaches fixed point: - When C i ’s = 0 - Any further decrease in R violates constraints.

Computer Animation Rick Parent Constrained optimization

Computer Animation Rick Parent Spacetime constraint example Note about Linear system solving Large matrices often with spacetime problems Inverting is O(n 3 ) Spacetime problems almost always sparse Over and under constrainted systems easily arise Under constrained: pseudo-inverse Pseudo-inverse for sparse matrix sparse conjugate gradient algorithm: O(n 2 ).