Lecture 08 Multiple View Geometry 2

Size: px
Start display at page:

Download "Lecture 08 Multiple View Geometry 2"

Transcription

1 Insttte of Informatcs Insttte of Neronformatcs Lectre 8 Mltple Vew Geometry Dade Scaramzza

2 Lab Exercse 6 - Today afternoon Room ETH HG E. from 3:5 to 5: Work descrpton: 8-pont algorthm Estmated poses and 3D strctre

3 3 stdent projects on Robotcs, ML, and Percepton 3

4 -Vew Geometry: Recap Depth from stereo (.e., stereo son) Assmptons: K, T and R are known. Goal: Recoer the 3D strctre from mages P =? -ew Strctre From Moton: Assmptons: none (K, T, and R are nknown). K, R,T K, R,T K, R,T Goal: Recoer smltaneosly 3D scene strctre, camera poses (p to scale), and ntrnsc parameters from two dfferent ews of the scene P =? K, R,T =? K, R,T =? K, R,T =? 4

5 Otlne Two-Vew Strctre from Moton Robst Strctre from Moton 5

6 Problem formlaton: Gen n pont correspondences between two mages, {p = (, ), p = (, )}, smltaneosly estmate the 3D ponts P, the camera relate-moton parameters (R, T), and the camera ntrnscs K, K that satsfy: R, T =? P =? C C Strctre from Moton (SFM) w w w Z Y X I K w w w Z Y X R T K 6

7 Strctre from Moton (SFM) Two arants exst: Calbrated camera(s) K, K are known Uncalbrated camera(s) K, K are nknown P =? C R, T =? 7 C

8 Let s stdy the case n whch the cameras are calbrated For conenence, let s se normalzed mage coordnates Ths, we want to fnd R, T, P that satsfy Strctre from Moton (SFM) K w w w Z Y X I w w w Z Y X R T R, T =? P =? C C 8

9 Scale Ambgty If we rescale the entre scene and camera ews by a constant factor (.e., smlarty transformaton), the projectons (n pxels) of the scene ponts n both mages reman exactly the same: 9

10 Scale Ambgty In monoclar son, t s therefore not possble to recoer the absolte scale of the scene! Stereo son? Ths, only 5 degrees of freedom are measrable: 3 parameters to descrbe the rotaton parameters for the translaton p to a scale (we can only compte the drecton of translaton bt not ts length)

11 Strctre From Moton (SFM) How many knowns and nknowns? 4n knowns: n correspondences; each one (, ) and (, ), = n 5 + 3n nknowns 5 for the moton p to a scale (3 for rotaton, for translaton) 3n = nmber of coordnates of the n 3D ponts Does a solton exst? If and only f the nmber of ndependent eqatons nmber of nknowns 4n 5 + 3n n 5 Frst attempt to dentfy the soltons by Krppa n 93 (see slde 7). E. Krppa, Zr Ermttlng enes Objektes as zwe Perspekten mt Innerer Orenterng, Stz.-Ber. Akad. Wss., Wen, Math. Natrw. Kl., Abt. IIa., 93. Englsh Translaton pls orgnal paper by Gllermo Gallego, Arx, 7

