CS 532: 3D Computer Vision 2 nd Set of Notes
|
|
- Ursula Doyle
- 5 years ago
- Views:
Transcription
1 CS 532: 3D Computer Vson 2 nd Set of Notes Instructor: Plppos Mordoa Webpage: E-mal: Plppos.Mordoa@stevens.edu Offce: Leb 25
2 Lecture Outlne 2D projectve transformatons Homograpes Robust estmaton RANSAC Radal dstorton wo-vew geometry Based on sldes by R. Hartley, A. Zsserman, M. Pollefeys and S. Setz 2
3 Projectve ransformatons n 2D Defnton: A projectvty s an nvertble mappng from P 2 to tself suc tat tree ponts, 2, 3 le on te same lne f and only f ( ),( 2 ),( 3 ) do. eorem: A mappng :P 2 P 2 s a projectvty f and only f tere est a non-sngular 33 matr H suc tat for any pont n P 2 reprented by a vector t s true tat ()=H Defnton: Projectve transformaton ' ' 2 ' or ' H DOF projectvty=collneaton=projectve transformaton=omograpy 3
4 Mappng between planes central projecton may be epressed by =H (applcaton of teorem) 4
5 Removng Projectve Dstorton select four ponts n a plane wt known coordnates ' 2 y 3 ' y ' y' ' y ' y ' y' y 33 2 y y y (lnear n j ) (2 constrants/pont, 8DOF 4 ponts needed) Remarks: no calbraton at all necessary, better ways to compute (see later) 5
6 A Herarcy of ransformatons Projectve lnear group Affne group (last row (,,)) Eucldean group (upper left 22 ortogonal) Orented Eucldean group (upper left 22 det ) Alternatvely, caracterze transformaton n terms of elements or quanttes tat are preserved or nvarant e.g. Eucldean transformatons leave dstances uncanged 6
7 Class I: Isometres (so=same, metrc=measure) cos sn sn cos ' ' y t t y y orentaton preservng: orentaton reversng: ' t R H E I R R specal cases: pure rotaton, pure translaton 3DOF ( rotaton, 2 translaton) Invarants: lengt, angle, area 7
8 Class II: Smlartes (sometry + scale) cos sn sn cos ' ' y t s s t s s y y ' t R H s S I R R also know as equ-form (sape preservng) metrc structure = structure up to smlarty (n lterature) 4DOF ( scale, rotaton, 2 translaton) Invarants: ratos of lengt, angle, ratos of areas, parallel lnes 8
9 Class III: Affne ransformatons ' ' y t a a t a a y y ' t A H A non-sotropc scalng! (2DOF: scale rato and orentaton) 6DOF (2 scale, 2 rotaton, 2 translaton) Invarants: parallel lnes, ratos of parallel lengts, ratos of areas DR R R A 2 D 9
10 Class VI: Projectve ransformatons ' H P A v t v v v, v 2 8DOF (2 scale, 2 rotaton, 2 translaton, 2 lne at nfnty) Acton s non-omogeneous over te plane Invarants: cross-rato of four ponts on a lne (rato of ratos)
11 Overvew of ransformatons Projectve 8dof Affne 6dof Smlarty 4dof Eucldean 3dof 2 3 a a2 sr sr r r2 2 a a r r sr sr t t y t t y t t y Concurrency, collnearty, order of contact (ntersecton, tangency, nflecton, etc.), cross rato Parallellsm, rato of areas, rato of lengts on parallel lnes (e.g mdponts), lnear combnatons of vectors (centrods). e lne at nfnty l Ratos of lengts, angles. e crcular ponts I,J lengts, areas.
12 Homework Warp te basketball court from ts mage to a new mage so tat t appears as f te new mage was taken from drectly above Wat are we mssng? 2
13 Image Warpng Sldes by Steve Setz 3
14 Image ransformatons 4
15 Parametrc (Global) Warpng ransformaton s a coordnate-cangng macne: p = (p) Wat does t mean tat s global? It s te same for any pont p It can be descrbed by just a few numbers (parameters) s represented as a matr (see prev. sldes): p = M*p 5
16 Image Warpng Gven a coordnate transform (,y ) = (,y) and a source mage f(,y), ow do we compute a transformed mage g(,y ) = f((,y))? 6
17 Forward Warpng Send eac pel f(,y) to ts correspondng locaton (,y ) = (,y) n te second mage Q: wat f te pel lands between two pels? 7
18 Forward Warpng Send eac pel f(,y) to ts correspondng locaton (,y ) = (,y) n te second mage Q: wat f te pel lands between two pels? A: Dstrbute color among negborng pels (splattng) 8
19 Inverse Warpng Get eac pel g(,y ) from ts correspondng locaton (,y) = - (,y ) n te frst mage Q: wat f pel comes from between two pels? 9
20 Inverse Warpng Get eac pel g(,y ) from ts correspondng locaton (,y) = - (,y ) n te frst mage Q: wat f pel comes from between two pels? A: nterpolate color value from negbors Blnear nterpolaton typcally used 2
21 Blnear Interpolaton 2
22 Forward vs. Inverse Warpng Wc s better?... 22
23 Parameter Estmaton Sldes by R. Hartley, A. Zsserman and M. Pollefeys 23
24 Homograpy: Number of Measurements Requred At least as many ndependent equatons as degrees of freedom requred Eample: ' H λ y y 2 ndependent equatons / pont 8 degrees of freedom
25 Appromate solutons Mnmal soluton 4 ponts yeld an eact soluton for H More ponts No eact soluton, because measurements are neact ( nose ) Searc for best accordng to some cost functon Algebrac or geometrc/statstcal cost 25
26 Drect Lnear ransformaton (DL) H H H 3 2 y w w y H y w y w w y,, A 26
27 Drect Lnear ransformaton (DL) Equatons are lnear n 3 2 y w y w A A A 3 2 w y A Only 2 of 3 are lnearly ndependent (ndeed, 2 eq/pt) 27
28 Drect Lnear ransformaton (DL) 3 2 w y w (only drop trd row f w ) Holds for any omogeneous representaton, e.g. (,y,) 28
29 Drect Lnear ransformaton (DL) Solvng for H A A A A A Sze of A s 89, but rank 8 rval soluton s = 9 s not nterestng -D null-space yelds soluton of nterest, pck for eample te one wt 29
30 Drect Lnear ransformaton (DL) Over-determned soluton A A A No eact soluton because of neact measurement.e. nose 2 n Fnd appromate soluton - Addtonal constrant needed to avod, e.g. A - not possble, so mnmze A 3
31 DL Algortm Objectve Gven n 4 2D to 2D pont correspondences { }, determne te 2D omograpy matr H suc tat =H Algortm () For eac correspondence compute A. Usually only two frst rows needed. () Assemble n 29 matrces A nto a sngle 2n9 matr A () Obtan SVD of A. Soluton for s last column of V (v) Determne H from 3
32 Inomogeneous soluton ' ' ~ ' ' ' ' ' ' ' ' ' ' w w y y w w w y w y y y w w w y w Snce can only be computed up to scale, pck j =, e.g. 9 =, and solve for 8-vector ~ Solve usng Gaussan elmnaton (4 ponts) or usng lnear least-squares (more tan 4 ponts) However, f 9 = ts approac fals Also poor results f 9 close to zero erefore, not recommended 32
33 Normalzng ransformatons Snce DL s not nvarant to transformatons, wat s a good coce of coordnates? e.g. ranslate centrod to orgn Scale to a 2 average dstance to te orgn Independently on bot mages norm w w w / 2 / 2 33
34 Importance of Normalzaton 3 2 y y y y y y y ~ 2 ~ 2 ~ 2 ~ 2 ~ 4 ~ 4 ~ 2 orders of magntude dfference! Monte Carlo smulaton for dentty computaton based on 5 ponts (not normalzed normalzed) 34
35 Normalzed DL Algortm Objectve Gven n 4 2D to 2D pont correspondences { }, determne te 2D omograpy matr H suc tat =H Algortm () Normalze ponts ~ norm, ~ norm () Apply DL algortm to ~ ~, () Denormalze soluton - H norm H ~ norm 35
36 RANSAC Sldes by R. Hartley, A. Zsserman and M. Pollefeys 36
37 Robust Estmaton Wat f set of matces contans gross outlers? 37
38 RANSAC Objectve Robust ft of model to data set S wc contans outlers Algortm () Randomly select a sample of s data ponts from S and nstantate te model from ts subset. () Determne te set of data ponts S wc are wtn a dstance tresold t of te model. e set S s te consensus set of samples and defnes te nlers of S. () If te subset of S s greater tan some tresold, reestmate te model usng all te ponts n S and termnate (v) If te sze of S s less tan, select a new subset and repeat te above. (v) After N trals te largest consensus set S s selected, and te model s re-estmated usng all te ponts n te subset S 38
39 How Many Samples? Coose N so tat, wt probablty p, at least one random sample s free from outlers. e.g. p=.99 e p N s N p/ log e log s proporton of outlers e s 5% % 2% 25% 3% 4% 5%
40 Acceptable Consensus Set ypcally, termnate wen nler rato reaces epected rato of nlers en 4
41 Adaptvely Determnng te Number of Samples e s often unknown a pror, so pck worst case, e.g. 5%, and adapt f more nlers are found, e.g. 8% would yeld e=.2 N=, sample_count = Wle N >sample_count repeat Coose a sample and count te number of nlers Set e=-(number of nlers)/(total number of ponts) Recompute N from e Increment te sample_count by ermnate N p/ log e log s 4
42 Oter robust algortms RANSAC mamzes number of nlers LMedS mnmzes medan error Not recommended: case deleton, teratve least-squares, etc. 42
43 Automatc Computaton of H Objectve Compute omograpy between two mages Algortm () Interest ponts: Compute nterest ponts n eac mage () Putatve correspondences: Compute a set of nterest pont matces based on some smlarty measure () RANSAC robust estmaton: Repeat for N samples (a) Select 4 correspondences and compute H (b) Calculate te dstance d for eac putatve matc (c) Compute te number of nlers consstent wt H (d <t) Coose H wt most nlers (v) Optmal estmaton: re-estmate H from all nlers by mnmzng ML cost functon wt Levenberg-Marquardt (v) Guded matcng: Determne more matces usng predcton by computed H Optonally terate last two steps untl convergence 43
44 Determne Putatve Correspondences Compare nterest ponts Smlarty measure: SAD, SSD, ZNCC n small negborood If moton s lmted, only consder nterest ponts wt smlar coordnates 44
45 Eample: robust computaton Interest ponts (5/mage) (6448) #n -e adapt. N 6 2% 2M 3% 2.5M 44 6% 6, % 2, % % 43 Putatve correspondences (268) (Best matc,ssd<2,±32) Outlers (7) (t=.25 pel; 43 teratons) Inlers (5) Fnal nlers (262) 45
46 Radal Dstorton and Undstorton Sldes by R. Hartley, A. Zsserman and M. Pollefeys 46
47 Radal Dstorton sort and long focal lengt 47
48 48
49 49
50 ypcal Undstorton Model Correcton of dstorton Coce of te dstorton functon and center Computng te parameters of te dstorton functon () Mnmze wt addtonal unknowns () Stragten lnes () 5
51 Wy Undstort? 5
52 wo-vew Geometry Sldes by R. Hartley, A. Zsserman and M. Pollefeys 52
53 ree questons: () Correspondence geometry: Gven an mage pont n te frst mage, ow does ts constran te poston of te correspondng pont n te second mage? () Camera geometry (moton): Gven a set of correspondng mage ponts { }, =,,n, wat are te cameras P and P for te two vews? () Scene geometry (structure): Gven correspondng mage ponts and cameras P, P, wat s te poston of (ter premage) X n space? 53
54 e Eppolar Geometry C, C,, and X are coplanar 54
55 e Eppolar Geometry Wat f only C,C, are known? 55
56 e Eppolar Geometry All ponts on project on l and l 56
57 e Eppolar Geometry Famly of planes and lnes l and l Intersecton n e and e 57
58 e Eppolar Geometry eppoles e, e = ntersecton of baselne wt mage plane = projecton of projecton center n oter mage = vansng pont of camera moton drecton an eppolar plane = plane contanng baselne (-D famly) an eppolar lne = ntersecton of eppolar plane wt mage (always come n correspondng pars) 58
59 Eample: Convergng Cameras 59
60 Eample: Moton Parallel to Image Plane (smple for stereo rectfcaton) 6
61 Eample: Forward Moton e e 6
62 e Fundamental Matr F algebrac representaton of eppolar geometry l' we wll see tat mappng s a (sngular) correlaton (.e. projectve mappng from ponts to lnes) represented by te fundamental matr F 62
63 e Fundamental Matr F correspondence condton e fundamental matr satsfes te condton tat for any par of correspondng ponts n te two mages ' F ' l' 63
64 e Fundamental Matr F X λ P λc PP I l F P'C P' P e' P' P P Xλ (note: doesn t work for C=C F=) 64
65 e Fundamental Matr F F s te unque 33 rank 2 matr tat satsfes F= for all () ranspose: f F s fundamental matr for (P,P ), ten F s fundamental matr for (P,P) () Eppolar lnes: l =F & l=f () Eppoles: on all eppolar lnes, tus e F=, e F=, smlarly Fe= (v) F as 7 d.o.f.,.e. 33-(omogeneous)-(rank2) (v) F s a correlaton, projectve mappng from a pont to a lne l =F (not a proper correlaton,.e. not nvertble) 65
66 wo Vew Geometry Computaton: Lnear Algortm For every matc (m,m ): ' F ' f ' yf2 ' f3 y' f2 y' yf22 y' f23 f3 yf32 f33 separate known from unknown ', ' y, ', y', y' y, y',, y, f, f, f, f, f, f, f, f, f (data) (unknowns) (lnear) ' ' y ' y' y' y y' y ' n n ' n yn ' n y' n n y' n yn y' n n yn f Af 66
67 Benefts from avng F Gven a pel n one mage, te correspondng pel as to le on eppolar lne Searc space reduced from 2-D to -D 67
68 Image Par Rectfcaton smplfy stereo matcng by warpng te mages Apply projectve transformaton so tat eppolar lnes correspond to orzontal scanlnes e e He map eppole e to (,,) try to mnmze mage dstorton problem wen eppole n (or close to) te mage 68
69 Planar Rectfcaton (standard approac) Brng two vews to standard stereo setup (moves eppole to ) (not possble wen n/close to mage) 69
70 7
Parameter estimation class 5
Parameter estmaton class 5 Multple Ve Geometr Comp 9-89 Marc Pollefes Content Background: Projectve geometr (D, 3D), Parameter estmaton, Algortm evaluaton. Sngle Ve: Camera model, Calbraton, Sngle Ve Geometr.
More informationComputer Vision. The 2D projective plane and it s applications. HZ Ch 2. In particular: Ch 2.1-4, 2.7, Szelisky: Ch 2.1.1, 2.1.2
Computer Vson e D projectve plane and t s applcatons HZ C. In partcular: C.-4,.7, Szelsk: C..,.. Estmaton:HZ: C 4.-4..5, 4.4.4-4.8 cursorl Rcard Hartle and Andrew Zsserman, Multple Vew Geometr, Cambrdge
More informationCS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras
CS4495/6495 Introducton to Computer Vson 3C-L3 Calbratng cameras Fnally (last tme): Camera parameters Projecton equaton the cumulatve effect of all parameters: M (3x4) f s x ' 1 0 0 0 c R 0 I T 3 3 3 x1
More informationwhere λ = Z/f. where a 3 4 projection matrix represents a map from 3D to 2D. Part I: Single and Two View Geometry Internal camera parameters
Imagng Geometry Multple Vew Geometry Perspectve projecton Y Rchard Hartley and Andrew Zsserman X λ y = Y f Z O X p y Z X where λ = Z/f. mage plane CVPR June 1999 Ths can be wrtten as a lnear mappng between
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationStructure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7
Structure from Moton Forsyth&once: Chap. 2 and 3 Szelsk: Chap. 7 Introducton to Structure from Moton Forsyth&once: Chap. 2 Szelsk: Chap. 7 Structure from Moton Intro he Reconstructon roblem p 3?? p p 2
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationImage classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them?
Image classfcaton Gven te bag-of-features representatons of mages from dfferent classes ow do we learn a model for dstngusng tem? Classfers Learn a decson rule assgnng bag-offeatures representatons of
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationMinimizing Algebraic Error in Geometric Estimation Problems
Mnmzng Algebrac n Geometrc Estmaton Problems Rchard I. Hartley G.E. Corporate Research and Development PO Box 8, Schenectady, NY 39 Emal : hartley@crd.ge.com Abstract Ths paper gves a wdely applcable technque
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationn α 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
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationShuai Dong. Isaac Newton. Gottfried Leibniz
Computatonal pyscs Sua Dong Isaac Newton Gottred Lebnz Numercal calculus poston dervatve ntegral v velocty dervatve ntegral a acceleraton Numercal calculus Numercal derentaton Numercal ntegraton Roots
More informationPattern Classification
Pattern Classfcaton All materals n these sldes ere taken from Pattern Classfcaton (nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wley & Sons, 000 th the permsson of the authors and the publsher
More informationCoordinate-Free Projective Geometry for Computer Vision
MM Research Preprnts,131 165 No. 18, Dec. 1999. Beng 131 Coordnate-Free Proectve Geometry for Computer Vson Hongbo L, Gerald Sommer 1. Introducton How to represent an mage pont algebracally? Gven a Cartesan
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationThe Finite Element Method: A Short Introduction
Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental
More informationProblems & Techniques
Vsual Moton Estmaton Problems & Technques Prnceton Unversty COS 429 Lecture Oct. 11, 2007 Harpreet S. Sawhney hsawhney@sarnoff.com Outlne 1. Vsual moton n the Real World 2. The vsual moton estmaton problem
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles
More information17. Coordinate-Free Projective Geometry for Computer Vision
17. Coordnate-Free Projectve Geometry for Computer Vson Hongbo L and Gerald Sommer Insttute of Computer Scence and Appled Mathematcs, Chrstan-Albrechts-Unversty of Kel 17.1 Introducton How to represent
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More information15.1 The geometric basis for the trifocal tensor Incidence relations for lines.
15 The Trfocal Tensor The trfocal tensor plays an analogous role n three vews to that played by the fundamental matrx n two. It encapsulates all the (projectve) geometrc relatons between three vews that
More informationThe Trifocal Tensor The geometric basis for the trifocal tensor
14 The Trfocal Tensor The trfocal tensor plays an analogous role n three vews to that played by the fundamental matrx n two. It encapsulates all the (projectve) geometrc relatons between three vews that
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationCommon loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:
15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before
More informationPubH 7405: REGRESSION ANALYSIS. SLR: INFERENCES, Part II
PubH 7405: REGRESSION ANALSIS SLR: INFERENCES, Part II We cover te topc of nference n two sessons; te frst sesson focused on nferences concernng te slope and te ntercept; ts s a contnuaton on estmatng
More informationLinear discriminants. Nuno Vasconcelos ECE Department, UCSD
Lnear dscrmnants Nuno Vasconcelos ECE Department UCSD Classfcaton a classfcaton problem as to tpes of varables e.g. X - vector of observatons features n te orld Y - state class of te orld X R 2 fever blood
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationRigid body simulation
Rgd bod smulaton Rgd bod smulaton Once we consder an object wth spacal etent, partcle sstem smulaton s no longer suffcent Problems Problems Unconstraned sstem rotatonal moton torques and angular momentum
More information6 Autocalibration. 6.1 Counting argument. 6.2 A simple direct method
6 Autocalbraton The am of autocalbraton s to compute the nternal parameters, startng from weakly calbrated cameras. More n general, the task s to recover metrc propertes of camera and/or scene,.e., to
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationMACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression
11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING
More informationMultigrid Methods and Applications in CFD
Multgrd Metods and Applcatons n CFD Mcael Wurst 0 May 009 Contents Introducton Typcal desgn of CFD solvers 3 Basc metods and ter propertes for solvng lnear systems of equatons 4 Geometrc Multgrd 3 5 Algebrac
More informationPhysics 53. Rotational Motion 3. Sir, I have found you an argument, but I am not obliged to find you an understanding.
Physcs 53 Rotatonal Moton 3 Sr, I have found you an argument, but I am not oblged to fnd you an understandng. Samuel Johnson Angular momentum Wth respect to rotatonal moton of a body, moment of nerta plays
More informationStatistical pattern recognition
Statstcal pattern recognton Bayes theorem Problem: decdng f a patent has a partcular condton based on a partcular test However, the test s mperfect Someone wth the condton may go undetected (false negatve
More informationCS 523: Computer Graphics, Spring Shape Modeling. PCA Applications + SVD. Andrew Nealen, Rutgers, /15/2011 1
CS 523: Computer Graphcs, Sprng 20 Shape Modelng PCA Applcatons + SVD Andrew Nealen, utgers, 20 2/5/20 emnder: PCA Fnd prncpal components of data ponts Orthogonal drectons that are domnant n the data (have
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More information= = = (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.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More informationTR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL
TR/9 February 980 End Condtons for Interpolatory Quntc Splnes by G. H. BEHFOROOZ* & N. PAPAMICHAEL *Present address: Dept of Matematcs Unversty of Tabrz Tabrz Iran. W9609 A B S T R A C T Accurate end condtons
More information5 The Laplace Equation in a convex polygon
5 Te Laplace Equaton n a convex polygon Te most mportant ellptc PDEs are te Laplace, te modfed Helmoltz and te Helmoltz equatons. Te Laplace equaton s u xx + u yy =. (5.) Te real and magnary parts of an
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationp 1 c 2 + p 2 c 2 + p 3 c p m c 2
Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance
More information( ) [ ( k) ( k) ( x) ( ) ( ) ( ) [ ] ξ [ ] [ ] [ ] ( )( ) i ( ) ( )( ) 2! ( ) = ( ) 3 Interpolation. Polynomial Approximation.
3 Interpolaton {( y } Gven:,,,,,, [ ] Fnd: y for some Mn, Ma Polynomal Appromaton Theorem (Weerstrass Appromaton Theorem --- estence ε [ ab] f( P( , then there ests a polynomal
More informationSupport Vector Machines
CS 2750: Machne Learnng Support Vector Machnes Prof. Adrana Kovashka Unversty of Pttsburgh February 17, 2016 Announcement Homework 2 deadlne s now 2/29 We ll have covered everythng you need today or at
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationEfficient, General Point Cloud Registration with Kernel Feature Maps
Effcent, General Pont Cloud Regstraton wth Kernel Feature Maps Hanchen Xong, Sandor Szedmak, Justus Pater Insttute of Computer Scence Unversty of Innsbruck 30 May 2013 Hanchen Xong (Un.Innsbruck) 3D Regstraton
More informationNice plotting of proteins II
Nce plottng of protens II Fnal remark regardng effcency: It s possble to wrte the Newton representaton n a way that can be computed effcently, usng smlar bracketng that we made for the frst representaton
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationParallel VLSI CAD Algorithms. Lecture 7 Iterative methods for IC thermal analysis Zhuo Feng
Parallel VLSI CAD Algortms Lecture 7 Iteratve metods for IC termal analyss Zuo Feng 7. We ve taled about usng LU to solve a sparse lnear matr t problem Anoter way of dealng wt sparse matr problems s to
More informationNot-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up
Not-for-Publcaton Aendx to Otmal Asymtotc Least Aquares Estmaton n a Sngular Set-u Antono Dez de los Ros Bank of Canada dezbankofcanada.ca December 214 A Proof of Proostons A.1 Proof of Prooston 1 Ts roof
More informationORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD
Numercal Analss or Engneers German Jordanan Unverst ORDINARY DIFFERENTIAL EQUATIONS We wll eplore several metods o solvng rst order ordnar derental equatons (ODEs and we wll sow ow tese metods can be appled
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationOptimal Slack-Driven Block Shaping Algorithm in Fixed-Outline Floorplanning
Optmal Slack-Drven Block Sapng Algortm n Fxed-Outlne Floorplannng Jackey Z. Yan Placement Tec. Group Cadence Desgn Systems San Jose, CA 95134, U.S.A. Crs Cu Department of ECE Iowa State Unversty Ames,
More informationPoisson brackets and canonical transformations
rof O B Wrght Mechancs Notes osson brackets and canoncal transformatons osson Brackets Consder an arbtrary functon f f ( qp t) df f f f q p q p t But q p p where ( qp ) pq q df f f f p q q p t In order
More informationA Tutorial on Data Reduction. Linear Discriminant Analysis (LDA) Shireen Elhabian and Aly A. Farag. University of Louisville, CVIP Lab September 2009
A utoral on Data Reducton Lnear Dscrmnant Analss (LDA) hreen Elhaban and Al A Farag Unverst of Lousvlle, CVIP Lab eptember 009 Outlne LDA objectve Recall PCA No LDA LDA o Classes Counter eample LDA C Classes
More informationSingle Variable Optimization
8/4/07 Course Instructor Dr. Raymond C. Rump Oce: A 337 Phone: (95) 747 6958 E Mal: rcrump@utep.edu Topc 8b Sngle Varable Optmzaton EE 4386/530 Computatonal Methods n EE Outlne Mathematcal Prelmnares Sngle
More informationA linear imaging system with white additive Gaussian noise on the observed data is modeled as follows:
Supplementary Note Mathematcal bacground A lnear magng system wth whte addtve Gaussan nose on the observed data s modeled as follows: X = R ϕ V + G, () where X R are the expermental, two-dmensonal proecton
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationUNIVERSIDADE DE COIMBRA
UNIVERSIDADE DE COIMBRA DEPARTAMENTO DE ENGENHARIA ELECTROTÉCNICA E DE COMPUTADORES INSTITUTO DE SISTEMAS E ROBÓTICA 3030-290 COIMBRA, PORTUGAL ARTICLE: Pose Estmaton for Non-Central Cameras Usng Planes
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More information5012: VLSI Signal Processing
5: VLSI Sgnal Processng Lecture 6 Fast Algortms for Dgtal Sgnal Processng VSP Lecture6 - Fast Algortms for DSP (cwlu@twns.ee.nctu.edu.tw) - Algortm Strengt Reducton Motvaton Te number of strong operatons,
More informationSolution for singularly perturbed problems via cubic spline in tension
ISSN 76-769 England UK Journal of Informaton and Computng Scence Vol. No. 06 pp.6-69 Soluton for sngularly perturbed problems va cubc splne n tenson K. Aruna A. S. V. Rav Kant Flud Dynamcs Dvson Scool
More informationLecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2
P470 Lecture 6/7 (February 10/1, 014) DIRAC EQUATION The non-relatvstc Schrödnger equaton was obtaned by notng that the Hamltonan H = P (1) m can be transformed nto an operator form wth the substtutons
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationRotation Invariant Shape Contexts based on Feature-space Fourier Transformation
Fourth Internatonal Conference on Image and Graphcs Rotaton Invarant Shape Contexts based on Feature-space Fourer Transformaton Su Yang 1, Yuanyuan Wang Dept of Computer Scence and Engneerng, Fudan Unversty,
More informationChapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the
More informationProbability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!
8333: Statstcal Mechancs I Problem Set # 3 Solutons Fall 3 Characterstc Functons: Probablty Theory The characterstc functon s defned by fk ep k = ep kpd The nth coeffcent of the Taylor seres of fk epanded
More information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leadng publsher of Open Access books Bult by scentsts, for scentsts 3,900 116,000 10M Open access books avalable Internatonal authors and edtors Downloads Our authors are
More informationLecture 3 Stat102, Spring 2007
Lecture 3 Stat0, Sprng 007 Chapter 3. 3.: Introducton to regresson analyss Lnear regresson as a descrptve technque The least-squares equatons Chapter 3.3 Samplng dstrbuton of b 0, b. Contnued n net lecture
More informationMultivariate Ratio Estimator of the Population Total under Stratified Random Sampling
Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng
More informationUnified Subspace Analysis for Face Recognition
Unfed Subspace Analyss for Face Recognton Xaogang Wang and Xaoou Tang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, Hong Kong {xgwang, xtang}@e.cuhk.edu.hk Abstract PCA, LDA
More informationCOMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,
COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,
More information