Point cloud to point cloud rigid transformations. Minimizing Rigid Registration Errors

Similar documents
Geometric Registration for Deformable Shapes. 2.1 ICP + Tangent Space optimization for Rigid Motions

CS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to

Quantum Mechanics I - Session 4

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

NEWTON S LAWS. These laws only apply when viewed from an inertial coordinate system (unaccelerated system).

Inexact Newton Methods for Inverse Eigenvalue Problems

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Singular Value Decomposition: Theory and Applications

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

Chapter 11: Simple Linear Regression and Correlation

Homework Notes Week 7

1 GSW Iterative Techniques for y = Ax

Lecture 21: Numerical methods for pricing American type derivatives

1 Matrix representations of canonical matrices

Chapter 9: Statistical Inference and the Relationship between Two Variables

November 5, 2002 SE 180: Earthquake Engineering SE 180. Final Project

Composite Hypotheses testing

Errors for Linear Systems

Feature Selection: Part 1

1 Derivation of Point-to-Plane Minimization

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Structure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Linear Feature Engineering 11

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Lecture 10 Support Vector Machines II

Topic 5: Non-Linear Regression

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Solutions to Problem Set 6

(c) (cos θ + i sin θ) 5 = cos 5 θ + 5 cos 4 θ (i sin θ) + 10 cos 3 θ(i sin θ) cos 2 θ(i sin θ) 3 + 5cos θ (i sin θ) 4 + (i sin θ) 5 (A1)

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Programming Project 1: Molecular Geometry and Rotational Constants

Efficient, General Point Cloud Registration with Kernel Feature Maps

Minimizing Algebraic Error in Geometric Estimation Problems

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

LECTURE 9 CANONICAL CORRELATION ANALYSIS

Linear Approximation with Regularization and Moving Least Squares

Introduction to Simulation - Lecture 5. QR Factorization. Jacob White. Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy

Number of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k

Developing an Improved Shift-and-Invert Arnoldi Method

Solution 1 for USTC class Physics of Quantum Information

Formulas for the Determinant

Chapter Newton s Method

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1

Department of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6

Section 8.3 Polar Form of Complex Numbers

5.04, Principles of Inorganic Chemistry II MIT Department of Chemistry Lecture 32: Vibrational Spectroscopy and the IR

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

Statistics for Business and Economics

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

Review: Fit a line to N data points

Feb 14: Spatial analysis of data fields

THEOREMS OF QUANTUM MECHANICS

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Grover s Algorithm + Quantum Zeno Effect + Vaidman

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

PALACE PIER, ST. LEONARDS. M A N A G E R - B O W A R D V A N B I E N E.

Modeling of Dynamic Systems

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Norms, Condition Numbers, Eigenvalues and Eigenvectors

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Slobodan Lakić. Communicated by R. Van Keer

The Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD

P A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that

ME 501A Seminar in Engineering Analysis Page 1

EEE 241: Linear Systems

Body Models I-2. Gerard Pons-Moll and Bernt Schiele Max Planck Institute for Informatics

Lecture 8 Modal Analysis

UNIVERSIDADE DE COIMBRA

RIGID BODY MOTION. Next, we rotate counterclockwise about ξ by angle. Next we rotate counterclockwise about γ by angle to get the final set (x,y z ).

APPENDIX A Some Linear Algebra

Integrals and Invariants of Euler-Lagrange Equations

VECTORS AND MATRICES:

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

Economics 130. Lecture 4 Simple Linear Regression Continued

14 Lagrange Multipliers

σ τ τ τ σ τ τ τ σ Review Chapter Four States of Stress Part Three Review Review

Difference Equations

SIO 224. m(r) =(ρ(r),k s (r),µ(r))

Fisher Linear Discriminant Analysis

5 The Rational Canonical Form

Pattern Classification

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

Report on Image warping

Finite Element Modelling of truss/cable structures

2. PROBLEM STATEMENT AND SOLUTION STRATEGIES. L q. Suppose that we have a structure with known geometry (b, h, and L) and material properties (EA).

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors

Lecture 4: Constant Time SVD Approximation

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

2.5 Iterative Improvement of a Solution to Linear Equations

10-701/ Machine Learning, Fall 2005 Homework 3

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transcription:

Pont cloud to pont cloud rgd transformatons Russell Taylor 600.445 1 600.445 Fall 000-015 Mnmzng Rgd Regstraton Errors Typcally, gven a set of ponts {a } n one coordnate system and another set of ponts {b } n a second coordnate system Goal s to fnd [R,p] that mnmzes η = where e e e = (R a + p) b Ths s trcky, because of R. 600.445 Fall 000-015 1

Pont cloud to pont cloud regstraton a k b k R a k + p = b k 3 600.445 Fall 000-015 Mnmzng Rgd Regstraton Errors Step 1: Compute N N 1 1 a = a b = b N = 1 N = 1 a" = a a b" = b b Step : Fnd R that mnmzes ( R a" b" ) Step 3: Fnd p p = b R a Step 4: Desred transformaton s F = Frame( R, p) 4 600.445 Fall 000-015