12 Cross Prodct (or Vector Prodct) Vector cross prodct takes two ectors and retrns a thrd ector that s perpendclar to both npts, wth a drecton gen by the rght-hand rle and a magntde eqal to the area of the parallelogram that the ectors span: So c s perpendclar to both a and b (whch means that the dot prodct s ) Also, recall that the cross prodct of two parallel ectors s The cross prodct between a and b can also be expressed n matrx form as the prodct between the skew-symmetrc matrx of a and a ector b c b a c b c a b a b a ] [ z y x x y x z y z b b b a a a a a a sn( ) b a c

13 Can we sole the estmaton of relate moton (R,T) ndependently of the estmaton of the strctre (3D ponts)? The next cople of sldes proe that ths s possble. Once R,T are known, the 3D ponts can be tranglated sng the tranglaton algorthms from Lectre 7 (sldes 3-36) 3

14 Eppolar Geometry P p p p eppolar plane p n p = Rp T p, p, T are coplanar: p T n p T ( ' T p ) p T ( T ( Rp)) T p [ T ] R p T eppolar constrant E [ T ] R essental matrx 4

15 Eppolar Geometry p p Normalzed mage coordnates p T E p Eppolar constrant or Longet-Hggns eqaton (98) E [ T ] R Essental matrx The Essental Matrx can be decomposed nto R and T recallng that For dstnct soltons for R and T are possble. E [ T ] R H. Chrstopher Longet-Hggns, A compter algorthm for reconstrctng a scene from two projectons, Natre, 98, PDF. 5

16 Exercse Compte the Essental matrx for the case of two rectfed stereo mages Rectfed case T T = b T = b b E = b b 6

17 How to compte the Essental Matrx? Image Image If we don t know R and T, can we estmate E from two mages? Yes, gen at least 5 correspondences 7

18 How to compte the Essental Matrx? Krppa showed n 93 that 5 mage correspondences s the mnmal case and that there can be at p to soltons. Howeer, n 988, Demazre showed that there are actally at most dstnct soltons. In 996, Phlpp proposed an terate algorthm to fnd these soltons. Only n 4, the frst effcent and non terate solton was proposed. It ses Groebner bass decomposton [Nster, CVPR 4]. The frst poplar solton ses 8 ponts and s called the 8-pont algorthm or Longet-Hggns algorthm (98). Becase of ts ease of mplementaton, t s stll sed today (e.g., NASA roers). H. Chrstopher Longet-Hggns, A compter algorthm for reconstrctng a scene from two projectons, Natre, 98, PDF. D. Nster, An Effcent Solton to the Fe-Pont Relate Pose Problem, PAMI, 4, PDF 8

19 The 8-pont algorthm The Essental matrx E s defned by p T E p Each par of pont correspondences p p T T (,,), (,,) prodes a lnear eqaton: p T E p E e e e 3 e e e 3 e e e e e e3 e e e3 e3 e3 e33 9

20 For n ponts, we can wrte The 8-pont algorthm e e e e e e e e e n n n n n n n n n n n n Q (ths matrx s known) തE (ths matrx s nknown)

21 The 8-pont algorthm Mnmal solton Q (n 9) shold hae rank 8 to hae a nqe (p to a scale) non-tral solton തE Each pont correspondence prodes ndependent eqaton Ths, 8 pont correspondences are needed Oer-determned solton n > 8 ponts A solton s to mnmze Q തE sbject to the constrant തE =. The solton s the egenector correspondng to the smallest egenale of the matrx Q T Q (becase t s the nt ector x that mnmzes Qx = x T Q T Qx). It can be soled throgh Snglar Vale Decomposton (SVD). Matlab nstrctons: [U,S,V] = sd(q); E = V(:,9); E = reshape(e,3,3)'; Q E Degenerate Confgratons The solton of the eght-pont algorthm s degenerate when the 3D ponts are coplanar. Conersely, the fe-pont algorthm works also for coplanar ponts

22 8-pont algorthm: Matlab code A few lnes of code. Go to the exercse ths afternoon to learn how to mplement t

23 8-pont algorthm: Matlab code fncton E = calbrated_eghtpont( p, p) p = p'; % 3xN ector; each colmn = [;;] p = p'; % 3xN ector; each colmn = [;;] Q = [p(:,).*p(:,),... p(:,).*p(:,),... p(:,3).*p(:,),... p(:,).*p(:,),... p(:,).*p(:,),... p(:,3).*p(:,),... p(:,).*p(:,3),... p(:,).*p(:,3),... p(:,3).*p(:,3) ] ; [U,S,V] = sd(q); Eh = V(:,9); E = reshape(eh,3,3)'; 3

24 Interpretaton of the 8-pont algorthm The 8-pont algorthm seeks to mnmze the followng algebrac error T ) Usng the defnton of dot prodct, t can be obsered that N ( p E p ഥp Eഥp = ഥp Eഥp cos(θ) We can see that ths prodct depends on the angle θ betweenഥp and the normal n = Ep to the eppolar plane. It s non zero when ഥp,ഥp, and T are not coplanar. 4

25 Extract R and T from E (ths slde wll not be asked at the exam) Snglar Vale Decomposton: Enforcng rank- constrant: set smallest snglar ale of to : T V U E 3 T V U T ˆ z y x x y x z y z t t t t t t t t t t T ˆ ˆ ˆ ˆ RK K R t K t T V U R ˆ 5

26 4 possble soltons of R and T Only one solton where ponts are n front of both cameras These two ews are flpped by 8 arond the optcal axs 6

27 Strctre from Moton (SFM) Two arants exst: Calbrated camera(s) K, K are known Uses the Essental Matrx Uncalbrated camera(s) K, K are nknown Uses the Fndamental Matrx P =? C R, T =? 7 C

28 p E p T K K E T The Fndamental Matrx Before, we assmed to know the camera ntrnsc parameters and we sed normalzed mage coordnates to get the eppolar constrant for calbrated cameras:

29 The Fndamental Matrx By sbstttng the defnton of normalzed coordnates nto the eppolar constrant, we get the eppolar constrant for ncalbrated cameras: F K E K T - -T T Fndamental Matrx K ] [ K ] [ K E K - -T - -T R T F R T E F 9

30 The 8-pont Algorthm for the Fndamental Matrx The same 8-pont algorthm to compte the essental matrx from a set of normalzed mage coordnates can also be sed to determne the Fndamental matrx: Adantage: we work drectly n pxel coordnates F T 3

31 Problem wth 8-pont algorthm f f f f f f f f f n n n n n n n n n n n n 33

32 Problem wth 8-pont algorthm ~ ~ ~ ~ ~ ~ ~ ~! Orders of magntde dfference between colmn of data matrx least-sqares yelds poor reslts Poor nmercal condtonng, whch makes reslts ery senste to nose Can be fxed by rescalng the data: Normalzed 8-pont algorthm [Hartley, PAMI 97] 34 f f f f f f f f f

33 Normalzed 8-pont algorthm (/3) Ths can be fxed sng a normalzed 8-pont algorthm [Hartley 97], whch estmates the Fndamental matrx on a set of Normalzed correspondences (wth better nmercal propertes) and then nnormalzes the reslt to obtan the fndamental matrx for the gen (nnormalzed) correspondences Idea: Transform mage coordnates so that they are n the range ~[,] [,] One way s to apply the followng rescalng and shft (,) (7,) 7 5 (-,-) (,) (,-) (,5) (7,5) (-,) (,) Hartley, In defense of the eght-pont algorthm, PAMI 97, PDF 35

34 Normalzed 8-pont algorthm (/3) In the orgnal 997 paper, Hartley proposed to rescale the two pont sets sch that the centrod of each set s and the mean standard deaton, so that the aerage pont s eqal to [,, ] T (n homogeneos coordnates). Ths can be done for eery pont as follows: where μ = (μ x, μ y ) = σ N = n p = σ (p μ) mean standard deaton of the pont set. p s the centrod and σ = σ n N = p μ s the Ths transformaton can be expressed n matrx form sng homogeneos coordnates: σ σ μ x p = p σ σ μ y Hartley, In defense of the eght-pont algorthm, PAMI 97, PDF 36

35 Normalzed 8-pont algorthm (3/3) The Normalzed 8-pont algorthm can be smmarzed n three steps:. Normalze pont correspondences: p = B p, p = B p. Estmate normalzed F wth 8-p. algorthm sng normalzed coordnates p, p 3. Compte nnormalzed F from F: F = B F B p T F p = p B F B p F = B F B 37

36 Can R, T, K, K be extracted from F? In general no: nfnte soltons exst Howeer, f the coordnates of the prncpal ponts of each camera are known and the two cameras hae the same focal length f n pxels, then R, T, f can determned nqely 38

37 Comparson between Normalzed and non-normalzed algorthm 8-pont Normalzed 8-pont Nonlnear refnement Ag. Ep. Lne Dstance.33 pxels.9 pxel.86 pxel Ag. Ep. Lne Dstance.8 pxels.85 pxel.8 pxel 39

38 Error Measres The qalty of the estmated Essental matrx can be measred sng dfferent error metrcs. The frst one s the algebrac error that s defned drectly by the Eppolar Constrant: err N ( p T E p ) Remember Slde 4 for the geometrcal nterpretaton of ths error What s the drawback wth ths error measre? Ths error wll exactly be f E s compted from jst 8 ponts (becase n ths case a non-oerdetermned solton exsts). For more than 8 ponts, t may not be (de to mage nose or otlers (oerdetermned system)). There are alternate error fnctons that can be sed to measre the qalty of the estmated Fndamental matrx: the Drectonal Error, the Eppolar Lne Dstance, or the Reprojecton Error. 4

39 Drectonal Error Sm of sqared cosnes of the angle from the eppolar plane: err = (cos(θ )) From slde 4, we obtan: cos(θ) = pt Ep p Ep P =? l E T p Eppolar plane p p n C C 4

40 Eppolar Lne Dstance Sm of Sqared Eppolar-Lne-to-pont Dstances err N d Cheaper than reprojecton error becase does not reqre pont tranglaton (p, l ) d (p, l ) P =? l F T p eppolar plane p p l Fp C C 4

41 Reprojecton Error Sm of the Sqared Reprojecton Errors err N p - π(p ) p - π (P, R, T) Comptaton s expense becase reqres pont tranglaton Howeer t s the most poplar becase more accrate P =? How to compte P? See Sldes 3-36 of Lectre 7 Reprojected pont ( P ) Reprojected pont Obsered pont Obsered pont p p ( P) C C R, T 43

42 Otlne Two-Vew Strctre from Moton Robst Strctre from Moton 44

43 Matched ponts are sally contamnated by otlers (.e., wrong mage matches) Cases of otlers are: changes n ew pont (ncldng scale) and llmnaton mage nose occlsons blr For the camera moton to be estmated accrately, otlers mst be remoed Ths s the task of Robst Estmaton Image Image 45 Dade Scaramzza Unersty of Zrch Robotcs and Percepton Grop - rpg.f.zh.ch

44 Matched ponts are sally contamnated by otlers (.e., wrong mage matches) Cases of otlers are: changes n ew pont (ncldng scale) and llmnaton mage nose occlsons blr For the camera moton to be estmated accrately, otlers mst be remoed Ths s the task of Robst Estmaton Image Image 46 Dade Scaramzza Unersty of Zrch Robotcs and Percepton Grop - rpg.f.zh.ch

45 Error at the loop closre: 6.5 m Error n orentaton: 5 deg Trajectory length: 4 m Before remong the otlers After remong the otlers Otlers can be remoed sng RANSAC [Fshler & Bolles, 98] Dade Scaramzza Unersty of Zrch Robotcs and Percepton Grop - rpg.f.zh.ch 47

46 RANSAC (RAndom SAmple Consenss) RANSAC s the standard method for model fttng n the presence of otlers (ery nosy ponts or wrong data) It can be appled to all sorts of problems where the goal s to estmate the parameters of a model from the data (e.g., camera calbraton, Strctre from Moton, DLT, PnP, P3P, Homography, etc.) Let s reew RANSAC for lne fttng and see how we can se t to do Strctre from Moton M. A.Fschler and R. C.Bolles. Random sample consenss: A paradgm for model fttng wth applcatons to mage analyss and atomated cartography. Graphcs and Image Processng,

47 49 RANSAC

48 5 RANSAC Select sample of ponts at random

49 5 RANSAC Select sample of ponts at random Calclate model parameters that ft the data n the sample

50 5 RANSAC Select sample of ponts at random Calclate model parameters that ft the data n the sample Calclate error fncton for each data pont

51 53 RANSAC Select sample of ponts at random Calclate model parameters that ft the data n the sample Calclate error fncton for each data pont Select data that spport crrent hypothess

52 54 RANSAC Select sample of ponts at random Calclate model parameters that ft the data n the sample Calclate error fncton for each data pont Select data that spport crrent hypothess Repeat

53 55 RANSAC Select sample of ponts at random Calclate model parameters that ft the data n the sample Calclate error fncton for each data pont Select data that spport crrent hypothess Repeat

54 56 RANSAC Select the set wth the maxmm nmber of nlers obtaned wthn k teratons

55 57 RANSAC How many teratons does RANSAC need? Ideally: check all possble combnatons of ponts n a dataset of N ponts. Nmber of all parwse combnatons: N(N-)/ comptatonally nfeasble f N s too large. example: ponts need to check all *999/ 5 possbltes! Do we really need to check all possbltes or can we stop RANSAC after some teratons? Checkng a sbset of combnatons s enogh f we hae a rogh estmate of the percentage of nlers n or dataset Ths can be done n a probablstc way

56 58 RANSAC How many teratons does RANSAC need? w := nmber of nlers/n N := total nmber of data ponts w : fracton of nlers n the dataset w = P(selectng an nler-pont ot of the dataset) Assmpton: the ponts necessary to estmate a lne are selected ndependently w = P(both selected ponts are nlers) -w = P(at least one of these two ponts s an otler) Let k := no. RANSAC teratons exected so far ( -w ) k = P(RANSAC neer selected two ponts that are both nlers) Let p := P(probablty of sccess) -p = ( -w ) k and therefore : k log( log( p) w )

57 59 RANSAC How many teratons does RANSAC need? The nmber of teratons k s k log( log( p) w ) knowng the fracton of nlers w, after k RANSAC teratons we wll hae a probablty p of fndng a set of ponts free of otlers Example: f we want a probablty of sccess p=99% and we know that w=5% k=6 teratons these are sgnfcantly fewer than the nmber of all possble combnatons! Notce: nmber of ponts does not nflence mnmm nmber of teratons k, only w does! In practce we only need a rogh estmate of w. More adanced arants of RANSAC estmate the fracton of nlers and adaptely pdate t at eery teraton (how?)

58 RANSAC appled to Lne Fttng. Intal: let A be a set of N ponts. repeat 3. Randomly select a sample of ponts from A 4. Ft a lne throgh the ponts 5. Compte the dstances of all other ponts to ths lne 6. Constrct the nler set (.e. cont the nmber of ponts whose dstance < d) 7. Store these nlers 8. ntl maxmm nmber of teratons k reached 9. The set wth the maxmm nmber of nlers s chosen as a solton to the problem 6

59 RANSAC appled to general model fttng. Intal: let A be a set of N ponts. repeat 3. Randomly select a sample of s ponts from A 4. Ft a model from the s ponts 5. Compte the dstances of all other ponts from ths model 6. Constrct the nler set (.e. cont the nmber of ponts whose dstance < d) 7. Store these nlers 8. ntl maxmm nmber of teratons k reached 9. The set wth the maxmm nmber of nlers s chosen as a solton to the problem k log( p) log( w s ) 6

60 The Three Key Ingredents of RANSAC In order to mplement RANSAC for Strctre From Moton (SFM), we need three key ngredents:. What s the model n SFM?. What s the mnmm nmber of ponts to estmate the model? 3. How do we compte the dstance of a pont from the model? In other words, can we defne a dstance metrc that measres how well a pont fts the model? 6

61 Answers. What s the model n SFM? The Essental Matrx (for calbrated cameras) or the Fndamental Matrx (for ncalbrated cameras) Alternately, R and T. What s the mnmm nmber of ponts to estmate the model?. We know that 5 ponts s the theoretcal mnmm nmber of ponts. Howeer, f we se the 8-pont algorthm, then 8 s the mnmm 3. How do we compte the dstance of a pont from the model?. Algebrac error ( pҧ Ep ҧ = or p Fp = ) (Slde 4). Drectonal error (Slde 4) 3. Eppolar lne dstance (Slde 4) 4. Reprojecton error (Slde 43) 63

62 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows Image Image 64

63 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres Image 65

64 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres. Randomly select 8 pont correspondences Image 66

65 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres. Randomly select 8 pont correspondences. Ft the model to all other ponts and cont the nlers Image 67

66 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres. Randomly select 8 pont correspondences. Ft the model to all other ponts and cont the nlers 3. Repeat from Image 68

67 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres Image 69

68 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres. Randomly select 8 pont correspondences Image 7

69 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres. Randomly select 8 pont correspondences. Ft the model to all other ponts and cont the nlers Image 7

70 Example: 8-pont RANSAC appled to SfM Let s consder the followng mage par and ts mage correspondences (e.g., Harrs, SIFT, etc.), denoted by arrows For conenence, we oerlay the featres of the second mage on the frst mage and se arrows to denote the moton ectors of the featres. Randomly select 8 pont correspondences. Ft the model to all other ponts and cont the nlers 3. Repeat from for k tmes k log( p) log( ( ) 8 ) Image 7

71 RANSAC teratons k s. s k s exponental n the nmber of ponts s necessary to estmate the model: 8-pont RANSAC Assmng p = 99%, ε = 5% (fracton of otlers) s = 8 ponts (8-pont algorthm) log( p) k s log( ( ) ) 77 teratons 5-pont RANSAC Assmng p = 99%, ε = 5% (fracton of otlers) s = 5 ponts (5-pont algorthm of Dad Nster (4)) log( p) k s log( ( ) ) 45 teratons -pont RANSAC (e.g., lne fttng) Assmng p = 99%, ε = 5% (fracton of otlers) s = ponts log( p) k s log( ( ) ) 6 teratons 73

72 RANSAC teratons k s. ε k s ncreases exponentally wth the fracton of otlers ε 74

73 RANSAC teratons As obsered, k s exponental n the nmber of ponts s necessary to estmate the model The 8-pont algorthm s extremely smple and was ery sccessfl; howeer, t reqres more than 77 teratons Becase of ths, there has been a large nterest by the research commnty n sng smaller moton parameterzatons (.e., smaller s) The frst effcent solton to the mnmal-case solton (5-pont algorthm) took almost a centry (Krppa 93 Nster 4) The 5-pont RANSAC (Nster 4) only reqres 45 teratons; howeer: The 5-pont algorthm can retrn p to soltons of E (worst case scenaro) The 8-pont algorthm only retrns a nqe solton of E Can we se less than 5 ponts? Yes, f yo se moton constrants! 75

74 Planar Moton Planar moton s descrbed by three parameters: θ, φ, ρ R cos sn sn cos T cos sn y x Let s compte the Eppolar Geometry E [ T ] R Essental matrx p T E p Eppolar constrant 76

75 Planar Moton cos sn sn cos R sn cos T Planar moton s descrbed by three parameters: θ, φ, ρ x y Let s compte the Eppolar Geometry R T E ] [ cos sn sn cos cos sn cos sn cos sn cos sn ] [ T 77

76 Planar Moton cos sn sn cos R sn cos T Planar moton s descrbed by three parameters: θ, φ, ρ x y Let s compte the Eppolar Geometry R T E ] [ cos sn cos sn cos sn cos sn ] [ T 78

77 Planar Moton Planar moton s descrbed by three parameters: θ, φ, ρ R cos sn sn cos T cos sn y x Obsere that E has DoF (θ, φ, becase ρ s the scale factor); ths, correspondences are sffcent to estmate and φ [ -Pont RANSAC, Ortn, ] sn E [ T ] R cos sn cos 79

78 Can we se less than pont correspondences? Yes, f we explot wheeled ehcles wth non-holonomc constrants 8

79 Planar & Crclar Moton (e.g., cars) Wheeled ehcles, lke cars, follow locally-planar crclar moton abot the Instantaneos Center of Rotaton (ICR) Example of Ackerman steerng prncple Locally-planar crclar moton 8

80 Planar & Crclar Moton (e.g., cars) Wheeled ehcles, lke cars, follow locally-planar crclar moton abot the Instantaneos Center of Rotaton (ICR) Example of Ackerman steerng prncple Locally-planar crclar moton φ = θ/ => only DoF (θ); ths, only pont correspondence s needed Ths s the smallest parameterzaton possble and reslts n the most effcent algorthm for remong otlers Scaramzza, -Pont-RANSAC Strctre from Moton for Vehcle-Monted Cameras by Explotng Non-holonomc Constrants, Internatonal Jornal of Compter Vson, 8

81 cos sn sn cos R sn cos T Let s compte the Eppolar Geometry p E p T Eppolar constrant R T ] [ E Essental matrx Planar & Crclar Moton (e.g., cars) 83

82 cos sn sn cos R sn cos T Let s compte the Eppolar Geometry R T E ] [ cos sn cos sn cos sn sn cos cos sn cos sn Planar & Crclar Moton (e.g., cars) 84

83 cos sn sn cos R sn cos T Let s compte the Eppolar Geometry cos sn cos sn E Planar & Crclar Moton (e.g., cars) p E p T ) ( cos ) ( sn tan 85

84 -Pont RANSAC algorthm Compte θ for eery pont correspondence tan Only teraton! The most effcent algorthm for remong otlers, p to Hz -Pont RANSAC s ONLY sed to fnd the nlers. Moton s then estmated from them n 6DOF 86

85 Comparson of RANSAC algorthms 9 8 Nmber of teratons, N pont RANSAC -pont RANSAC -pont RANSAC Fracton of otlers n the data (%) N log( p) log( ( ) s ) where we typcally se p 99% Nmb. of teratons 8-Pont RANSAC [Longet-Hggns 8] 5-Pont RANSAC [Nster 4] -Pont RANSAC [Ortn ] -Pont RANSAC [Scaramzza ] > 77 >45 >6 = 87

86 Vsal Odometry wth -Pont RANSAC Scaramzza, -Pont-RANSAC Strctre from Moton for Vehcle-Monted Cameras by Explotng Non-holonomc Constrants, Internatonal Jornal of Compter Vson, 88

87 Thngs to remember SFM from ew Calbrated and ncalbrated case Proof of Eppolar Constrant 8-pont algorthm and algebrac error Normalzed 8-pont algorthm Algebrac, drectonal, Eppolar lne dstance, Reprojecton error RANSAC and ts applcaton to SFM 8 s 5 s pont RANSAC, pros and cons Readngs: Ch. 4. of Corke book CH. 7. of Szelsk book 89

88 Understandng Check Are yo able to answer the followng qestons? What's the mnmm nmber of correspondences reqred for calbrated SFM and why? Are yo able to dere the eppolar constrant? Are yo able to defne the essental matrx? Are yo able to dere the 8-pont algorthm? How many rotaton-translaton combnatons can the essental matrx be decomposed nto? Are yo able to prode a geometrcal nterpretaton of the eppolar constrant? Are yo able to descrbe the relaton between the essental and the fndamental matrx? Why s t mportant to normalze the pont coordnates n the 8-pont algorthm? Descrbe one or more possble ways to achee ths normalzaton. Are yo able to descrbe the normalzed 8-pont algorthm? Are yo able to prode qalty metrcs for the essental matrx estmaton? Why do we need RANSAC? What s the theoretcal maxmm nmber of combnatons to explore? After how many teratons can RANSAC be stopped to garantee a gen sccess probablty? What s the trend of RANSAC s. teratons, s. the fracton of otlers, s. the nmber of ponts to estmate the model? How do we apply RANSAC to the 8-pont algorthm, DLT, P3P? How can we redce the nmber of RANSAC teratons for the SFM problem? 9

Modeling Local Uncertainty accounting for Uncertainty in the Data

Modeling Local Uncertainty accounting for Uncertainty in the Data Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Structure from Motion

Structure from Motion Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton

More information

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method An Improved Isogeometrc Analyss Usng the Lagrange Mltpler Method N. Valzadeh 1, S. Sh. Ghorash 2, S. Mohammad 3, S. Shojaee 1, H. Ghasemzadeh 2 1 Department of Cvl Engneerng, Unversty of Kerman, Kerman,

More information

Computer Vision. Exercise Session 1. Institute of Visual Computing

Computer Vision. Exercise Session 1. Institute of Visual Computing Computer Vson Exercse Sesson 1 Organzaton Teachng assstant Basten Jacquet CAB G81.2 basten.jacquet@nf.ethz.ch Federco Camposeco CNB D12.2 fede@nf.ethz.ch Lecture webpage http://www.cvg.ethz.ch/teachng/compvs/ndex.php

More information

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD ISSN : 0973-739 Vol. 3, No., Janary-Jne 202, pp. 39-42 OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD Rahl Mshra, Mahesh K. Chohan 2, and Dhraj Ntnawwre 3,2,3 Department of Electroncs,

More information

Hybrid Method of Biomedical Image Segmentation

Hybrid Method of Biomedical Image Segmentation Hybrd Method of Bomedcal Image Segmentaton Mng Hng Hng Department of Electrcal Engneerng and Compter Scence, Case Western Reserve Unversty, Cleveland, OH, Emal: mxh8@case.ed Abstract In ths paper we present

More information

Numerical Solution of Deformation Equations. in Homotopy Analysis Method

Numerical Solution of Deformation Equations. in Homotopy Analysis Method Appled Mathematcal Scences, Vol. 6, 2012, no. 8, 357 367 Nmercal Solton of Deformaton Eqatons n Homotopy Analyss Method J. Izadan and M. MohammadzadeAttar Department of Mathematcs, Faclty of Scences, Mashhad

More information

A General Algorithm for Computing Distance Transforms in Linear Time

A General Algorithm for Computing Distance Transforms in Linear Time Ths chapter has been pblshed as: A. Mejster, J. B. T. M. Roerdnk and W. H. Hesselnk, A general algorthm for comptng dstance transforms n lnear tme. In: Mathematcal Morphology and ts Applcatons to Image

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

More information

Calibrating a single camera. Odilon Redon, Cyclops, 1914

Calibrating a single camera. Odilon Redon, Cyclops, 1914 Calbratng a sngle camera Odlon Redon, Cclops, 94 Our goal: Recover o 3D structure Recover o structure rom one mage s nherentl ambguous??? Sngle-vew ambgut Sngle-vew ambgut Rashad Alakbarov shadow sculptures

More information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros. Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both

More information

AIMS Computer vision. AIMS Computer Vision. Outline. Outline.

AIMS Computer vision. AIMS Computer Vision. Outline. Outline. AIMS Computer Vson 1 Matchng, ndexng, and search 2 Object category detecton 3 Vsual geometry 1/2: Camera models and trangulaton 4 Vsual geometry 2/2: Reconstructon from multple vews AIMS Computer vson

More information

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape

More information

RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5

RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5 RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA Taeyoon Lee a, *, Taeung Km a, Gunho Sohn b, James Elder a a Department of Geonformatc Engneerng, Inha Unersty, 253 Yonghyun-dong,

More information

Computer Vision I. Xbox Kinnect: Rectification. The Fundamental matrix. Stereo III. CSE252A Lecture 16. Example: forward motion

Computer Vision I. Xbox Kinnect: Rectification. The Fundamental matrix. Stereo III. CSE252A Lecture 16. Example: forward motion Xbox Knnect: Stereo III Depth map http://www.youtube.com/watch?v=7qrnwoo-8a CSE5A Lecture 6 Projected pattern http://www.youtube.com/watch?v=ceep7x-z4wy The Fundamental matrx Rectfcaton The eppolar constrant

More information

GSA Training Notes Raft and Piled-raft Analysis

GSA Training Notes Raft and Piled-raft Analysis GSA Tranng Notes Rat and Pled-rat Analyss 1 Introdcton Rat analyss n GSA provdes a means o lnkng GSA statc analyss and sol settlement analyss, so the sol-strctre nteractons can be consdered n the analyss.

More information

Using Geometric Primitives to Calibrate Traffic Scenes

Using Geometric Primitives to Calibrate Traffic Scenes Usng Geometrc Prmtves to Calbrate Traffc Scenes Osama Masod Department of Compter Scence and Engneerng Unverst of Mnnesota Mnneapols, MN masod@cs.mn.ed Nkolaos P. Papankolopolos Department of Compter Scence

More information

Scheduling with Integer Time Budgeting for Low-Power Optimization

Scheduling with Integer Time Budgeting for Low-Power Optimization Schedlng wth Integer Tme Bdgetng for Low-Power Optmzaton We Jang, Zhr Zhang, Modrag Potkonjak and Jason Cong Compter Scence Department Unversty of Calforna, Los Angeles Spported by NSF, SRC. Otlne Introdcton

More information

Recognizing Periodicities on 3D Scanned Meshes Based on Indexed-ICP Algorithm

Recognizing Periodicities on 3D Scanned Meshes Based on Indexed-ICP Algorithm Orgnal Artcle Proceedngs of IDMME - Vrtal Concept 8 Beng Chna October 8 8 Recognzng Perodctes on 3D Scanned Meshes Based on Indeed-ICP Algorthm Dase Kondo Tomohro Mzogch Satosh Kana Gradate School of Informaton

More information

Image warping and stitching May 5 th, 2015

Image warping and stitching May 5 th, 2015 Image warpng and sttchng Ma 5 th, 2015 Yong Jae Lee UC Davs PS2 due net Frda Announcements 2 Last tme Interactve segmentaton Feature-based algnment 2D transformatons Affne ft RANSAC 3 1 Algnment problem

More information

Line-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video

Line-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video 01 IEEE Internatonal Conference on Robotcs and Automaton RverCentre, Sant Paul, Mnnesota, USA May 14-18, 01 Lne-based Camera Movement Estmaton by Usng Parallel Lnes n Omndrectonal Vdeo Ryosuke kawansh,

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Image Alignment CSC 767

Image Alignment CSC 767 Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances

More information

Gamma/X-Ray Linear Pushbroom Stereo for 3D Cargo Inspection

Gamma/X-Ray Linear Pushbroom Stereo for 3D Cargo Inspection Gamma/X-Ray Lnear Pshbroom Stereo for 3D Cargo Inspecton Zhgang Zh *ab, Y-Ch H bc a Department of Compter Scence, The Cty College of New Yor, New Yor, NY 3 b Department of Compter Scence, The CUNY Gradate

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects Clemson Unversty TgerPrnts All Theses Theses 12-2011 A Comparson and Evaluaton of Three Dfferent Pose Estmaton Algorthms In Detectng Low Texture Manufactured Objects Robert Krener Clemson Unversty, rkrene@clemson.edu

More information

RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS

RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS RESSTE CRCUTS MULT NODE/LOOP CRCUT ANALYSS DEFNNG THE REFERENCE NODE S TAL 4 THESTATEMENT 4 S MEANNGLES UNTL THE REFERENCE PONT S DEFNED BY CONENTON THE GROUND SYMBOL SPECFES THE REFERENCE PONT. ALL NODE

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

3D Rigid Facial Motion Estimation from Disparity Maps

3D Rigid Facial Motion Estimation from Disparity Maps 3D Rgd Facal Moton Estmaton from Dsparty Maps N. Pérez de la Blanca 1, J.M. Fuertes 2, and M. Lucena 2 1 Department of Computer Scence and Artfcal Intellgence ETSII. Unversty of Granada, 1871 Granada,

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

New dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system

New dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system New dynamc oom calbraton technque for a stereo-vson based mult-vew 3D modelng system Tao Xan, Soon-Yong Park, Mural Subbarao Dept. of Electrcal & Computer Engneerng * State Unv. of New York at Stony Brook,

More information

LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT

LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT LOOP ANALYSS The second systematic technique to determine all currents and oltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE NECESSARY

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Introduction to Geometric

Introduction to Geometric Manel Ventra Shp Desgn I MSc n Marne Engneerng and Naal Archtectre Smmary. Parametrc Cres 2. Parametrc Srfaces 2 Parametrc Cres. Mathematcal Formlatons Cbc Splnes Bézer B-Splne Beta-Splne NURBS 2. Interpolaton

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

A large-alphabet oriented scheme for Chinese and English text compression

A large-alphabet oriented scheme for Chinese and English text compression A large-alphabet orented scheme for Chnese and Englsh text compresson Hng-Yan G * Department of Compter Scence and Informaton Engneerng atonal Tawan Unersty of Scence and Technology Tape Tawan SUMMARY

More information

Model-Based Bundle Adjustment to Face Modeling

Model-Based Bundle Adjustment to Face Modeling Model-Based Bundle Adjustment to Face Modelng Oscar K. Au Ivor W. sang Shrley Y. Wong oscarau@cs.ust.hk vor@cs.ust.hk shrleyw@cs.ust.hk he Hong Kong Unversty of Scence and echnology Realstc facal synthess

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

New Extensions of the 3-Simplex for Exterior Orientation

New Extensions of the 3-Simplex for Exterior Orientation New Extensons of the 3-Smplex for Exteror Orentaton John M. Stenbs Tyrone L. Vncent Wllam A. Hoff Colorado School of Mnes jstenbs@gmal.com tvncent@mnes.edu whoff@mnes.edu Abstract Object pose may be determned

More information

Detection of an Object by using Principal Component Analysis

Detection of an Object by using Principal Component Analysis Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,

More information

EVALUATION OF RELATIVE POSE ESTIMATION METHODS FOR MULTI-CAMERA SETUPS

EVALUATION OF RELATIVE POSE ESTIMATION METHODS FOR MULTI-CAMERA SETUPS EVALUAION OF RELAIVE POSE ESIMAION MEHODS FOR MULI-CAMERA SEUPS Volker Rodehorst *, Matthas Henrchs and Olaf Hellwch Computer Vson & Remote Sensng, Berln Unversty of echnology, Franklnstr. 8/9, FR 3-,

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Calibration of an Articulated Camera System with Scale Factor Estimation

Calibration of an Articulated Camera System with Scale Factor Estimation Calbraton of an Artculated Camera System wth Scale Factor Estmaton CHEN Junzhou, Kn Hong WONG arxv:.47v [cs.cv] 7 Oct Abstract Multple Camera Systems (MCS) have been wdely used n many vson applcatons and

More information

A Flexible Technique for Accurate Omnidirectional Camera Calibration and Structure from Motion

A Flexible Technique for Accurate Omnidirectional Camera Calibration and Structure from Motion A Flexble Technque for Accurate Omndrectonal Camera Calbraton and Structure from Moton Dade Scaramuzza, Agostno Martnell, Roland Segwart Swss Federal Insttute of Technology Lausanne (EPFL) CH-5 Lausanne,

More information

ScienceDirect. The Influence of Subpixel Corner Detection to Determine the Camera Displacement

ScienceDirect. The Influence of Subpixel Corner Detection to Determine the Camera Displacement Avalable onlne at www.scencedrect.com ScenceDrect Proceda Engneerng ( ) 8 8 th DAAAM Internatonal Symposum on Intellgent Manufacturng and Automaton, DAAAM The Influence of Subpxel Corner Detecton to Determne

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

Fusion of Static and Dynamic Body Biometrics for Gait Recognition

Fusion of Static and Dynamic Body Biometrics for Gait Recognition Fson of Statc and Dynamc Body Bometrcs for Gat Recognton Lang Wang, Hazhong Nng, Ten Tan, Wemng H Natonal Laboratory of Pattern Recognton (NLPR) Insttte of Atomaton, Chnese Academy of Scences, Bejng, P.

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

3D Motion Estimation & Tracking. Suya You

3D Motion Estimation & Tracking. Suya You 3D Moton Estmaton & Trackng Sya Yo Integrated Meda Systems Center Compter Scence Department Unversty of Sothern Calforna Jne 2004 1 Trackng Is Major Obstacle Sensor pose trackng Where am I, and where am

More information

AN INTEGRATED SEMANTICALLY CORRECT 2,5 DIMENSIONAL OBJECT ORIENTED TIN

AN INTEGRATED SEMANTICALLY CORRECT 2,5 DIMENSIONAL OBJECT ORIENTED TIN AN INTEGRATED SEMANTICAY CORRECT 2,5 DIMENSIONA OBJECT ORIENTED TIN A. Koch Insttte of Photogrammetry and GeoInformaton (IPI), Unersty of Hannoer, Germany Nenbrger Straße 1, 30167 Hannoer koch@p.n-hannoer.de

More information

Using BESO method to optimize the shape and reinforcement of the underground openings

Using BESO method to optimize the shape and reinforcement of the underground openings Usng BS method to optmze the shape and renforcement of the ndergrond openngs. Ghabrae, Y.M. Xe & X. Hang School of Cvl, nvronmental and Chemcal ngneerng, MI Unversty, Melborne, Astrala ABSAC: In excavaton

More information

Multilevel Iterative Methods

Multilevel Iterative Methods Mltleel Iterate Methods Erc Yn Adsor: Professor Randy Bank, UCSD Contents Introdcton.. 3 Basc Mltgrd Algorthm. Mltgrd fondatons 3. Mltgrd algorthm 4 3 Epermentaton 5 4 Algebrac Mltgrd (AMG) 4. Introdcton

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

3D Modeling Using Multi-View Images. Jinjin Li. A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science

3D Modeling Using Multi-View Images. Jinjin Li. A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science 3D Modelng Usng Mult-Vew Images by Jnjn L A Thess Presented n Partal Fulfllment of the Requrements for the Degree Master of Scence Approved August by the Graduate Supervsory Commttee: Lna J. Karam, Char

More information

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon

More information

Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization

Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization A pblcaton of 47 CHEMICA ENGINEERING TRANSACTIONS VO 3, 3 Cef Edtors: Saro Percc, Jří J Klemeš Copyrgt 3, AIDIC Servz Srl, ISBN 978-88-9568-3-5; ISSN 974-979 Te Italan Assocaton of Cemcal Engneerng Onlne

More information

Calibration of an Articulated Camera System

Calibration of an Articulated Camera System Calbraton of an Artculated Camera System CHEN Junzhou and Kn Hong WONG Department of Computer Scence and Engneerng The Chnese Unversty of Hong Kong {jzchen, khwong}@cse.cuhk.edu.hk Abstract Multple Camera

More information

Inverse-Polar Ray Projection for Recovering Projective Transformations

Inverse-Polar Ray Projection for Recovering Projective Transformations nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis

BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING Drect Current Crcuts : Methods of Analyss Ismal Mohd Kharuddn, Zulkfl Md Yusof Faculty of Manufacturng Engneerng Unerst Malaysa Pahang Drect Current Crcut

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Robust Computation and Parametrization of Multiple View. Relations. Oxford University, OX1 3PJ. Gaussian).

Robust Computation and Parametrization of Multiple View. Relations. Oxford University, OX1 3PJ. Gaussian). Robust Computaton and Parametrzaton of Multple Vew Relatons Phl Torr and Andrew Zsserman Robotcs Research Group, Department of Engneerng Scence Oxford Unversty, OX1 3PJ. Abstract A new method s presented

