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



Similar documents
8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Rotation Matrices and Homogeneous Transformations

L10: Linear discriminants analysis

Least Squares Fitting of Data

Regression Models for a Binary Response Using EXCEL and JMP

On the Solution of Indefinite Systems Arising in Nonlinear Optimization

Binomial Link Functions. Lori Murray, Phil Munz

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM

BERNSTEIN POLYNOMIALS

Faraday's Law of Induction

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Lecture 5,6 Linear Methods for Classification. Summary

where the coordinates are related to those in the old frame as follows.

Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

PERRON FROBENIUS THEOREM

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

SIMPLE LINEAR CORRELATION

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Latent Class Regression. Statistics for Psychosocial Research II: Structural Models December 4 and 6, 2006

A frequency decomposition time domain model of broadband frequency-dependent absorption: Model II

Software Alignment for Tracking Detectors

Stochastic Six-Degree-of-Freedom Flight Simulator for Passively Controlled High-Power Rockets

NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582

The Effect of Mean Stress on Damage Predictions for Spectral Loading of Fiberglass Composite Coupons 1

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Support Vector Machines

Loop Parallelization

How To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole

How To Calculate The Accountng Perod Of Nequalty

Trade Adjustment and Productivity in Large Crises. Online Appendix May Appendix A: Derivation of Equations for Productivity

A Three-Point Combined Compact Difference Scheme

GENERALIZED PROCRUSTES ANALYSIS AND ITS APPLICATIONS IN PHOTOGRAMMETRY

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Matching Images with Different Resolutions

21 Vectors: The Cross Product & Torque

CHAPTER 14 MORE ABOUT REGRESSION

An Integrated Semantically Correct 2.5D Object Oriented TIN. Andreas Koch

O(n) mass matrix inversion for serial manipulators and polypeptide chains using Lie derivatives Kiju Lee, Yunfeng Wang and Gregory S.

Consider a 1-D stationary state diffusion-type equation, which we will call the generalized diffusion equation from now on:

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Steve Kroon

Goals Rotational quantities as vectors. Math: Cross Product. Angular momentum

Project Networks With Mixed-Time Constraints

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

Fragility Based Rehabilitation Decision Analysis

PRACTICE 1: MUTUAL FUNDS EVALUATION USING MATLAB.

Numerical Methods 數 值 方 法 概 說. Daniel Lee. Nov. 1, 2006

The Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance

1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

IMPROVEMENT OF THE STABILITY SOLVING RATIONAL POLYNOMIAL COEFFICIENTS

Chapter 7 Symmetry and Spectroscopy Molecular Vibrations p. 1 -

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

Description of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

This circuit than can be reduced to a planar circuit

Formulating & Solving Integer Problems Chapter

Portfolio Loss Distribution

Sect Greatest Common Factor and Factoring by Grouping

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

A Fast Incremental Spectral Clustering for Large Data Sets

Modern Problem Solving Techniques in Engineering with POLYMATH, Excel and MATLAB. Introduction

Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process

General Iteration Algorithm for Classification Ratemaking

Extending Probabilistic Dynamic Epistemic Logic

CHAPTER 5 RELATIONSHIPS BETWEEN QUANTITATIVE VARIABLES

Learning from Multiple Outlooks

Inter-Ing INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, November 2007.

Lecture Topics. 6. Sensors and instrumentation 7. Actuators and power transmission devices. (System and Signal Processing) DR

Quantization Effects in Digital Filters

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

Recurrence. 1 Definitions and main statements

Homework: 49, 56, 67, 60, 64, 74 (p )

Vehicle Detection, Classification and Position Estimation based on Monocular Video Data during Night-time

Damage detection in composite laminates using coin-tap method

A high-order compact method for nonlinear Black-Scholes option pricing equations of American Options

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering

A Multi-mode Image Tracking System Based on Distributed Fusion

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

FACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1

What is Candidate Sampling

Linear and quadratic Taylor polynomials for functions of several variables.

Exhaustive Regression. An Exploration of Regression-Based Data Mining Techniques Using Super Computation

Transcription:

Pont cloud to pont cloud rgd transformatons Russell Taylor 600.445 1 600.445 Fall 000-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 1

Pont cloud to pont cloud regstraton a k b k R a k + p = b k 3 600.445 Fall 000-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor

Pont cloud to pont cloud regstraton a a k b b k R a k + p = b k 5 600.445 Fall 000-014 Copyrght R. H. Taylor Pont cloud to pont cloud regstraton p = b Ra 6 600.445 Fall 000-014 Copyrght R. H. Taylor 3

Rotaton Estmaton 7 600.445 Fall 000-014 Copyrght R. H. Taylor Rotaton Estmaton? 8 600.445 Fall 000-014 Copyrght R. H. Taylor 4

Rotaton Estmaton 9 600.445 Fall 000-014 Copyrght R. H. Taylor Rotaton Estmaton 10 600.445 Fall 000-014 Copyrght R. H. Taylor 5

Pont cloud to pont cloud regstraton 11 600.445 Fall 000-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 8 600.445 Fall 000-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor Non-reflectve spatal smlarty (rgd+scale) a k b k σr a k + p = b k 30 600.445 Fall 000-014 Copyrght R. H. Taylor 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-014 Copyrght R. H. Taylor 16