Uncovering the Lagrangian of a system from discrete observations
|
|
- Imogen Scott
- 5 years ago
- Views:
Transcription
1 Uncovering the Lagrangian of a system from discrete observations Yakov Berchenko-Kogan Massachusetts Institute of Technology 7 January, 2012 Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
2 Background The Problem Given discrete measurements of a Lagrangian system, can we recover the Lagrangian? Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
3 Background The Problem Given discrete measurements of a Lagrangian system, can we recover the Lagrangian? The Discrete Euler-Lagrange Equations Given a system with Lagrangian L(x, v), we can discretize the action with time step τ by summing the discrete Lagrangian ( x + y L d (x, y) = τ L, y x ). 2 τ Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
4 Background The Problem Given discrete measurements of a Lagrangian system, can we recover the Lagrangian? The Discrete Euler-Lagrange Equations Given a system with Lagrangian L(x, v), we can discretize the action with time step τ by summing the discrete Lagrangian ( x + y L d (x, y) = τ L, y x ). 2 τ The principle of stationary action yields the discrete Euler-Lagrange equations D 2 L d (x, y) + D 1 L d (y, z) = 0, relating any three consecutive points x, y, and z on a discrete trajectory. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
5 Recovering the Discrete Lagrangian The Problem Given a pair of points (x 0, y 0 ), we would like to use data points on trajectories that pass nearby to estimate the Taylor expansion of the discrete Lagrangian L d at (x 0, y 0 ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
6 Recovering the Discrete Lagrangian The Problem Given a pair of points (x 0, y 0 ), we would like to use data points on trajectories that pass nearby to estimate the Taylor expansion of the discrete Lagrangian L d at (x 0, y 0 ). A Caveat Two Lagrangians might be equivalent in the sense that they yield the same equations of motion. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
7 Recovering the Discrete Lagrangian The Problem Given a pair of points (x 0, y 0 ), we would like to use data points on trajectories that pass nearby to estimate the Taylor expansion of the discrete Lagrangian L d at (x 0, y 0 ). A Caveat Two Lagrangians might be equivalent in the sense that they yield the same equations of motion. For example, if L(x, y) is a discrete Lagrangian, then the Lagrangian L (x, y) = αl(x, y) + β(y 2 x 2 ) + γ(y x) + δ produces the same discrete Euler-Lagrange equations, for any choice of α, β, γ, and δ. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
8 Recovering the Discrete Lagrangian The Problem Given a pair of points (x 0, y 0 ), we would like to use data points on trajectories that pass nearby to estimate the Taylor expansion of the discrete Lagrangian L d at (x 0, y 0 ). A Caveat Two Lagrangians might be equivalent in the sense that they yield the same equations of motion. For example, if L(x, y) is a discrete Lagrangian, then the Lagrangian L (x, y) = αl(x, y) + β(y 2 x 2 ) + γ(y x) + δ produces the same discrete Euler-Lagrange equations, for any choice of α, β, γ, and δ. Trajectory data can t distinguish between equivalent Lagrangians, nor would it be useful to do so. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
9 A Second-Order Approximation Taylor Expansion of the Discrete Lagrangian Given a pair of points (x 0, y 0 ), we approximate L d with its second-degree Taylor polynomial at (x 0, y 0 ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
10 A Second-Order Approximation Taylor Expansion of the Discrete Lagrangian Given a pair of points (x 0, y 0 ), we approximate L d with its second-degree Taylor polynomial at (x 0, y 0 ). We rewrite it in the form L d a(x p) 2 + 2b(x p)(y p) + c(y p) 2 + d p (x p) + e p (y p) + f p, where p = (x 0 + y 0 )/2. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
11 A Second-Order Approximation Taylor Expansion of the Discrete Lagrangian Given a pair of points (x 0, y 0 ), we approximate L d with its second-degree Taylor polynomial at (x 0, y 0 ). We rewrite it in the form L d a(x p) 2 + 2b(x p)(y p) + c(y p) 2 + d p (x p) + e p (y p) + f p, where p = (x 0 + y 0 )/2. The expression in higher dimensions is analogous. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
12 A Second-Order Approximation Taylor Expansion of the Discrete Lagrangian Given a pair of points (x 0, y 0 ), we approximate L d with its second-degree Taylor polynomial at (x 0, y 0 ). We rewrite it in the form L d a(x p) 2 + 2b(x p)(y p) + c(y p) 2 + d p (x p) + e p (y p) + f p, where p = (x 0 + y 0 )/2. The expression in higher dimensions is analogous. Discrete Euler-Lagrange Equations For three consecutive points x, y, and z on a trajectory, we can apply the discrete Euler-Lagrange equations D 2 L d (x, y) + D 1 L d (y, z) = 0 to find 0 2(a + c)(y p) + 2b(x p + z p) + (d p + e p ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
13 A Second-Order Approximation Taylor Expansion of the Discrete Lagrangian Given a pair of points (x 0, y 0 ), we approximate L d with its second-degree Taylor polynomial at (x 0, y 0 ). We rewrite it in the form L d a(x p) 2 + 2b(x p)(y p) + c(y p) 2 + d p (x p) + e p (y p) + f p, where p = (x 0 + y 0 )/2. The expression in higher dimensions is analogous. Discrete Euler-Lagrange Equations For three consecutive points x, y, and z on a trajectory, we can apply the discrete Euler-Lagrange equations D 2 L d (x, y) + D 1 L d (y, z) = 0 to find 0 2(a + c)(y p) + 2b(x p + z p) + (d p + e p ). We will use nearby triplets (x, y, z) from our trajectory measurements to estimate a + c, b, and d p + e p. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
14 New Parameters for the Lagrangian Scaling the Parameters In order to estimate the parameters using many data points, we need to assign weights to the parameters appropriately. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
15 New Parameters for the Lagrangian Scaling the Parameters In order to estimate the parameters using many data points, we need to assign weights to the parameters appropriately. The parameter d p + e p has different units from a + c and b. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
16 New Parameters for the Lagrangian Scaling the Parameters In order to estimate the parameters using many data points, we need to assign weights to the parameters appropriately. The parameter d p + e p has different units from a + c and b. Taylor approximations of the discrete Euler-Lagrange equations suggest that an appropriate rescaling of the parameters at (x 0, y 0 ) is A := (a + c) y 0 x 0, B := 2b y 0 x 0, D := d p + e p. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
17 New Parameters for the Lagrangian Scaling the Parameters In order to estimate the parameters using many data points, we need to assign weights to the parameters appropriately. The parameter d p + e p has different units from a + c and b. Taylor approximations of the discrete Euler-Lagrange equations suggest that an appropriate rescaling of the parameters at (x 0, y 0 ) is A := (a + c) y 0 x 0, B := 2b y 0 x 0, D := d p + e p. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
18 New Parameters for the Lagrangian Scaling the Parameters In order to estimate the parameters using many data points, we need to assign weights to the parameters appropriately. The parameter d p + e p has different units from a + c and b. Taylor approximations of the discrete Euler-Lagrange equations suggest that an appropriate rescaling of the parameters at (x 0, y 0 ) is A := (a + c) y 0 x 0, B := 2b y 0 x 0, D := d p + e p. Discrete Euler-Lagrange Equations For three consecutive points (x, y, z) on a trajectory, we have 0 A(2y x 0 y 0 ) + B(x + z x 0 y 0 ) + D y 0 x 0. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
19 Estimating the Parameters Discrete Euler-Lagrange Equations For three consecutive points (x, y, z) on a trajectory, we have 0 A(2y x 0 y 0 ) + B(x + z x 0 y 0 ) + D y 0 x 0. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
20 Estimating the Parameters Discrete Euler-Lagrange Equations For three consecutive points (x, y, z) on a trajectory, we have 0 A(2y x 0 y 0 ) + B(x + z x 0 y 0 ) + D y 0 x 0. Estimating Lagrangian Parameters with Several Data Points Given data of consecutive triplets (x i, y i, z i ), we estimate A, B, and D up to scaling at a point (x 0, y 0 ) as follows. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
21 Estimating the Parameters Discrete Euler-Lagrange Equations For three consecutive points (x, y, z) on a trajectory, we have 0 A(2y x 0 y 0 ) + B(x + z x 0 y 0 ) + D y 0 x 0. Estimating Lagrangian Parameters with Several Data Points Given data of consecutive triplets (x i, y i, z i ), we estimate A, B, and D up to scaling at a point (x 0, y 0 ) as follows. Construct a matrix M whose rows are w i (2y i (x 0 + y 0 ) x i + z i (x 0 + y 0 ) y 0 x 0 ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
22 Estimating the Parameters Discrete Euler-Lagrange Equations For three consecutive points (x, y, z) on a trajectory, we have 0 A(2y x 0 y 0 ) + B(x + z x 0 y 0 ) + D y 0 x 0. Estimating Lagrangian Parameters with Several Data Points Given data of consecutive triplets (x i, y i, z i ), we estimate A, B, and D up to scaling at a point (x 0, y 0 ) as follows. Construct a matrix M whose rows are w i (2y i (x 0 + y 0 ) x i + z i (x 0 + y 0 ) y 0 x 0 ). ( AB ) For the correct values of the parameters, we will have M 0. D Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
23 Estimating the Parameters Discrete Euler-Lagrange Equations For three consecutive points (x, y, z) on a trajectory, we have 0 A(2y x 0 y 0 ) + B(x + z x 0 y 0 ) + D y 0 x 0. Estimating Lagrangian Parameters with Several Data Points Given data of consecutive triplets (x i, y i, z i ), we estimate A, B, and D up to scaling at a point (x 0, y 0 ) as follows. Construct a matrix M whose rows are w i (2y i (x 0 + y 0 ) x i + z i (x 0 + y 0 ) y 0 x 0 ). ( AB ) For the correct values of the parameters, we will have M 0. Estimate A, B, and D by the eigenvector corresponding to the least eigenvalue of M T M. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13 D
24 Assigning Weights to the Data Points The matrix of coefficients The ith row of M is w i (2y i (x 0 + y 0 ) x i + z i (x 0 + y 0 ) y 0 x 0 ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
25 Assigning Weights to the Data Points The matrix of coefficients The ith row of M is Distance w i (2y i (x 0 + y 0 ) x i + z i (x 0 + y 0 ) y 0 x 0 ). We define the distance bewteen (x 0, y 0 ) and (x, y) to be δ((x 0, y 0 ), (x, y)) 2 = x+y 2 x 0+y τs 2 where τ s is a parameter and τ is the timestep. y x τ y 0 x 0 τ 2, Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
26 Assigning Weights to the Data Points The matrix of coefficients The ith row of M is Distance w i (2y i (x 0 + y 0 ) x i + z i (x 0 + y 0 ) y 0 x 0 ). We define the distance bewteen (x 0, y 0 ) and (x, y) to be δ((x 0, y 0 ), (x, y)) 2 = x+y 2 x 0+y τs 2 where τ s is a parameter and τ is the timestep. Weights w i = exp where σ is another parameter. y x τ y 0 x 0 τ 2, ( 1 ( δ((x0 2σ 2, y 0 ), (x i, y i )) 2 + δ((x 0, y 0 ), (y i, z i )) 2) ), Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
27 The Simple Pendulum The Lagrangian L d (x, y) = τ ( 1 2 ( y x τ ) 2 ( ( x + y 1 cos 2 )) ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
28 The Simple Pendulum The Lagrangian L d (x, y) = τ ( 1 2 ( y x True Values of Lagrangian Parameters τ ) 2 ( ( x + y 1 cos 2 )) ). Using a Taylor approximation to the Lagrangian, we find that B A = 4 + τ 2 ( cos x0 +y 0 ) 2 4 τ 2 cos ( D x 0 +y 0 ), A = 4τ 2 y 0 x 0 2 sin ( x 0 +y 0 2 ) 4 τ 2 cos ( x 0 +y 0 2 ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
29 The Simple Pendulum The Lagrangian L d (x, y) = τ ( 1 2 ( y x True Values of Lagrangian Parameters τ ) 2 ( ( x + y 1 cos 2 )) ). Using a Taylor approximation to the Lagrangian, we find that B A = 4 + τ 2 ( cos x0 +y 0 ) 2 4 τ 2 cos ( D x 0 +y 0 ), A = 4τ 2 y 0 x 0 Parameters Computed From Trajectories 2 sin ( x 0 +y 0 2 ) 4 τ 2 cos ( x 0 +y 0 2 I computed the parameters from the trajectories with Matlab. The graphs of B A + 1 and D A y 0 x 0 are on the following slides. ). Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
30 x Pendulum simulation at high energy B/A+1 0 D y 0 x 0 / A x Pendulum Position Time Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
31 x Pendulum simulation at high energy with noise B/A+1 0 D y 0 x 0 / A x Pendulum Position Time Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
32 x Pendulum simulation at high energy with noise B/A+1 0 D y 0 x 0 / A x Pendulum Position Time Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
33 x Pendulum simulation at high energy with noise B/A+1 0 D y 0 x 0 / A x Pendulum Position Time Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
34 What Next? Future Directions Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
35 What Next? Future Directions Recover the Lagrangian from data of several trajectories, and then use it to predict new trajectories. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
36 What Next? Future Directions Recover the Lagrangian from data of several trajectories, and then use it to predict new trajectories. Investigate the best choices for τ s and σ. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
37 What Next? Future Directions Recover the Lagrangian from data of several trajectories, and then use it to predict new trajectories. Investigate the best choices for τ s and σ. Try adding other kinds of noise to the system. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
38 What Next? Future Directions Recover the Lagrangian from data of several trajectories, and then use it to predict new trajectories. Investigate the best choices for τ s and σ. Try adding other kinds of noise to the system. Try the method with real data. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
39 What Next? Future Directions Recover the Lagrangian from data of several trajectories, and then use it to predict new trajectories. Investigate the best choices for τ s and σ. Try adding other kinds of noise to the system. Try the method with real data. Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
40 What Next? Future Directions Recover the Lagrangian from data of several trajectories, and then use it to predict new trajectories. Investigate the best choices for τ s and σ. Try adding other kinds of noise to the system. Try the method with real data. Evan S. Gawlik, Patrick Mullen, Dmitry Pavlov, Jerrold E. Marsden, and Mathieu Desbrun, Geometric, variational discretization of continuum theories, Ari Stern and Mathieu Desbrun, Discrete geometric mechanics for variational time integrators, Discrete Differential Geometry: An Applied Introduction, 2006, pp Yakov Berchenko-Kogan (MIT) Uncovering the Lagrangian 7 January, / 13
Midterm Exam Solutions
Midterm Exam Solutions Computer Vision (J. Košecká) October 27, 2009 HONOR SYSTEM: This examination is strictly individual. You are not allowed to talk, discuss, exchange solutions, etc., with other fellow
More informationLaser sensors. Transmitter. Receiver. Basilio Bona ROBOTICA 03CFIOR
Mobile & Service Robotics Sensors for Robotics 3 Laser sensors Rays are transmitted and received coaxially The target is illuminated by collimated rays The receiver measures the time of flight (back and
More informationVisualizing Quaternions
Visualizing Quaternions Andrew J. Hanson Computer Science Department Indiana University Siggraph 1 Tutorial 1 GRAND PLAN I: Fundamentals of Quaternions II: Visualizing Quaternion Geometry III: Quaternion
More informationDifferentiability and Tangent Planes October 2013
Differentiability and Tangent Planes 14.4 04 October 2013 Differentiability in one variable. Recall for a function of one variable, f is differentiable at a f (a + h) f (a) lim exists and = f (a) h 0 h
More informationMore About Factoring Trinomials
Section 6.3 More About Factoring Trinomials 239 83. x 2 17x 70 x 7 x 10 Width of rectangle: Length of rectangle: x 7 x 10 Width of shaded region: 7 Length of shaded region: x 10 x 10 Area of shaded region:
More informationPartial Derivatives (Online)
7in x 10in Felder c04_online.tex V3 - January 21, 2015 9:44 A.M. Page 1 CHAPTER 4 Partial Derivatives (Online) 4.7 Tangent Plane Approximations and Power Series It is often helpful to use a linear approximation
More informationMotion Tracking and Event Understanding in Video Sequences
Motion Tracking and Event Understanding in Video Sequences Isaac Cohen Elaine Kang, Jinman Kang Institute for Robotics and Intelligent Systems University of Southern California Los Angeles, CA Objectives!
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn School of Mathematical Sciences Tel Aviv University Michael S. Floater Department of Informatics University of
More informationDense Image-based Motion Estimation Algorithms & Optical Flow
Dense mage-based Motion Estimation Algorithms & Optical Flow Video A video is a sequence of frames captured at different times The video data is a function of v time (t) v space (x,y) ntroduction to motion
More informationEE 701 ROBOT VISION. Segmentation
EE 701 ROBOT VISION Regions and Image Segmentation Histogram-based Segmentation Automatic Thresholding K-means Clustering Spatial Coherence Merging and Splitting Graph Theoretic Segmentation Region Growing
More informationAnnouncements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10
Announcements Assignment 2 due Tuesday, May 4. Edge Detection, Lines Midterm: Thursday, May 6. Introduction to Computer Vision CSE 152 Lecture 10 Edges Last Lecture 1. Object boundaries 2. Surface normal
More informationReview Initial Value Problems Euler s Method Summary
THE EULER METHOD P.V. Johnson School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 INITIAL VALUE PROBLEMS The Problem Posing a Problem 3 EULER S METHOD Method Errors 4 SUMMARY OUTLINE 1 REVIEW 2 INITIAL
More informationThe Distributive Property and Expressions Understand how to use the Distributive Property to Clear Parenthesis
Objective 1 The Distributive Property and Expressions Understand how to use the Distributive Property to Clear Parenthesis The Distributive Property The Distributive Property states that multiplication
More informationSIMULATION ENVIRONMENT PROPOSAL, ANALYSIS AND CONTROL OF A STEWART PLATFORM MANIPULATOR
SIMULATION ENVIRONMENT PROPOSAL, ANALYSIS AND CONTROL OF A STEWART PLATFORM MANIPULATOR Fabian Andres Lara Molina, Joao Mauricio Rosario, Oscar Fernando Aviles Sanchez UNICAMP (DPM-FEM), Campinas-SP, Brazil,
More informationCS-465 Computer Vision
CS-465 Computer Vision Nazar Khan PUCIT 9. Optic Flow Optic Flow Nazar Khan Computer Vision 2 / 25 Optic Flow Nazar Khan Computer Vision 3 / 25 Optic Flow Where does pixel (x, y) in frame z move to in
More informationTheory of Elasticity, Article 18, Generic 2D Stress Distributions
Theory of Elasticity, Article 18, Generic 2D Stress Distributions One approach to solve 2D continuum problems analytically is to use stress functions. Article 18 of the third edition of Theory of Elasticity
More informationImage features. Image Features
Image features Image features, such as edges and interest points, provide rich information on the image content. They correspond to local regions in the image and are fundamental in many applications in
More informationTopic 2.3: Tangent Planes, Differentiability, and Linear Approximations. Textbook: Section 14.4
Topic 2.3: Tangent Planes, Differentiability, and Linear Approximations Textbook: Section 14.4 Warm-Up: Graph the Cone & the Paraboloid paraboloid f (x, y) = x 2 + y 2 cone g(x, y) = x 2 + y 2 Do you notice
More informationVideo 11.1 Vijay Kumar. Property of University of Pennsylvania, Vijay Kumar
Video 11.1 Vijay Kumar 1 Smooth three dimensional trajectories START INT. POSITION INT. POSITION GOAL Applications Trajectory generation in robotics Planning trajectories for quad rotors 2 Motion Planning
More informationComputer Vision. Geometric Camera Calibration. Samer M Abdallah, PhD
Computer Vision Samer M Abdallah, PhD Faculty of Engineering and Architecture American University of Beirut Beirut, Lebanon Geometric Camera Calibration September 2, 2004 1 Computer Vision Geometric Camera
More information(1) Given the following system of linear equations, which depends on a parameter a R, 3x y + 5z = 2 4x + y + (a 2 14)z = a + 2
(1 Given the following system of linear equations, which depends on a parameter a R, x + 2y 3z = 4 3x y + 5z = 2 4x + y + (a 2 14z = a + 2 (a Classify the system of equations depending on the values of
More informationSavitsky-Golay Filters
Savitsky-Golay Filters Robert DeSerio March 24, 2008 References 1. Abraham Savitsky and Marcel J. E. Golay, Smoothing and differentiation of data by simplified least squares procedures, Anal. Chem. 36,
More informationPhysics 235 Chapter 6. Chapter 6 Some Methods in the Calculus of Variations
Chapter 6 Some Methods in the Calculus of Variations In this Chapter we focus on an important method of solving certain problems in Classical Mechanics. In many problems we need to determine how a system
More informationAdaptive Filters Algorithms (Part 2)
Adaptive Filters Algorithms (Part 2) Gerhard Schmidt Christian-Albrechts-Universität zu Kiel Faculty of Engineering Electrical Engineering and Information Technology Digital Signal Processing and System
More information3x 2 + 7x + 2. A 8-6 Factor. Step 1. Step 3 Step 4. Step 2. Step 1 Step 2 Step 3 Step 4
A 8-6 Factor. Step 1 3x 2 + 7x + 2 Step 2 Step 3 Step 4 3x 2 + 7x + 2 3x 2 + 7x + 2 Step 1 Step 2 Step 3 Step 4 Factor. 1. 3x 2 + 4x +1 = 2. 3x 2 +10x + 3 = 3. 3x 2 +13x + 4 = A 8-6 Name BDFM? Why? Factor.
More informationPRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING. 1. Introduction
PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING KELLER VANDEBOGERT AND CHARLES LANNING 1. Introduction Interior point methods are, put simply, a technique of optimization where, given a problem
More informationSYSTEMS OF NONLINEAR EQUATIONS
SYSTEMS OF NONLINEAR EQUATIONS Widely used in the mathematical modeling of real world phenomena. We introduce some numerical methods for their solution. For better intuition, we examine systems of two
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationThe Euler Equidimensional Equation ( 3.2)
The Euler Equidimensional Equation ( 3.) The Euler Equidimensional Equation ( 3.) The Euler Equidimensional Equation Definition The Euler equidimensional equation for the unknown function y with singular
More informationFactoring. Factor: Change an addition expression into a multiplication expression.
Factoring Factor: Change an addition expression into a multiplication expression. 1. Always look for a common factor a. immediately take it out to the front of the expression, take out all common factors
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More information6.801/866. Segmentation and Line Fitting. T. Darrell
6.801/866 Segmentation and Line Fitting T. Darrell Segmentation and Line Fitting Gestalt grouping Background subtraction K-Means Graph cuts Hough transform Iterative fitting (Next time: Probabilistic segmentation)
More informationLinear algebra deals with matrixes: two-dimensional arrays of values. Here s a matrix: [ x + 5y + 7z 9x + 3y + 11z
Basic Linear Algebra Linear algebra deals with matrixes: two-dimensional arrays of values. Here s a matrix: [ 1 5 ] 7 9 3 11 Often matrices are used to describe in a simpler way a series of linear equations.
More informationIntroduction to Programming for Engineers Spring Final Examination. May 10, Questions, 170 minutes
Final Examination May 10, 2011 75 Questions, 170 minutes Notes: 1. Before you begin, please check that your exam has 28 pages (including this one). 2. Write your name and student ID number clearly on your
More informationCS321 Introduction To Numerical Methods
CS3 Introduction To Numerical Methods Fuhua (Frank) Cheng Department of Computer Science University of Kentucky Lexington KY 456-46 - - Table of Contents Errors and Number Representations 3 Error Types
More informationRobotics. Lecture 5: Monte Carlo Localisation. See course website for up to date information.
Robotics Lecture 5: Monte Carlo Localisation See course website http://www.doc.ic.ac.uk/~ajd/robotics/ for up to date information. Andrew Davison Department of Computing Imperial College London Review:
More informationIntroduction to Machine Learning
Introduction to Machine Learning Maximum Margin Methods Varun Chandola Computer Science & Engineering State University of New York at Buffalo Buffalo, NY, USA chandola@buffalo.edu Chandola@UB CSE 474/574
More informationMAT 275 Laboratory 2 Matrix Computations and Programming in MATLAB
MATLAB sessions: Laboratory MAT 75 Laboratory Matrix Computations and Programming in MATLAB In this laboratory session we will learn how to. Create and manipulate matrices and vectors.. Write simple programs
More informationChapter 18. Geometric Operations
Chapter 18 Geometric Operations To this point, the image processing operations have computed the gray value (digital count) of the output image pixel based on the gray values of one or more input pixels;
More informationCS 565 Computer Vision. Nazar Khan PUCIT Lectures 15 and 16: Optic Flow
CS 565 Computer Vision Nazar Khan PUCIT Lectures 15 and 16: Optic Flow Introduction Basic Problem given: image sequence f(x, y, z), where (x, y) specifies the location and z denotes time wanted: displacement
More information18.02 Multivariable Calculus Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.02 Multivariable Calculus Fall 2007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.02 Problem Set 4 Due Thursday
More informationDISCRETE LINEAR FILTERS FOR METROLOGY
DISCRETE LINEAR FILTERS FOR METROLOGY M. Krystek 1, P.J. Scott and V. Srinivasan 3 1 Physikalisch-Technische Bundesanstalt, Braunschweig, Germany Taylor Hobson Ltd., Leicester, U.K. 3 IBM Corporation and
More informationWeek 5: Geometry and Applications
Week 5: Geometry and Applications Introduction Now that we have some tools from differentiation, we can study geometry, motion, and few other issues associated with functions of several variables. Much
More informationJacobian: Velocities and Static Forces 1/4
Jacobian: Velocities and Static Forces /4 Models of Robot Manipulation - EE 54 - Department of Electrical Engineering - University of Washington Kinematics Relations - Joint & Cartesian Spaces A robot
More information3D diagrams of Eurostag generator models for improved dynamic simulations
3D diagrams of Eurostag generator models for improved dynamic simulations Achieve online dynamic security analysis To make good network situations short-term forecast, initializing dynamic simulations
More informationComputer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11
Announcement Edge and Corner Detection Slides are posted HW due Friday CSE5A Lecture 11 Edges Corners Edge is Where Change Occurs: 1-D Change is measured by derivative in 1D Numerical Derivatives f(x)
More informationArtificial Intelligence for Robotics: A Brief Summary
Artificial Intelligence for Robotics: A Brief Summary This document provides a summary of the course, Artificial Intelligence for Robotics, and highlights main concepts. Lesson 1: Localization (using Histogram
More informationINSTITUTE OF AERONAUTICAL ENGINEERING
Name Code Class Branch Page 1 INSTITUTE OF AERONAUTICAL ENGINEERING : ROBOTICS (Autonomous) Dundigal, Hyderabad - 500 0 MECHANICAL ENGINEERING TUTORIAL QUESTION BANK : A7055 : IV B. Tech I Semester : MECHANICAL
More informationDubna 2018: lines on cubic surfaces
Dubna 2018: lines on cubic surfaces Ivan Cheltsov 20th July 2018 Lecture 1: projective plane Complex plane Definition A line in C 2 is a subset that is given by ax + by + c = 0 for some complex numbers
More informationMEI GeoGebra Tasks for AS Pure
Task 1: Coordinate Geometry Intersection of a line and a curve 1. Add a quadratic curve, e.g. y = x 2 4x + 1 2. Add a line, e.g. y = x 3 3. Use the Intersect tool to find the points of intersection of
More informationx n x n stepnumber k order r error constant C r+1 1/2 5/12 3/8 251/720 abs. stab. interval (α,0) /11-3/10
MATH 573 LECTURE NOTES 77 13.8. Predictor-corrector methods. We consider the Adams methods, obtained from the formula xn+1 xn+1 y(x n+1 y(x n ) = y (x)dx = f(x,y(x))dx x n x n by replacing f by an interpolating
More informationCS545 Contents IX. Inverse Kinematics. Reading Assignment for Next Class. Analytical Methods Iterative (Differential) Methods
CS545 Contents IX Inverse Kinematics Analytical Methods Iterative (Differential) Methods Geometric and Analytical Jacobian Jacobian Transpose Method Pseudo-Inverse Pseudo-Inverse with Optimization Extended
More information3D Geometry and Camera Calibration
3D Geometry and Camera Calibration 3D Coordinate Systems Right-handed vs. left-handed x x y z z y 2D Coordinate Systems 3D Geometry Basics y axis up vs. y axis down Origin at center vs. corner Will often
More informationLagrange multipliers. Contents. Introduction. From Wikipedia, the free encyclopedia
Lagrange multipliers From Wikipedia, the free encyclopedia In mathematical optimization problems, Lagrange multipliers, named after Joseph Louis Lagrange, is a method for finding the local extrema of a
More informationNonlinear Noise Reduction
Chapter 3 Nonlinear Noise Reduction Many natural and engineered systems generate nonlinear deterministic time series that are contaminated by random measurement or dynamic noise. Even clean time series
More informationFeature Tracking and Optical Flow
Feature Tracking and Optical Flow Prof. D. Stricker Doz. G. Bleser Many slides adapted from James Hays, Derek Hoeim, Lana Lazebnik, Silvio Saverse, who in turn adapted slides from Steve Seitz, Rick Szeliski,
More informationSchool of Computing University of Utah
School of Computing University of Utah Presentation Outline 1 2 3 4 Main paper to be discussed David G. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, IJCV, 2004. How to find useful keypoints?
More information10. Cartesian Trajectory Planning for Robot Manipulators
V. Kumar 0. Cartesian rajectory Planning for obot Manipulators 0.. Introduction Given a starting end effector position and orientation and a goal position and orientation we want to generate a smooth trajectory
More informationCS201 Computer Vision Camera Geometry
CS201 Computer Vision Camera Geometry John Magee 25 November, 2014 Slides Courtesy of: Diane H. Theriault (deht@bu.edu) Question of the Day: How can we represent the relationships between cameras and the
More informationMeshless Modeling, Animating, and Simulating Point-Based Geometry
Meshless Modeling, Animating, and Simulating Point-Based Geometry Xiaohu Guo SUNY @ Stony Brook Email: xguo@cs.sunysb.edu http://www.cs.sunysb.edu/~xguo Graphics Primitives - Points The emergence of points
More informationMath Homework 3
Math 0 - Homework 3 Due: Friday Feb. in class. Write on your paper the lab section you have registered for.. Staple the sheets together.. Solve exercise 8. of the textbook : Consider the following data:
More informationCamera calibration. Robotic vision. Ville Kyrki
Camera calibration Robotic vision 19.1.2017 Where are we? Images, imaging Image enhancement Feature extraction and matching Image-based tracking Camera models and calibration Pose estimation Motion analysis
More informationMath Lab 6: Powerful Fun with Power Series Representations of Functions Due noon Thu. Jan. 11 in class *note new due time, location for winter quarter
Matter & Motion Winter 2017 18 Name: Math Lab 6: Powerful Fun with Power Series Representations of Functions Due noon Thu. Jan. 11 in class *note new due time, location for winter quarter Goals: 1. Practice
More informationHeat Kernels and Diffusion Processes
Heat Kernels and Diffusion Processes Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Solving
More informationMotion detection Computing image motion Motion estimation Egomotion and structure from motion Motion classification
Time varying image analysis Motion detection Computing image motion Motion estimation Egomotion and structure from motion Motion classification Time-varying image analysis- 1 The problems Visual surveillance
More informationLecture 6: Chain rule, Mean Value Theorem, Tangent Plane
Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane Rafikul Alam Department of Mathematics IIT Guwahati Chain rule Theorem-A: Let x : R R n be differentiable at t 0 and f : R n R be differentiable
More informationLagrangian methods for the regularization of discrete ill-posed problems. G. Landi
Lagrangian methods for the regularization of discrete ill-posed problems G. Landi Abstract In many science and engineering applications, the discretization of linear illposed problems gives rise to large
More informationApprenticeship Learning for Reinforcement Learning. with application to RC helicopter flight Ritwik Anand, Nick Haliday, Audrey Huang
Apprenticeship Learning for Reinforcement Learning with application to RC helicopter flight Ritwik Anand, Nick Haliday, Audrey Huang Table of Contents Introduction Theory Autonomous helicopter control
More informationCOORDINATE GEOMETRY CHANGE OF AXES EXERCISE 1. The point to which the origin should be shifted in order to eliminate x and y terms in the equation 4x 9y 8x 36y 4 0 is (1, ) ( 4, ( 1,) 4) (1, ). In order
More informationFeature Tracking and Optical Flow
Feature Tracking and Optical Flow Prof. D. Stricker Doz. G. Bleser Many slides adapted from James Hays, Derek Hoeim, Lana Lazebnik, Silvio Saverse, who 1 in turn adapted slides from Steve Seitz, Rick Szeliski,
More informationGeometric Primitives. Chapter 5
Chapter 5 Geometric Primitives In this chapter, we discuss the basic geometric primitives we will use to represent the world in which our graphic objects live. As discussed at the beginning of this class,
More informationSOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS
SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS JIAN LIANG AND HONGKAI ZHAO Abstract. In this paper we present a general framework for solving partial differential equations on manifolds represented
More informationModule 4. Non-linear machine learning econometrics: Support Vector Machine
Module 4. Non-linear machine learning econometrics: Support Vector Machine THE CONTRACTOR IS ACTING UNDER A FRAMEWORK CONTRACT CONCLUDED WITH THE COMMISSION Introduction When the assumption of linearity
More informationPartial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives
In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really
More informationIntegrated Math I. IM1.1.3 Understand and use the distributive, associative, and commutative properties.
Standard 1: Number Sense and Computation Students simplify and compare expressions. They use rational exponents and simplify square roots. IM1.1.1 Compare real number expressions. IM1.1.2 Simplify square
More informationMathematics of a Multiple Omni-Directional System
Mathematics of a Multiple Omni-Directional System A. Torii A. Sugimoto A. Imiya, School of Science and National Institute of Institute of Media and Technology, Informatics, Information Technology, Chiba
More informationPlanar Robot Kinematics
V. Kumar lanar Robot Kinematics The mathematical modeling of spatial linkages is quite involved. t is useful to start with planar robots because the kinematics of planar mechanisms is generally much simpler
More informationShort on camera geometry and camera calibration
Short on camera geometry and camera calibration Maria Magnusson, maria.magnusson@liu.se Computer Vision Laboratory, Department of Electrical Engineering, Linköping University, Sweden Report No: LiTH-ISY-R-3070
More informationLocal and Global Minimum
Local and Global Minimum Stationary Point. From elementary calculus, a single variable function has a stationary point at if the derivative vanishes at, i.e., 0. Graphically, the slope of the function
More informationDeveloper s Tip. An Introduction to the Theory of Planar Failure. Concepts of Planar Rock Slope Failure
Developer s Tip An Introduction to the Theory of Planar Failure In this article we explain the basic concepts behind planar failure analysis of rock slopes. We also discuss the geometric conditions that
More informationFinite difference methods
Finite difference methods Siltanen/Railo/Kaarnioja Spring 8 Applications of matrix computations Applications of matrix computations Finite difference methods Spring 8 / Introduction Finite difference methods
More informationMEI Desmos Tasks for AS Pure
Task 1: Coordinate Geometry Intersection of a line and a curve 1. Add a quadratic curve, e.g. y = x² 4x + 1 2. Add a line, e.g. y = x 3 3. Select the points of intersection of the line and the curve. What
More informationFMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu
FMA901F: Machine Learning Lecture 3: Linear Models for Regression Cristian Sminchisescu Machine Learning: Frequentist vs. Bayesian In the frequentist setting, we seek a fixed parameter (vector), with value(s)
More informationRobotics (Kinematics) Winter 1393 Bonab University
Robotics () Winter 1393 Bonab University : most basic study of how mechanical systems behave Introduction Need to understand the mechanical behavior for: Design Control Both: Manipulators, Mobile Robots
More informationFloating-Point Numbers in Digital Computers
POLYTECHNIC UNIVERSITY Department of Computer and Information Science Floating-Point Numbers in Digital Computers K. Ming Leung Abstract: We explain how floating-point numbers are represented and stored
More informationThree-Dimensional Oceanic Flows from Eulerian Velocity Data
Second-year Ph.D. student, Applied Math and Scientific Computing Project Advisor: Kayo Ide Department of Atmospheric and Oceanic Science Center for Scientific Computation and Mathematical Modeling Earth
More informationEssay 1: Dimensional Analysis of Models and Data Sets: Similarity Solutions
Table of Contents Essay 1: Dimensional Analysis of Models and Data Sets: Similarity Solutions and Scaling Analysis 1 About dimensional analysis 4 1.1 Thegoalandtheplan... 4 1.2 Aboutthisessay... 5 2 Models
More informationCUDA GPGPU. Ivo Ihrke Tobias Ritschel Mario Fritz
CUDA GPGPU Ivo Ihrke Tobias Ritschel Mario Fritz Today 3 Topics Intro to CUDA (NVIDIA slides) How is the GPU hardware organized? What is the programming model? Simple Kernels Hello World Gaussian Filtering
More information521466S Machine Vision Assignment #3 Image Features
521466S Machine Vision Assignment #3 Image Features Spring 2018 This assignment explores feature detection, extraction, and matching. We will implement the well-known Harris corner detector and use Matlab
More informationComputer Vision I - Filtering and Feature detection
Computer Vision I - Filtering and Feature detection Carsten Rother 30/10/2015 Computer Vision I: Basics of Image Processing Roadmap: Basics of Digital Image Processing Computer Vision I: Basics of Image
More informationLecture 8: Jointly distributed random variables
Lecture : Jointly distributed random variables Random Vectors and Joint Probability Distributions Definition: Random Vector. An n-dimensional random vector, denoted as Z = (Z, Z,, Z n ), is a function
More informationModule 4F12: Computer Vision and Robotics Solutions to Examples Paper 2
Engineering Tripos Part IIB FOURTH YEAR Module 4F2: Computer Vision and Robotics Solutions to Examples Paper 2. Perspective projection and vanishing points (a) Consider a line in 3D space, defined in camera-centered
More informationComputer Vision I - Basics of Image Processing Part 1
Computer Vision I - Basics of Image Processing Part 1 Carsten Rother 28/10/2014 Computer Vision I: Basics of Image Processing Link to lectures Computer Vision I: Basics of Image Processing 28/10/2014 2
More informationMEI Casio Tasks for A2 Core
Task 1: Functions The Modulus Function The modulus function, abs(x), is found using OPTN > NUMERIC > Abs 2. Add the graph y = x, Y1=Abs(x): iyqfl 3. Add the graph y = ax+b, Y2=Abs(Ax+B): iyqaff+agl 4.
More informationAuto-Extraction of Modelica Code from Finite Element Analysis or Measurement Data
Auto-Extraction of Modelica Code from Finite Element Analysis or Measurement Data The-Quan Pham, Alfred Kamusella, Holger Neubert OptiY ek, Aschaffenburg Germany, e-mail: pham@optiyeu Technische Universität
More informationIndustrial Robots : Manipulators, Kinematics, Dynamics
Industrial Robots : Manipulators, Kinematics, Dynamics z z y x z y x z y y x x In Industrial terms Robot Manipulators The study of robot manipulators involves dealing with the positions and orientations
More informationChapter 2. MathScript
Chapter 2. MathScript 2.1 What is MathScript MathScript is math-oriented, text-based computing language to address tasks mathematic calculation: Most suitable for Mathematic calculation. Matrix based data
More informationParallel and perspective projections such as used in representing 3d images.
Chapter 5 Rotations and projections In this chapter we discuss Rotations Parallel and perspective projections such as used in representing 3d images. Using coordinates and matrices, parallel projections
More informationMatching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar.
Matching Compare region of image to region of image. We talked about this for stereo. Important for motion. Epipolar constraint unknown. But motion small. Recognition Find object in image. Recognize object.
More informationEstimating normal vectors and curvatures by centroid weights
Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National
More information