More information

Stereo (Part 2) Introduction to Computer Vision CSE 152 Lecture 9

Stereo (Part 2) Introduction to Computer Vision CSE 152 Lecture 9 Stereo (Part 2) CSE 152 Lectre 9 Annoncements Homework 3 is de May 9 11:59 PM Reading: Chapter 7: Stereopsis Stereo Vision Otline Offline: Calibrate cameras & determine B epipolar geometry Online C D A

More information

Geometric Transformations and Multiple Views

Geometric Transformations and Multiple Views CS 2770: Computer Vson Geometrc Transformatons and Multple Vews Prof. Adrana Kovaska Unverst of Pttsburg Februar 8, 208 W multple vews? Structure and dept are nerentl ambguous from sngle vews. Multple

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Improving Initial Estimations for Structure from Motion Methods

Improving Initial Estimations for Structure from Motion Methods Improvng Intal Estmatons for Structure from Moton Methods Chrstopher Schwartz Renhard Klen Insttute for Computer Scence II, Unversty of Bonn Abstract In Computer Graphcs as well as n Computer Vson and

More information

Prof. Feng Liu. Spring /24/2017

Prof. Feng Liu. Spring /24/2017 Prof. Feng Lu Sprng 2017 ttp://www.cs.pd.edu/~flu/courses/cs510/ 05/24/2017 Last me Compostng and Mattng 2 oday Vdeo Stablzaton Vdeo stablzaton ppelne 3 Orson Welles, ouc of Evl, 1958 4 Images courtesy

