Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
|
|
- David Rose
- 5 years ago
- Views:
Transcription
1 Proessor William Ho Dept o Electrical Engineering &Computer Science
2 Pose Estimation
3 Model based Pose Estimation Problem Statement Given We have an image o an object We know the model geometry o the object (speciically, the location o eatures on the object) We have ound the corresponding eatures in the image Find The position and orientation (pose) o the object with respect to the camera # points needed? Assumptions Object is rigid (so 6 only degrees o reedom) Camera intrinsic parameters are known We will ind the pose that minimizes the squared error o the predicted locations o the image eatures, to the measured locations {M} C we want M H 3
4 Least Squares Pose Estimation Let y = () is a vector o the unknown pose parameters y y is a unction that returns the predicted image z points y, given the pose y y, t y0 is a vector o the actual observed image points t y We want to ind to minimize E = () y0 tz Algorithm:. We start with a guess or, call it 0. Compute y = (). Residual error is dy = y y0 3. Calculate Jacobian o, J = [ / ], and evaluate it at. We now have dy = Jd 4. Solve or d using pseudo inverse d = (J T J) J T dy 5. Set <= + d 6. Repeat steps 5 until convergence (no more change in ) y 4
5 Recall Perspective Projection Projection o a 3D point W P in the world to a point in the piel image ( im,y im ) Where the etrinsic parameter matri is Or, i we use model instead o world rame or the point: /, /, y Z Y X im im W et K M X C C et W Worg Y Z r r r t r r r t r r r t M R t y y c c K And the intrinsic parameter matri ~ P K M p W et P R K P K M p M Morg C C M M et t ~ 5
6 Recall XYZ ied angle convention R = Rz Ry R, where RZ cosz sinz 0 sin cos 0 Z Z 0 0 R Y cosy 0 siny 0 0 siny 0 cos Y R X cos sin X X 0 sin X cos X Matlab R = [ 0 0; 0 cos(a) -sin(a); 0 sin(a) cos(a)]; Ry = [ cos(ay) 0 sin(ay); 0 0; -sin(ay) 0 cos(ay)]; Rz = [ cos(az) -sin(az) 0; sin(az) cos(az) 0; 0 0 ]; R = Rz * Ry * R ote in general, the angle ais convention would be better to use than XYZ angles 6
7 Function to project one point Write a unction to project a 3D point P_M in model coordinates to image point p, given the model to camera pose = (a,ay,az,t,ty,tz) P_M = [X;Y;Z;] is the input point = [a;ay;az;t;ty;tz] is the vector o model to camera pose parameters K = intrinsic camera matri p = [;y] is the output point unction p = Project(, P_M, K) % Project 3D point onto image % Get pose params a = (); ay = (); az = (3); t = (4); ty = (5); tz = (6); % Rotation matri, model to camera R = [ 0 0; 0 cos(a) -sin(a); 0 sin(a) cos(a)]; Ry = [ cos(ay) 0 sin(ay); 0 0; -sin(ay) 0 cos(ay)]; Rz = [ cos(az) -sin(az) 0; sin(az) cos(az) 0; 0 0 ]; R = Rz * Ry * R; % Etrinsic camera matri Met = [ R [t;ty;tz] ]; % Project point ph = K*Met*P_M; ph = ph/ph(3); p = ph(:); return 7
8 Function to transorm a set o points ow modiy the unction to transorm a set o points P_M = is a set o input points = [a;ay;az;t;ty;tz] is the pose K = intrinsic camera matri p = [;y;;y; ] are the output points unction p = Project(, P_M, K) 8 M Z Z Z Y Y Y X X X P y y y p
9 Function to transorm a set o points unction p = Project(, P_M, K) % Project 3D points onto image % Get pose params a = (); ay = (); az = (3); t = (4); ty = (5); tz = (6); % Rotation matri, model to camera R = [ 0 0; 0 cos(a) -sin(a); 0 sin(a) cos(a)]; Ry = [ cos(ay) 0 sin(ay); 0 0; -sin(ay) 0 cos(ay)]; Rz = [ cos(az) -sin(az) 0; sin(az) cos(az) 0; 0 0 ]; R = Rz * Ry * R; % Etrinsic camera matri Met = [ R [t;ty;tz] ]; % Project points ph = K*Met*P_M; % Divide through 3rd element o each column ph(,:) = ph(,:)./ph(3,:); ph(,:) = ph(,:)./ph(3,:); ph = ph(:,:); % Get rid o 3rd row p = reshape(ph, [], ); % reshape into vector return 9
10 Eample Focal length in piels: 75 Image center (,y): (354, 45) 0
11 clear all close all I = imread('img_rect.ti'); imshow(i, []) Eample % These are the points in the model's coordinate system (inches) P_M = [ ; ; ; ]; % Deine camera parameters = 75; % ocal length in piels c = 354; cy = 45; K = [ 0 c; 0 cy; 0 0 ]; % intrinsic parameter matri y0 = [ 83; 47; % 350; 33; % 454; 44; % 3 76; 58; % 4 339; 75; % 5 444; 86 ]; % 6 % Make an initial guess o the pose [a ay az t ty tz] = [.5; -.0; 0.0; 0; 0; 30]; % Get predicted image points by substituting in the current pose y = Project(, P_M, K); or i=::length(y) rectangle('position', [y(i)-8 y(i+)-8 6 6], 'FaceColor', 'r'); end
12 Computing Jacobian umerically We approimate the derivatives Matlab code: ) ( ) ˆ ( ) ( u i i M M M j i J y = Project(,P_M,K); e = ; % a tiny number J(:,) = ( Project(+[e;0;0;0;0;0],P_M,K) y )/e; J(:,) = ( Project(+[0;e;0;0;0;0],P_M,K) y )/e; J(:,3) = ( Project(+[0;0;e;0;0;0],P_M,K) y )/e; J(:,4) = ( Project(+[0;0;0;e;0;0],P_M,K) y )/e; J(:,5) = ( Project(+[0;0;0;0;e;0],P_M,K) y )/e; J(:,6) = ( Project(+[0;0;0;0;0;e],P_M,K) y )/e;
13 We have y0 = observations or measurements 0 = a guess or y = () is a non linear unction. Initialize to 0. Compute y = (). Residual error is dy = y y0 3. Calculate Jacobian o, evaluate it at. We now have dy = Jd 4. Solve or d using pseudo inverse d = (J T J) J T dy 5. Set <= + d 6. Repeat steps 5 until convergence (no more change in ) or i=:0 print('\niteration %d\ncurrent pose:\n', i); disp(); % Get predicted image points y = Project(, P_M, K); imshow(i, []) or i=::length(y) rectangle('position', [y(i)-8 y(i+)-8 6 6],... 'FaceColor', 'r'); end pause(); % Estimate Jacobian e = ; % a tiny number : % Error is observed image points - predicted image points dy = y0 - y; print('residual error: %\n', norm(dy)); % Ok, now we have a system o linear equations dy = J d % Solve or d using the pseudo inverse d = pinv(j) * dy; % Stop i parameters are no longer changing i abs( norm(d)/norm() ) < e-6 break; end end = + d; % Update pose estimate 3
14 or i=:0 print('\niteration %d\ncurrent pose:\n', i); disp(); % Get predicted image points y = Project(, P_M, K); imshow(i, []) or i=::length(y) rectangle('position', [y(i)-8 y(i+)-8 6 6],... 'FaceColor', 'r'); end pause(); % Estimate Jacobian e = ; % a tiny number J(:,) = ( Project(+[e;0;0;0;0;0],P_M,K) - y )/e; J(:,) = ( Project(+[0;e;0;0;0;0],P_M,K) - y )/e; J(:,3) = ( Project(+[0;0;e;0;0;0],P_M,K) - y )/e; J(:,4) = ( Project(+[0;0;0;e;0;0],P_M,K) - y )/e; J(:,5) = ( Project(+[0;0;0;0;e;0],P_M,K) - y )/e; J(:,6) = ( Project(+[0;0;0;0;0;e],P_M,K) - y )/e; % Error is observed image points - predicted image points dy = y0 - y; print('residual error: %\n', norm(dy)); % Ok, now we have a system o linear equations dy = J d % Solve or d using the pseudo inverse d = pinv(j) * dy; % Stop i parameters are no longer changing i abs( norm(d)/norm() ) < e-6 break; end = + d; % Update pose estimate end 4
15 Overlaying Graphical Model As a check, overlay a graphical model onto the image I you don t have a model, you can display the model s coordinate aes a=.55 ay=-0.83 az=0.0 t=0.9 ty=3.0 tz=8.3 % Draw coordinate aes onto the image. Scale the length o the aes % according to the size o the model, so that the aes are visible. W = ma(p_m,[],) - min(p_m,[],); % Size o model in X,Y,Z W = norm(w); % Length o the diagonal o the bounding bo u0 = Project(, [0;0;0;], K); % origin ux = Project(, [W/5;0;0;], K); % unit X vector uy = Project(, [0;W/5;0;], K); % unit Y vector uz = Project(, [0;0;W/5;], K); % unit Z vector line([u0() ux()], [u0() ux()], 'Color', 'r', 'LineWidth', 3); line([u0() uy()], [u0() uy()], 'Color', 'g', 'LineWidth', 3); line([u0() uz()], [u0() uz()], 'Color', 'b', 'LineWidth', 3); % Also print the pose onto the image. tet(30,450,sprint('a=%. ay=%. az=%. t=%. ty=%. tz=%.',... (), (), (3), (4), (5), (6)),... 'BackgroundColor', 'w', 'FontSize', 5); 5
16 Other images Try inding the pose o the bo in the other two images How close (approimately) does the initial guess have to be? img_rect.ti img3_rect.ti 6
Image Processing. Cosimo Distante. Lecture : Alignment (cont d)
Image Pocessing Cosimo Distante Lectue : Alignment (cont d) Othe Pose es
More informationCAP 5415 Computer Vision Fall 2011
CAP 545 Computer Vision Fall 2 Dr. Mubarak Sa Univ. o Central Florida www.cs.uc.edu/~vision/courses/cap545/all22 Oice 247-F HEC Filtering Lecture-2 General Binary Gray Scale Color Binary Images Y Row X
More informationCAP 5415 Computer Vision
CAP 545 Computer Vision Dr. Mubarak Sa Univ. o Central Florida Filtering Lecture-2 Contents Filtering/Smooting/Removing Noise Convolution/Correlation Image Derivatives Histogram Some Matlab Functions General
More informationAssignment #9: Orthogonal Projections, Gram-Schmidt, and Least Squares. Name:
Assignment 9: Orthogonal Projections, Gram-Schmidt, and Least Squares Due date: Friday, April 0, 08 (:pm) Name: Section Number Assignment 9: Orthogonal Projections, Gram-Schmidt, and Least Squares Due
More informationLab on Taylor Polynomials. This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor.
Lab on Taylor Polynomials This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor. In this Lab we will approimate complicated unctions by simple unctions. The
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Proeor William Ho Dept o Electrical Engineering &Computer Science http://inide.mine.edu/~who/ Uncertaint Uncertaint Let a that we have computed a reult (uch a poe o an object), rom image data How do we
More informationTwo conventions for coordinate systems. Left-Hand vs Right-Hand. x z. Which is which?
walters@buffalo.edu CSE 480/580 Lecture 2 Slide 3-D Transformations 3-D space Two conventions for coordinate sstems Left-Hand vs Right-Hand (Thumb is the ais, inde is the ais) Which is which? Most graphics
More informationLecture 8 Optimization
4/9/015 Lecture 8 Optimization EE 4386/5301 Computational Methods in EE Spring 015 Optimization 1 Outline Introduction 1D Optimization Parabolic interpolation Golden section search Newton s method Multidimensional
More informationMath 2412 Activity 1(Due by EOC Sep. 17)
Math 4 Activity (Due by EOC Sep. 7) Determine whether each relation is a unction.(indicate why or why not.) Find the domain and range o each relation.. 4,5, 6,7, 8,8. 5,6, 5,7, 6,6, 6,7 Determine whether
More informationMOL 410/510: Introduction to Biological Dynamics Fall 2012 Problem Set #4, Nonlinear Dynamical Systems (due 10/19/2012) 6 MUST DO Questions, 1
MOL 410/510: Introduction to Biological Dynamics Fall 2012 Problem Set #4, Nonlinear Dynamical Systems (due 10/19/2012) 6 MUST DO Questions, 1 OPTIONAL question 1. Below, several phase portraits are shown.
More informationCamera calibration. Outline. Pinhole camera. Camera projection models. Nonlinear least square methods A camera calibration tool
Outline Camera calibration Camera projection models Camera calibration i Nonlinear least square methods A camera calibration tool Applications Digital Visual Effects Yung-Yu Chuang with slides b Richard
More informationMA3232 Numerical Analysis Week 9. James Cooley (1926-)
MA umerical Analysis Week 9 James Cooley (96-) James Cooley is an American mathematician. His most significant contribution to the world of mathematics and digital signal processing is the Fast Fourier
More informationGOVERNMENT OF KARNATAKA KARNATAKA STATE PRE-UNIVERSITY EDUCATION EXAMINATION BOARD SCHEME OF VALUATION. Subject : MATHEMATICS Subject Code : 35
GOVERNMENT OF KARNATAKA KARNATAKA STATE PRE-UNIVERSITY EDUCATION EXAMINATION BOARD II YEAR PUC EXAMINATION MARCH APRIL 0 SCHEME OF VALUATION Subject : MATHEMATICS Subject Code : 5 PART A Write the prime
More informationSyllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function.
Precalculus Notes: Unit Polynomial Functions Syllabus Objective:.9 The student will sketch the graph o a polynomial, radical, or rational unction. Polynomial Function: a unction that can be written in
More information9.1 The Square Root Function
Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section
More informationMATH 307: Problem Set #3 Solutions
: Problem Set #3 Solutions Due on: May 3, 2015 Problem 1 Autonomous Equations Recall that an equilibrium solution of an autonomous equation is called stable if solutions lying on both sides of it tend
More informationMAT1332 Assignment #5 solutions
1 MAT133 Assignment #5 solutions Question 1 Determine the solution of the following systems : a) x + y + z = x + 3y + z = 5 x + 9y + 7z = 1 The augmented matrix associated to this system is 1 1 1 3 5.
More informationis the intuition: the derivative tells us the change in output y (from f(b)) in response to a change of input x at x = b.
Uses of differentials to estimate errors. Recall the derivative notation df d is the intuition: the derivative tells us the change in output y (from f(b)) in response to a change of input at = b. Eamples.
More informationMath Review and Lessons in Calculus
Math Review and Lessons in Calculus Agenda Rules o Eponents Functions Inverses Limits Calculus Rules o Eponents 0 Zero Eponent Rule a * b ab Product Rule * 3 5 a / b a-b Quotient Rule 5 / 3 -a / a Negative
More informationChapter 12: Iterative Methods
ES 40: Scientific and Engineering Computation. Uchechukwu Ofoegbu Temple University Chapter : Iterative Methods ES 40: Scientific and Engineering Computation. Gauss-Seidel Method The Gauss-Seidel method
More informationM151B Practice Problems for Exam 1
M151B Practice Problems for Eam 1 Calculators will not be allowed on the eam. Unjustified answers will not receive credit. 1. Compute each of the following its: 1a. 1b. 1c. 1d. 1e. 1 3 4. 3. sin 7 0. +
More informationMultivariate Calculus Solution 1
Math Camp Multivariate Calculus Solution Hessian Matrices Math Camp In st semester micro, you will solve general equilibrium models. Sometimes when solving these models it is useful to see if utility functions
More informationRigid Body Transforms-3D. J.C. Dill transforms3d 27Jan99
ESC 489 3D ransforms 1 igid Bod ransforms-3d J.C. Dill transforms3d 27Jan99 hese notes on (2D and) 3D rigid bod transform are currentl in hand-done notes which are being converted to this file from that
More information1 HOMOGENEOUS TRANSFORMATIONS
HOMOGENEOUS TRANSFORMATIONS Purpose: The purpose of this chapter is to introduce ou to the Homogeneous Transformation. This simple 4 4 transformation is used in the geometr engines of CAD sstems and in
More informationMidterm Solutions. EE127A L. El Ghaoui 3/19/11
EE27A L. El Ghaoui 3/9/ Midterm Solutions. (6 points Find the projection z of the vector = (2, on the line that passes through 0 = (, 2 and with direction given by the vector u = (,. Solution: The line
More informationUnit #11 - Integration by Parts, Average of a Function
Unit # - Integration by Parts, Average of a Function Some problems and solutions selected or adapted from Hughes-Hallett Calculus. Integration by Parts. For each of the following integrals, indicate whether
More informationTransformations. Chapter D Transformations Translation
Chapter 4 Transformations Transformations between arbitrary vector spaces, especially linear transformations, are usually studied in a linear algebra class. Here, we focus our attention to transformation
More informationTopic 4b. Open Methods for Root Finding
Course Instructor Dr. Ramond C. Rump Oice: A 337 Phone: (915) 747 6958 E Mail: rcrump@utep.edu Topic 4b Open Methods or Root Finding EE 4386/5301 Computational Methods in EE Outline Open Methods or Root
More informationFormulas to remember
Complex numbers Let z = x + iy be a complex number The conjugate z = x iy Formulas to remember The real part Re(z) = x = z+z The imaginary part Im(z) = y = z z i The norm z = zz = x + y The reciprocal
More informationCLASS NOTES Computational Methods for Engineering Applications I Spring 2015
CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 Petros Koumoutsakos Gerardo Tauriello (Last update: July 2, 2015) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material
More informationPolynomials, Linear Factors, and Zeros. Factor theorem, multiple zero, multiplicity, relative maximum, relative minimum
Polynomials, Linear Factors, and Zeros To analyze the actored orm o a polynomial. To write a polynomial unction rom its zeros. Describe the relationship among solutions, zeros, - intercept, and actors.
More informationWe would now like to turn our attention to a specific family of functions, the one to one functions.
9.6 Inverse Functions We would now like to turn our attention to a speciic amily o unctions, the one to one unctions. Deinition: One to One unction ( a) (b A unction is called - i, or any a and b in the
More informationLECTURE 7. Least Squares and Variants. Optimization Models EE 127 / EE 227AT. Outline. Least Squares. Notes. Notes. Notes. Notes.
Optimization Models EE 127 / EE 227AT Laurent El Ghaoui EECS department UC Berkeley Spring 2015 Sp 15 1 / 23 LECTURE 7 Least Squares and Variants If others would but reflect on mathematical truths as deeply
More informationHomework 2 Solutions, MAP 6505, Fall 18. = lim
Homework 2 Solutions, MAP 655, Fall 18 1. Let {a k } R be a sequence. Investigate the convergence of the series a kδ (k) ( k) in the space of distributions D (R) and, as an etra credit, in the space of
More informationSection A brief on transformations
Section 127 A brief on transformations consider the transformation another name for it: change of variable x = rcosθ The determinant y = rsinθ r y r is called the Jacobian determinant of x,y with respect
More informationBASIC MATHEMATICS - XII SET - I
BASIC MATHEMATICS - XII Grade: XII Subject: Basic Mathematics F.M.:00 Time: hrs. P.M.: 40 Candidates are required to give their answers in their own words as far as practicable. The figures in the margin
More informationChapter 9. Derivatives. Josef Leydold Mathematical Methods WS 2018/19 9 Derivatives 1 / 51. f x. (x 0, f (x 0 ))
Chapter 9 Derivatives Josef Leydold Mathematical Methods WS 208/9 9 Derivatives / 5 Difference Quotient Let f : R R be some function. The the ratio f = f ( 0 + ) f ( 0 ) = f ( 0) 0 is called difference
More informationGeometric Image Manipulation. Lecture #4 Wednesday, January 24, 2018
Geometric Image Maniplation Lectre 4 Wednesda, Janar 4, 08 Programming Assignment Image Maniplation: Contet To start with the obvios, an image is a D arra of piels Piel locations represent points on the
More information3.3.1 Linear functions yet again and dot product In 2D, a homogenous linear scalar function takes the general form:
3.3 Gradient Vector and Jacobian Matri 3 3.3 Gradient Vector and Jacobian Matri Overview: Differentiable functions have a local linear approimation. Near a given point, local changes are determined by
More informationSection 3.4: Concavity and the second Derivative Test. Find any points of inflection of the graph of a function.
Unit 3: Applications o Dierentiation Section 3.4: Concavity and the second Derivative Test Determine intervals on which a unction is concave upward or concave downward. Find any points o inlection o the
More informationHomogeneous Transformations
Purpose: Homogeneous Transformations The purpose of this chapter is to introduce you to the Homogeneous Transformation. This simple 4 x 4 transformation is used in the geometry engines of CAD systems and
More informationPart I: Thin Converging Lens
Laboratory 1 PHY431 Fall 011 Part I: Thin Converging Lens This eperiment is a classic eercise in geometric optics. The goal is to measure the radius o curvature and ocal length o a single converging lens
More informationOptimization and Calculus
Optimization and Calculus To begin, there is a close relationship between finding the roots to a function and optimizing a function. In the former case, we solve for x. In the latter, we solve: g(x) =
More information18-660: Numerical Methods for Engineering Design and Optimization
8-66: Numerical Methods or Engineering Design and Optimization Xin Li Department o ECE Carnegie Mellon University Pittsburgh, PA 53 Slide Overview Linear Regression Ordinary least-squares regression Minima
More informationChapter 6: Extending Periodic Functions
Chapter 6: Etending Periodic Functions Lesson 6.. 6-. a. The graphs of y = sin and y = intersect at many points, so there must be more than one solution to the equation. b. There are two solutions. From
More informationChapter 4 Imaging. Lecture 21. d (110) Chem 793, Fall 2011, L. Ma
Chapter 4 Imaging Lecture 21 d (110) Imaging Imaging in the TEM Diraction Contrast in TEM Image HRTEM (High Resolution Transmission Electron Microscopy) Imaging or phase contrast imaging STEM imaging a
More informationCalculus IV - HW 2 MA 214. Due 6/29
Calculus IV - HW 2 MA 214 Due 6/29 Section 2.5 1. (Problems 3 and 5 from B&D) The following problems involve differential equations of the form dy = f(y). For each, sketch the graph of f(y) versus y, determine
More informationAnswers and Solutions to Section 13.3 Homework Problems 1-23 (odd) and S. F. Ellermeyer. f dr
Answers and Solutions to Section 13.3 Homework Problems 1-23 (odd) and 29-33 S. F. Ellermeyer 1. By looking at the picture in the book, we see that f dr 5 1 4. 3. For the vector field Fx,y 6x 5yi 5x 4yj,
More information4 An Introduction to Channel Coding and Decoding over BSC
4 An Introduction to Channel Coding and Decoding over BSC 4.1. Recall that channel coding introduces, in a controlled manner, some redundancy in the (binary information sequence that can be used at the
More informationConsider the function f(x, y). Recall that we can approximate f(x, y) with a linear function in x and y:
Taylor s Formula Consider the unction (x, y). Recall that we can approximate (x, y) with a linear unction in x and y: (x, y) (a, b)+ x (a, b)(x a)+ y (a, b)(y b) Notice that again this is just a linear
More informationDealing with Rotating Coordinate Systems Physics 321. (Eq.1)
Dealing with Rotating Coordinate Systems Physics 321 The treatment of rotating coordinate frames can be very confusing because there are two different sets of aes, and one set of aes is not constant in
More informationIteration & Fixed Point
Iteration & Fied Point As a method for finding the root of f this method is difficult, but it illustrates some important features of iterstion. We could write f as f g and solve g. Definition.1 (Fied Point)
More information5.2 - Euler s Method
5. - Euler s Method Consider solving the initial-value problem for ordinary differential equation: (*) y t f t, y, a t b, y a. Let y t be the unique solution of the initial-value problem. In the previous
More informationSolutions for the Practice Final - Math 23B, 2016
olutions for the Practice Final - Math B, 6 a. True. The area of a surface is given by the expression d, and since we have a parametrization φ x, y x, y, f x, y with φ, this expands as d T x T y da xy
More informationIntroduction to Transverse Beam Optics. II.) Twiss Parameters & Lattice Design
Introduction to Transverse Beam Optics Bernhard Holzer, CERN II.) Twiss Parameters & Lattice esign ( Z X Y) Bunch in a storage ring Introduction to Transverse Beam Optics Bernhard Holzer, CERN... don't
More informationMath-2 Lesson 2-4. Radicals
Math- Lesson - Radicals = What number is equivalent to the square root of? Square both sides of the equation ( ) ( ) = = = is an equivalent statement to = 1.7 1.71 1.70 1.701 1.7008... There is no equivalent
More informationR- and C-Differentiability
Lecture 2 R- and C-Differentiability Let z = x + iy = (x,y ) be a point in C and f a function defined on a neighbourhood of z (e.g., on an open disk (z,r) for some r > ) with values in C. Write f (z) =
More informationGaussian integrals. Calvin W. Johnson. September 9, The basic Gaussian and its normalization
Gaussian integrals Calvin W. Johnson September 9, 24 The basic Gaussian and its normalization The Gaussian function or the normal distribution, ep ( α 2), () is a widely used function in physics and mathematical
More informationPose Tracking II! Gordon Wetzstein! Stanford University! EE 267 Virtual Reality! Lecture 12! stanford.edu/class/ee267/!
Pose Tracking II! Gordon Wetzstein! Stanford University! EE 267 Virtual Reality! Lecture 12! stanford.edu/class/ee267/!! WARNING! this class will be dense! will learn how to use nonlinear optimization
More informationAffine transformations. Brian Curless CSE 557 Fall 2014
Affine transformations Brian Curless CSE 557 Fall 2014 1 Reading Required: Shirle, Sec. 2.4, 2.7 Shirle, Ch. 5.1-5.3 Shirle, Ch. 6 Further reading: Fole, et al, Chapter 5.1-5.5. David F. Rogers and J.
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationHOMEWORK SOLUTIONS MATH 1910 Sections 6.1, 6.2, 6.3 Fall 2016
HOMEWORK SOLUTIONS MATH 191 Sections.1,.,. Fall 1 Problem.1.19 Find the area of the shaded region. SOLUTION. The equation of the line passing through ( π, is given by y 1() = π, and the equation of the
More informationB.Tech. Theory Examination (Semester IV) Engineering Mathematics III
Solved Question Paper 5-6 B.Tech. Theory Eamination (Semester IV) 5-6 Engineering Mathematics III Time : hours] [Maimum Marks : Section-A. Attempt all questions of this section. Each question carry equal
More informationQuality control of risk measures: backtesting VAR models
De la Pena Q 9/2/06 :57 pm Page 39 Journal o Risk (39 54 Volume 9/Number 2, Winter 2006/07 Quality control o risk measures: backtesting VAR models Victor H. de la Pena* Department o Statistics, Columbia
More informationMathematics 1. Part II: Linear Algebra. Exercises and problems
Bachelor Degree in Informatics Engineering Barcelona School of Informatics Mathematics Part II: Linear Algebra Eercises and problems February 5 Departament de Matemàtica Aplicada Universitat Politècnica
More informationOPTIMAL PLACEMENT AND UTILIZATION OF PHASOR MEASUREMENTS FOR STATE ESTIMATION
OPTIMAL PLACEMENT AND UTILIZATION OF PHASOR MEASUREMENTS FOR STATE ESTIMATION Xu Bei, Yeo Jun Yoon and Ali Abur Teas A&M University College Station, Teas, U.S.A. abur@ee.tamu.edu Abstract This paper presents
More informationIntroduction to Data Mining
Introduction to Data Mining Lecture #21: Dimensionality Reduction Seoul National University 1 In This Lecture Understand the motivation and applications of dimensionality reduction Learn the definition
More information5.5 Volumes: Tubes. The Tube Method. = (2π [radius]) (height) ( x k ) = (2πc k ) f (c k ) x k. 5.5 volumes: tubes 435
5.5 volumes: tubes 45 5.5 Volumes: Tubes In Section 5., we devised the disk method to find the volume swept out when a region is revolved about a line. To find the volume swept out when revolving a region
More informationMultivariable Calculus Midterm 2 Solutions John Ross
Multivariable Calculus Midterm Solutions John Ross Problem.: False. The double integral is not the same as the iterated integral. In particular, we have shown in a HW problem (section 5., number 9) that
More information( ) ( ) = (2) u u u v v v w w w x y z x y z x y z. Exercise [17.09]
Eercise [17.09] Suppose is a region of (Newtonian) space, defined at a point in time t 0. Let T(t,r) be the position at time t of a test particle (of insignificantly tiny mass) that begins at rest at point
More informationComputational Optimization. Constrained Optimization Part 2
Computational Optimization Constrained Optimization Part Optimality Conditions Unconstrained Case X* is global min Conve f X* is local min SOSC f ( *) = SONC Easiest Problem Linear equality constraints
More informationUniversity of Alberta ENGM 541: Modeling and Simulation of Engineering Systems Laboratory #5
University of Alberta ENGM 54: Modeling and Simulation of Engineering Systems Laboratory #5 M.G. Lipsett, Updated 00 Integration Methods with Higher-Order Truncation Errors with MATLAB MATLAB is capable
More informationIntroduction to Compact Dynamical Modeling. II.1 Steady State Simulation. Luca Daniel Massachusetts Institute of Technology. dx dt.
Course Outline NS & NIH Introduction to Compact Dynamical Modeling II. Steady State Simulation uca Daniel Massachusetts Institute o Technology Quic Snea Preview I. ssembling Models rom Physical Problems
More informationg(2, 1) = cos(2π) + 1 = = 9
1. Let gx, y 2x 2 cos2πy 2 + y 2. You can use the fact that Dg2, 1 [8 2]. a Find an equation for the tangent plane to the graph z gx, y at the point 2, 1. There are two key parts to this problem. The first,
More informationSection 1.2 Domain and Range
Section 1. Domain and Range 1 Section 1. Domain and Range One o our main goals in mathematics is to model the real world with mathematical unctions. In doing so, it is important to keep in mind the limitations
More informationUnit 5 Applications of Antidifferentiation
Warmup 1) If f ( ) cos(ln ) for > 0, then f () (a) sin(ln ) (b) sin(ln ) (c) sin(ln ) (d) sin(ln ) (e) ln sin 2) If f ( ) 2, then f () (a) 2 ( ln 2) (b) 2 (1 ln 2) (c) 2 ln 2 (d) 2 (1 ln 2) (e) 2 (1 ln
More informationSTRAIGHT LINE GRAPHS. Lesson. Overview. Learning Outcomes and Assessment Standards
STRAIGHT LINE GRAPHS Learning Outcomes and Assessment Standards Lesson 15 Learning Outcome : Functions and Algebra The learner is able to investigate, analse, describe and represent a wide range o unctions
More informationSAMPLE QUESTION PAPER MATHEMATICS (041) CLASS XII
SAMPLE QUESTION PAPER MATHEMATICS (01) CLASS XII 017-18 Time allowed: hours Maimum Marks: 100 General Instructions: (i) All questions are compulsory. (ii) This question paper contains 9 questions. (iii)
More informationCartesian Coordinates, Points, and Transformations
Cartesian Coordinates, Points, and Transformations CIS - 600.445 Russell Taylor Acknowledgment: I would like to thank Ms. Sarah Graham for providing some of the material in this presentation Femur Planned
More informationDefinition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.
8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections.6 and.) 8. Equivalent Inequalities Definition 8. Two inequalities are equivalent
More informationMATH 307 Introduction to Differential Equations Autumn 2017 Midterm Exam Monday November
MATH 307 Introduction to Differential Equations Autumn 2017 Midterm Exam Monday November 6 2017 Name: Student ID Number: I understand it is against the rules to cheat or engage in other academic misconduct
More informationTopics Machine learning: lecture 2. Review: the learning problem. Hypotheses and estimation. Estimation criterion cont d. Estimation criterion
.87 Machie learig: lecture Tommi S. Jaakkola MIT CSAIL tommi@csail.mit.edu Topics The learig problem hypothesis class, estimatio algorithm loss ad estimatio criterio samplig, empirical ad epected losses
More informationNew Functions from Old Functions
.3 New Functions rom Old Functions In this section we start with the basic unctions we discussed in Section. and obtain new unctions b shiting, stretching, and relecting their graphs. We also show how
More information4.1 & 4.2 Student Notes Using the First and Second Derivatives. for all x in D, where D is the domain of f. The number f()
4.1 & 4. Student Notes Using the First and Second Derivatives Deinition A unction has an absolute maimum (or global maimum) at c i ( c) ( ) or all in D, where D is the domain o. The number () c is called
More informationRe-design of Force Redundant Parallel Mechanisms by Introducing Kinematical Redundancy
The 2009 IEEE/RSJ International onerence on Intelligent Robots and Systems October 11-15, 2009 St. Louis, USA Re-design o Force Redundant Parallel Mechanisms by Introducing Kinematical Redundancy Kiyoshi
More informationChapter 8: Converter Transfer Functions
Chapter 8. Converter Transer Functions 8.1. Review o Bode plots 8.1.1. Single pole response 8.1.2. Single zero response 8.1.3. Right hal-plane zero 8.1.4. Frequency inversion 8.1.5. Combinations 8.1.6.
More information63487 [Q. Booklet Number]
WBJEE - 0 (Answers & Hints) 687 [Q. Booklet Number] Regd. Office : Aakash Tower, Plot No., Sector-, Dwarka, New Delhi-0075 Ph. : 0-7656 Fa : 0-767 ANSWERS & HINTS for WBJEE - 0 by & Aakash IIT-JEE MULTIPLE
More information1 Some general theory for 2nd order linear nonhomogeneous
Math 175 Honors ODE I Spring, 013 Notes 5 1 Some general theory for nd order linear nonhomogeneous equations 1.1 General form of the solution Suppose that p; q; and g are continuous on an interval I; and
More informationProblem 1: (3 points) Recall that the dot product of two vectors in R 3 is
Linear Algebra, Spring 206 Homework 3 Name: Problem : (3 points) Recall that the dot product of two vectors in R 3 is a x b y = ax + by + cz, c z and this is essentially the same as the matrix multiplication
More informationME EN 363 Elementary Instrumentation
ME E 6 Elementary Instrumentation Curve Fitting Least squares regression analysis Standard error of fit Correlation coefficient Error in static sensitivity Regression According to various Internet resources,
More informationWed Jan Improved Euler and Runge Kutta. Announcements: Warm-up Exercise:
Wed Jan 31 2.5-2.6 Improved Euler and Runge Kutta. Announcements: Warm-up Eercise: 2.5-2.6 Improved Euler and Runge Kutta In more complicated differential equations it is a very serious issue to find relatively
More information1 Triangle ABC has vertices A( 1,12), B( 2, 5)
Higher Mathematics Paper : Marking Scheme Version Triangle ABC has vertices A(,), B(, ) A(, ) y and C(, ). (a) (b) (c) Find the equation of the median BD. Find the equation of the altitude AE. Find the
More informationShell Balances Spherical Geometry. Remember, we can substitute Fourier's Laws anytime to get: dt
Shell Balances Spherical Geometry ChE B S.S. Heat conduction with source term: Try spherical geometry using a shell balance: Input Output Source Qr r Qr rδr Sr 4 π r Δ r r Remember, we can substitute Fourier's
More informationTheory of Bouguet s MatLab Camera Calibration Toolbox
Theory of Bouguet s MatLab Camera Calibration Toolbox Yuji Oyamada 1 HVRL, University 2 Chair for Computer Aided Medical Procedure (CAMP) Technische Universität München June 26, 2012 MatLab Camera Calibration
More informationCSE 554 Lecture 6: Deformation I
CSE 554 Lecture 6: Deformation I Fall 20 CSE554 Deformation I Slide Review Alignment Registering source to target by rotation and translation Methods Rigid-body transformations Aligning principle directions
More informationMITOCW MIT18_02SCF10Rec_50_300k
MITOCW MIT18_02SCF10Rec_50_300k CHRISTINE Welcome back to recitation. In this video, I'd like us to work on the following problem. BREINER: So the problem is as follows. For which of the following vector
More informationSaturday X-tra X-Sheet: 8. Inverses and Functions
Saturda X-tra X-Sheet: 8 Inverses and Functions Ke Concepts In this session we will ocus on summarising what ou need to know about: How to ind an inverse. How to sketch the inverse o a graph. How to restrict
More informationImage Alignment Computer Vision (Kris Kitani) Carnegie Mellon University
Lucas Kanade Image Alignment 16-385 Comuter Vision (Kris Kitani) Carnegie Mellon University htt://www.humansensing.cs.cmu.edu/intraface/ How can I find in the image? Idea #1: Temlate Matching Slow, combinatory,
More informationMath 2a Prac Lectures on Differential Equations
Math 2a Prac Lectures on Differential Equations Prof. Dinakar Ramakrishnan 272 Sloan, 253-37 Caltech Office Hours: Fridays 4 5 PM Based on notes taken in class by Stephanie Laga, with a few added comments
More informationMath Subject GRE Questions
Math Subject GRE Questions Calculus and Differential Equations 1. If f() = e e, then [f ()] 2 [f()] 2 equals (a) 4 (b) 4e 2 (c) 2e (d) 2 (e) 2e 2. An integrating factor for the ordinary differential equation
More information