Pont cloud to pont cloud regstraton a a k b b k R a k + p = b k 5 600.445 Fall 000-015 Pont cloud to pont cloud regstraton p = b Ra 6 600.445 Fall 000-015 3

Rotaton Estmaton 7 600.445 Fall 000-015 Rotaton Estmaton? 8 600.445 Fall 000-015 4

Rotaton Estmaton 9 600.445 Fall 000-015 Rotaton Estmaton 10 600.445 Fall 000-015 5

Pont cloud to pont cloud regstraton 11 600.445 Fall 000-015 Solvng for R: teraton method Gven {,( "a, b " ),}, want to fnd R = arg mn R"a b " Step 0: Make an ntal guess R 0 Step 1: Gven R k, compute b = R 1" b k Step : Compute ΔR that mnmzes (ΔR "a b ) Step 3: Set R k +1 = R k ΔR Step 4: Iterate Steps 1-3 untl resdual error s suffcently small (or other termnaton condton) 1 600.445 Fall 000-015 6

Iteratve method: Gettng Intal Guess We want to fnd an approxmate soluton R 0 to R 0 "a b " One way to do ths s as follows. Form matrces A = "a B= b " Solve least-squares problem M 3x3 A 3xN B 3xN T T Note : You may fnd t easer to solve A 3xN M 3x3 Set R 0 = orthogonalze(m 3x3 ). Verfy that R s a rotaton T B 3xN Our problem s now to solve R 0 ΔRA B. I.e., ΔRA R 0 1 B 13 600.445 Fall 000-015 Iteratve method: Solvng for ΔR Approxmate Δ R as ( I + skew( α)). I.e., Δ R v v + α v for any vector v. Then, our least squares problem becomes ( Δ R a b mn " ) mn ( a" b + α a" ) ΔR α Ths s lnear least squares problem n α. Then com pute ΔR( α). 14 600.445 Fall 000-015 7

Drect Iteratve approach for Rgd Frame Gven {,( a ", b " ),}, want to fnd F = argmn F a " b " Step 0: Make an ntal guess F 0 Step 1: Gven F k, compute " a k = F k " a Step : Compute ΔF that mnmzes ΔF " a k " b Step 3: Set F k+1 = ΔFF k Step 4: Iterate Steps 1-3 untl resdual error s suffcently small (or other termnaton condton) 15 600.445 Fall 000-015 Drect Iteratve approach for Rgd Frame To solve for ΔF = argmn ΔF a k b ΔF a k b α a k + ε + a k b α a k + ε b a k sk( a k ) α + ε b a k Solve the least-squares problem " " sk( a k ) I " " α ε Now set ΔF=[ΔR( α), ε] " b a k " 16 600.445 Fall 000-015 8

Drect Technques to solve for R Method due to K. Arun, et. al., IEEE PAMI, Vol 9, no 5, pp 698-700, Sept 1987 Step 1: Compute H = a b,x,x a b,y,x a b,z,x a b,x,y a b,y,y a b,z,y a b,x,z a b,y,z a b,z,z Step : Compute the SVD of H = USV t Step 3: R = VU t Step 4: Verfy Det(R) = 1. If not, then algorthm may fal. Falure s rare, and mostly fxable. The paper has detals. 17 600.445 Fall 000-015 Quarternon Technque to solve for R B.K.P. Horn, Closed form soluton of absolute orentaton usng unt quaternons, J. Opt. Soc. Amerca, A vol. 4, no. 4, pp 69-64, Apr. 1987. Method descrbed as reported n Besl and McKay, A method for regstraton of 3D shapes, IEEE Trans. on Pattern Analyss and Machne Intellgence, vol. 14, no., February 199. Solves a 4x4 egenvalue problem to fnd a unt quaternon correspondng to the rotaton Ths quaternon may be converted n closed form to get a more conventonal rotaton matrx 18 600.445 Fall 000-015 9

Dgresson: quaternons Invented by Hamlton n 1843. Can be thought of as 4 elements: q = q 0,q 1,q, scalar & vector: q = s + v = s, v Complex number: q = q 0 + q 1 + q j + k Propertes: where = j = k = j k = 1 Lnearty: λq 1 + µ q = λs 1 + µs,λ v 1 + µ v Conjugate: q * = s v = s, v Transform vector: Product: q 1 " q = s 1 s v 1 v,s v 1 + s v1 + v 1 v q " p = q " 0, p " q * Norm: q = s + v v = q 0 + q 1 + q + 19 600.445 Fall 000-015 Dgresson contnued: unt quaternons We can assocate a rotaton by angle θ about an axs n wth the unt quaternon: θ θ Rot( n, θ) cos, sn n Exercse: Demonstrate ths relatonshp. I.e., show θ θ θ θ Rot(( n, θ ) p = cos, sn n 0 "[, p ]" cos, sn n 0 600.445 Fall 000-015 10

A bt more on quaternons Exercse: show by substtuton that the varous formulatons for quaternons are equvalent A few web references: http://mathworld.wolfram.com/quaternon.html http://en.wkpeda.org/wk/quaternon http://en.wkpeda.org/wk/quaternons_and_spatal_rotaton http://www.eucldeanspace.com/maths/algebra/ realnormedalgebra/quaternons/ndex.htm 1 600.445 Fall 000-015 Rotaton matrx from unt quaternon q = q 0,q 1,q,q 3 ; q = 1 q 0 + q 1 q (q 1 q q 0 ) (q 1 + q 0 q ) R(q) = (q 1 q + q 0 ) q 0 q 1 + q (q q 0 q 1 ) (q 1 q 0 q ) (q + q 0 q 1 ) q 0 q 1 q + q 3 600.445 Fall 000-015 11

Unt quaternon from rotaton matrx R(q) = r xx r yx r zx r xy r yy r zy r xz r yz r zz ; a 0 = 1+ r xx + r yy + r zz ; a 1 = 1+ r xx r yy r zz a = 1 r xx + r yy r zz ; a 3 = 1 r xx r yy + r zz a 0 = max{a k } a 1 = max{a k } a = max{a k } a 3 = max{a k } q 0 = a 0 q 0 = r yz r zy 4q 1 q 0 = r zx r xz 4q q 0 = r xy r yx 4 q 1 = r r xy yx q 4q 1 = a 1 0 q 1 = r xy + r yx 4q q 1 = r xz + r zx 4 q = r zx r xz 4q 0 q = r + r xy yx q 4q = a 1 q = r yz + r zy 4 = r yz r zy 4q 0 = r xz + r zx 4q 1 = r + r yz zy q 4 = a 3 3 600.445 Fall 000-015 Rotaton axs and angle from rotaton matrx Many optons, ncludng drect trgonemetrc soluton. But ths works: [ n,θ] ExtractAxsAngle(R) { } [s, v] ConvertToQuaternon(R) return([ v / v,atan(s / v ) 4 600.445 Fall 000-015 1

Step 1: Compute H = Quaternon method for R Step : Compute trace(h) G = Δ a b,x,x a b,,x y a b,z,x a b,x, y a b,, y y a b,z, y a b,x,z a b,,z y a b,z,z Δ T H + H T trace(h)i where Δ T = H,3 H 3, H 3,1 H 1,3 H 1, H,1 Step 3: Compute egen value decomposton of G dag(λ)=q T GQ Step 4: The egenvector Q k = q 0,q 1,q, correspondng to the largest egenvalue λ k s a unt quaternon correspondng to the rotaton. 5 600.445 Fall 000-015 Another Quaternon Method for R Let q = s + v be the unt quaternon correspondng to R. Let a and b be vectors wth b = R a then we have the quaternon equaton (s + v) (0 + a)(s v) = 0 + b (s + v) (0 + a) = (0 + b) (s + v) snce (s v)(s + v) = 1+ 0 Expandng the scalar and vector parts gves v a = v b s a + v a = s b + b v Rearrangng... ( b a) v = 0 s( b a) + ( b + a) v = 0 3 6 600.445 Fall 000-015 13

Another Quaternon Method for R Expressng ths as a matrx equaton b a 0 ( ) T ( b a ) sk ( b + a ) s v = If we now express the quaternon q as a 4-vector q = s, v T, we can express the rotaton problem as the constraned lnear system M( a, b) q = 0 4 q = 1 0 0 3 7 600.445 Fall 000-015 8 600.445 Fall 000-015 Another Quaternon Method for R In general, we have many observatons, and we want to solve the problem n a least squares sense: where mn M q subject to q = 1 M = M( a 1, b 1 ) " M( a n, b n ) and n s the number of observatons Takng the sngular value decomposton of M=UΣV T ths to the easer problem mn UΣV T q X reduces ( ) = Σ y subject to y = V T q = q = 1 = U Σ y 14

Ths problem s just Another Quaternon Method for R σ 1 0 0 0 mn Σ y 0 σ = 0 0 0 0 σ 3 0 0 0 0 σ 4 y subject to y = 1 where σ are the sngular values. Recall that SVD routnes typcally return the σ 0 and sorted n decreasng magntude. So σ 4 s the smallest sngular value and the value of y wth y = 1 that mnmzes Σ y s y= T 0,0,0,1. The correspondng value of q s gven by q = V y = V 4. Where V 4 s the 4th column of V. 9 600.445 Fall 000-015 Non-reflectve spatal smlarty (rgd+scale) a k b k σr a k + p = b k 30 600.445 Fall 000-015 15

Non-reflectve spatal smlarty Step 1: Compute a = 1 N a N b = 1 N =1 N b =1 "a = a a " b = b b Step : Estmate scale σ = "b "a Step 3: Fnd R that mnmzes (R σ"a b " ) ( ) Step 4: Fnd p p = b R a Step 5: Desred transformaton s F = SmlartyFrame(σ,R, p) 31 600.445 Fall 000-015 16