More information

Fitting and Alignment

Fitting and Alignment Fttng and Algnment Computer Vson Ja-Bn Huang, Vrgna Tech Many sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 1 Competton: Edge Detecton Submsson lnk HW 2 wll be posted tonght Due Oct 09 (Mon)

More information

Geometric Primitive Refinement for Structured Light Cameras

Geometric Primitive Refinement for Structured Light Cameras Self Archve Verson Cte ths artcle as: Fuersattel, P., Placht, S., Maer, A. Ress, C - Geometrc Prmtve Refnement for Structured Lght Cameras. Machne Vson and Applcatons 2018) 29: 313. Geometrc Prmtve Refnement

More information

Finding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting

Finding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting Fndng Intrnsc and Extrnsc Vewng Parameters from a Sngle Realst Pantng Tadeusz Jordan 1, Davd G. Stork,3, Wa L. Khoo 1, and Zhgang Zhu 1 1 CUNY Cty College, Department of Computer Scence, Convent Avenue

More information

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont) Loop Transformatons for Parallelsm & Localty Prevously Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Loop nterchange Loop transformatons and transformaton frameworks

More information

Correspondence-free Synchronization and Reconstruction in a Non-rigid Scene

Correspondence-free Synchronization and Reconstruction in a Non-rigid Scene Correspondence-free Synchronzaton and Reconstructon n a Non-rgd Scene Lor Wolf and Assaf Zomet School of Computer Scence and Engneerng, The Hebrew Unversty, Jerusalem 91904, Israel e-mal: {lwolf,zomet}@cs.huj.ac.l

More information

Self-Calibration from Image Triplets. 1 Robotics Research Group, Department of Engineering Science, Oxford University, England

Self-Calibration from Image Triplets. 1 Robotics Research Group, Department of Engineering Science, Oxford University, England Self-Calbraton from Image Trplets Martn Armstrong 1, Andrew Zsserman 1 and Rchard Hartley 2 1 Robotcs Research Group, Department of Engneerng Scence, Oxford Unversty, England 2 The General Electrc Corporate

More information

Circle-based Recommendation in Online Social Networks

Circle-based Recommendation in Online Social Networks Crcle-based Recommendaton n Onlne Socal Networks Xwang Yang ECE Department Polytechnc Insttte of NYU Brooklyn, New York xyang0@stdents.poly.ed Harald Steck Bell Labs Alcatel-Lcent Mrray Hll, New Jersey

More information

Analog amplifier card Type VT-VSPA2-1-2X/V0/T1 Type VT-VSPA2-1-2X/V0/T5

Analog amplifier card Type VT-VSPA2-1-2X/V0/T1 Type VT-VSPA2-1-2X/V0/T5 Analog amplfer card Type VT-VPA2--2X/V0/T Type VT-VPA2--2X/V0/T5 RE 300-Z/0. Replace: 02. /0 Addtonal nfmaton Infmaton regardng the converson of dfferent amplfer cards to amplfer card type VT-VPA2--2X/V0/T

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

A Revisit of Methods for Determining the Fundamental Matrix with Planes

A Revisit of Methods for Determining the Fundamental Matrix with Planes A Revst of Methods for Determnng the Fundamental Matrx wth Planes Y Zhou 1,, Laurent Knep 1,, and Hongdong L 1,,3 1 Research School of Engneerng, Australan Natonal Unversty ARC Centre of Excellence for

More information

Introduction to Multiview Rank Conditions and their Applications: A Review.

Introduction to Multiview Rank Conditions and their Applications: A Review. Introducton to Multvew Rank Condtons and ther Applcatons: A Revew Jana Košecká Y Ma Department of Computer Scence, George Mason Unversty Electrcal & Computer Engneerng Department, Unversty of Illnos at

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE

SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro

More information

Optimal Combination of Stereo Camera Calibration from Arbitrary Stereo Images.

Optimal Combination of Stereo Camera Calibration from Arbitrary Stereo Images. Tna Memo No. 1991-002 Image and Vson Computng, 9(1), 27-32, 1990. Optmal Combnaton of Stereo Camera Calbraton from Arbtrary Stereo Images. N.A.Thacker and J.E.W.Mayhew. Last updated 6 / 9 / 2005 Imagng

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume

More information

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law) Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION The crrent I NS as a fncton of the bas oltage V throgh a N/S pont contact nterface can be descrbed by the BTK theory [3] n whch the nterfacal barrer s represented by a fncton wth a dmensonless strength

More information

MOTION BLUR ESTIMATION AT CORNERS

MOTION BLUR ESTIMATION AT CORNERS Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

Organization-Aware Routing in Mission Critical Networks

Organization-Aware Routing in Mission Critical Networks Organzaton-Aware Rotng n Msson Crtcal Networks Yanzh Peter Chen Department of Compter Scence Memoral Unersty of Newfondland St. John s, NL Canada Emal: yzchen@cs.mn.ca Ljn Qan Department of Electrcal and

More information

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation Loop Transformatons for Parallelsm & Localty Last week Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Scalar expanson for removng false dependences Loop nterchange Loop

More information

Feature Extraction and Registration An Overview

Feature Extraction and Registration An Overview Feature Extracton and Regstraton An Overvew S. Seeger, X. Laboureux Char of Optcs, Unversty of Erlangen-Nuremberg, Staudstrasse 7/B2, 91058 Erlangen, Germany Emal: sns@undne.physk.un-erlangen.de, xl@undne.physk.un-erlangen.de

More information