CAMERA AUTOCALIBRATION AND HOROPTER CURVES

Size: px
Start display at page:

Download "CAMERA AUTOCALIBRATION AND HOROPTER CURVES"

Transcription

1 CAMERA AUTOCALIBRATION AND HOROPTER CURVES JOSÉ IGNACIO RONDA, ANTONIO VALDÉS, AND FERNANDO JAUREGUIZAR * Grupo de Tratamieto de Imágees ** Dep. de Geometría y Topología Uiversidad Politécica de Madrid Uiversidad Complutese de Madrid E Madrid, Spai E Madrid, Spai {jir,j}@gti.ssr.upm.es Atoio Valdes@mat.ucm.es Abstract. We describe a ew algorithm or the obtaimet o the aie ad Euclidea calibratio o a camera uder geeral motio. The algorithm exploit the relatioships o the horopter curves associated to each pair o cameras with the plae at iiity ad the absolute coic. Usig these properties we deie cost uctios whose miimizatio by meas o geeral purpose techiques provides the required calibratio. The experimets show the good covergece properties, computatioal eiciecy ad robust perormace o the ew techiques. Keywords: camera autocalibratio, horopter, projective geometry, oliear optimizatio. 1. Itroductio The semial paper [2] was the irst to show the possibility o calibratig a camera rom a set o views, avoidig the use o ay kid o calibratig object. Their method was based i the so-called Kruppa equatios, which permit to locate the plae at iiity ad the absolute coic i it, so recoverig the Euclidea structure o space. Additioal objects ad cocepts came later to provide alterative tools ad methods to solve the sel-calibratio problem. I [18] the absolute quadric was itroduced. This is a sigular imagiary quadric i the dual space P 3 which ecodes simultaeously the positio o the plae at iiity ad the absolute coic. I [] the homographies betwee images iduced by the plae at iiity are employed to obtai the uimodular costrait rom which the plae at iiity ca be oud. The key observatio o this work is that or the plae at iiity the associated homography is cojugated to a rotatio ad thereore its eigevalues are all o them o equal modulus. Other approaches to sel-calibratio ca be oud i [4] ad [7]. Aother atural geometric object associated to a pair o idetically calibrated cameras is the horopter curve, deied as the set o poits i space which have the same image coordiates i both cameras, ad geerically is a twisted cubic. They were itroduced i moder computer visio by Maybak i [9], appearig as oe o the irreducible compoets o the quartic curve obtaied as itersectio o two ambiguous suraces. Some o the iterestig properties o horopter curves ca be oud i [9], [10], [7]. Up to our kowledge, horopter curves have ot bee used so ar i their ull potetial or the sel-calibratio problem, with the remarkable exceptios o the works o Armstrog et al. [1] ad o Schaalitzky [15]. I the irst oe it is show how horopters ca be used or the recovery o the plae at iiity i the special case o plaar camera motios. I the secod the properties o horopter curves are employed to obtai ew polyomial equatios or the obtaimet o the plae at iiity. All the previously metioed methods, as well as the preset work, deal with the recovery o arbitrary but costat itrisic parameters o the camera. Research has also bee coducted elsewhere to cover the case o varyig itrisic parameters with some restrictios (see e.g., [8] ad the reereces therei). The mai idea behid the algorithms is to take advatage o the highly sigular coiguratio adopted by the horopter curves i relatio with the plae at iiity ad the absolute coic, which is preserved by homographies o the space. The, startig rom a projective calibratio, this allows or the deiitio o cost uctios o the set o plaes o the space which vaish or the plae at iiity idepedetly o the adopted projective coordiates. The miimizatio is carried out by meas o a Leveberg-Marquardt algorithm. Experimets show the good covergece ad stability properties o the techique, eve i the presece o oise, alog with its computatioally eiciecy. Besides, the approach does ot require the precise iitializatio which is usually imperative. The paper is orgaized as ollows: Sectio 2 reviews the projective camera model ad ormalizes the selcalibratio problem. Sectio 3 provides a sel-cotaied presetatio o the relevat properties o horopter curves. Date: December 1, This work has bee partly supported by the Comisió Itermiisterial de Ciecia y Tecología (CICYT) o the Spaish Govermet. 1

2 2 JOSÉ IGNACIO RONDA, ANTONIO VALDÉS, AND FERNANDO JAUREGUIZAR Some o these properties are ew ad or the others we have provided ew proos toward a more cosistet ad geometric-orieted presetatio. Sectio 3 describes the algorithms ad, ially, Sectio 4 provides the experimetal results. The mai cotributios o this work, appart rom the autocalibratio algorithms, cosist i relatig horopter curves with the uimodular costrait o [], which is doe i Theorems ad 3.2. Theorems 3.5 ad 3.6 also preset ew results cocerig the geometry o horopter curves. 2. Mathematical model o camera sel-calibratio Our model or a real camera will be the traditioal pihole camera [3], which is deied by its optical ceter C ad the image plae π. The image plae is edowed with a aie coordiate system (O;u,v), where O π is a arbitrary origi o coordiates ad vectors u ad v orm a basis o the plae, ot ecessarily orthoormal. I practice this coordiate system is that give by the pixel structure o the camera. The capture o the 3D-scee is the mathematically modeled as the correspodece o each space poit with its projectio oto the plae π with ceter C. For coveiece, we cosider the Euclidea space coordiate system {C;x,y,z} where x = u/ u, y is deied so that {x,y} is a orthoormal basis o π with the same orietatio o {u,v}, ad z completes them to a orthoormal basis ad poits toward the camera rom C. Usig homogeeous coordiates attached to the previously deied reereces, say Q c = (x c, y c, z c, t c ) T ad q = (u, v, w) T or space ad image poits, respectively, the equatios o the projectio are q = λk(i 0)Q c, where I is the 3 3 idetity matrix, λ is a projective proportioality costat, ad K is the matrix o itrisic parameters give by cot u 0 u u K = 0 v 0. v si I this matrix is the ocal legth, i.e., the Euclidea distace rom the optical ceter to the image plae, is the agle rom u to v, ad (u 0, v 0 ) T are the o-homogeeous image coordiates o the, i.e., the orthogoal projectio o C oto π [3]. More geerally, i we wat to use ad arbitrary Euclidea space coordiate system istead o the oe associated to the camera, the projectio equatios become q = λk (R t) Q e where Q e = (x, y, z, t) T are the space poit homogeeous coordiates i the ew reerece ad R ad t are respectively the rotatio matrix ad traslatio vector givig the motio rom the secod to the irst space systems. Eve more geerally, we ca use a arbitrary projective 3D coordiate system istead o a Euclidea oe, with coordiates Q = (X, Y, Z, T) T related to the Euclidea coordiates by a 4 4 regular matrix G so that Q e = µ GQ, where µ is a projective proportioality costat. I this case the equatio o the projectio is give by q = νpq where P = K (R t)g ad we have abbreviated ν = λµ. The kowledge o the projectio matrix P reerred to the metioed 3D projective coordiate system ad the 2D aie coordiate system o the camera is called a projective calibratio o the camera. I the case o multiple cameras, a projective calibratio o the set is the kowledge o their projectio matrices with respect to a commo projective space reerece ad their respective image plae reereces. A importat issue is to obtai a projective calibratio respetig the covex hull o the poits i the image (see [6], [11]). The aie calibratio o the set o cameras cosist i the obtaimet o the projectio matrices with respect to ay aie space reerece. We recall that a aie reerece is just a projective reerece {X 0,X 1,X 2,X 3,E} such that X 1,X 2 ad X 3 belog to the plae at iiity (see [16]). Thereore the aie calibratio ca be achieved by determiig the coordiates o the plae at iiity. Aalogously, a Euclidea calibratio is a aie calibratio or which the aie reerece is Euclidea, i.e., such that the absolute coic has equatios X 2 + Y 2 + Z 2 = T = 0.

3 CAMERA AUTOCALIBRATION AND HOROPTER CURVES 3 This correspods to the usual otio that the basis o the associated Cartesia reerece is orthoormal (up to a scale actor). 3. Horopter curves 3.1. Deiitio ad basic properties. Let us cosider two cameras idetical i every respect but i their space positio. This meas that each elemet o the secod camera ca be obtaied rom the correspodig elemet o the irst oe by applyig to it a commo Euclidea motio. The set o 3D poits whose projectios o both cameras have idetical coordiates is called the horopter associated to the pair o cameras. I this paper we will oly develop those properties o the horopter curves which are related to the recovery o itrisic ad extrisic parameters. The iterested reader may cosult [9], [10], [7] or related iormatio o the subject. Let us compute the equatio o the horopter associated with a couple o cameras with projectio matrices P i = λ i K(R i t i )G, i = 1, 2. A poit Q projects oto each camera o poits o the same homogeeous projective coordiates i ad oly i (1) P 1 Q = P 2 Q, or some costat C { } = P 1 uderstood as a projective parameter, i the sese o [16]. Note that the particular cases = 0 or = correspod to the camera ceters, which always belog to the horopter. Equatio (1) meas that Q belogs to the ull-space o the matrix P 1 P 2. To compute this kerel, let us deote by a T i, bt i ad c T i the rows o the matrix P i. A poit Q is i this kerel i ad oly i it satisies the system o equatios (a T 1 at 2 )Q = 0 (b T 1 bt 2 )Q = 0 (c T 1 c T 2 )Q = 0. This meas that Q lies simultaeously i the plaes o coordiates a 1 a 2, b 1 b 2 ad c 1 c 2. Let us deote by α = (α 1, α 2, α 3, α 4 ) T the coeiciets o a geeric plae. The plaes o the star through Q (we recall see [16] that this is the set o plaes ad lies cotaiig Q) are give by the equatio det(α, a 1 a 2, b 1 b 2, c 1 c 2 ) = 0. The coordiates o Q are thereore the coeiciets o (α 1, α 2, α 3, α 4 ) i this equatio. From this we see that the homogeeous coordiates o Q are give by our polyomials o degree three i. Geerically, these polyomials are idepedet ad the horopter is thereore a twisted cubic. For more iormatio o twisted cubics, see [16]. We will deote the parametric equatio o the horopter by h = h() The horopter ad the absolute coic. Beig the horopter a cubic curve, it geerically meets each plae i three poits (maybe o complex coordiates). Let us deote the plae at iiity by π. A poit Q π o Euclidea coordiates Q e G 1 Q = (x, y, z, 0) T belogs to the horopter i ad oly i (P 1 P 2 )Q K(λ 1 R 1 λ 2 R 2 λ 1 t 1 λ 2 t 2 )Q e = 0. Settig ˆQ e = (x, y, z) T ad α = λ 2 /λ 1, this is equivalet to (R 1 α R 2 ) ˆQ e = 0 (R T 2 R 1 α I) ˆQ e = 0. Observe that R = R T 2 R 1 is the rotatio part o the motio carryig the irst camera to the secod oe. The last equatio meas that ˆQ e is a eigevector o R with eigevalue α. Beig R a rotatio matrix, its eigevalues are 1, e iϕ ad e iϕ where ϕ is the rotatio agle. The eigevector associated with the eigevalue α = 1 must be real ad correspods to the directio o the rotatio axis. Cosiderig a eigevector ˆQ e o eigevalue e iϕ we have that ˆQ et ˆQe = ˆQ et R T R ˆQ e = (R ˆQ e ) T (R ˆQ e ) = e iϕ ˆQeT e iϕ ˆQe = e 2iϕ ˆQeT ˆQe. So, as log as e 2iϕ 1, i.e, ϕ 0, π (as we will assume rom ow o) we obtai that ˆQ et ˆQe = 0, i.e, its coordiates satisy the equatio x 2 + y 2 + z 2 = 0. This meas that the complex eigevectors are poits o the absolute coic (see [16], [3] or iormatio o the absolute coic ad how it ecodes the Euclidea or, more precisely, coormal structure o the space). Deotig by ˆQ e 0 the real eigevector ad by ˆQ e 1, ˆQe 2 the complex cojugate eigevectors o R, a similar computatio shows that ˆQ et 0 ˆQ e 1 = ˆQ et 0 ˆQ e 2 = 0,

4 4 JOSÉ IGNACIO RONDA, ANTONIO VALDÉS, AND FERNANDO JAUREGUIZAR provided that ϕ 0. This meas that the polar lie o the poit o coordiates ˆQ e 0 with respect to the absolute coic is the lie through the poits o coordiates ˆQ e 1 ad ˆQ e 2. So we have the ollowig result: Theorem 3.1. (1) The horopter curve attached to a pair o cameras related with a motio o agle dieret rom 0 ad π itersects the plae at iiity at three poits, oe o which is real ad the other two are complex cojugate ad lie o the absolute coic. (2) The pole o the lie determied by the complex poits is the real oe ad the real poit represets the directio o the screw axis o the motio. 1 (3) The horopter reaches the plae at iiity at parameters with ratios 1 : e iϕ : e iϕ, ϕ beig the rotatio agle o the motio. I particular, the three parameters have the same modulus. Remark 3.1. Sice all the cameras share the same calibratio matrix, the retial coordiates provide us with atural isomorphisms amog them, relatig poits with the same coordiates i dieret retial plaes. Thereore we ca idetiy these plaes with a virtual retial plae Π edowed with coordiates (u, v, w) compatible with the isomorphisms ad project oto it the itersectio poits ad the absolute coic usig ay o the projectio matrices (or eve all o them). A relevat eature o this costructio is that, as is well kow (see [7]), the absolute coic projects oto the same coic o Π idepedetly o the projectio matrix used. The polarity relatios are preserved by the homographies iduced by these projectios. Let us cosider a set o projectively calibrated cameras P l, l = 1,..., with idetical itrisic parameters. For each pair o cameras (i, j), i < j, we deote by h ij = h ij () the correspodig horopter, by Q ij k, k = 0, 1, 2 its itersectio poits with π ad by r ij kl the projectio rij kl = P lq ij k. O course, rij ki = P iq ij k = P jq ij k = rij kj, but the other projectios will be dieret, i geeral (see igure 1). I A is the deiite symmetric matrix o the projected absolute coic i Π we have (2) ( r ij 0l ) T Ar ij kl = 0 ad ( r ij kl ) T Ar ij kl = 0, where k = 1, 2, 1 i < j, ad l = 1,...,. Note that although the projected poits r ij kl, l i, j, are homographically related to the rij ki = rij kj, the cosideratio o all these poits is ot redudat i the cotext o the search or the plae at iiity. Ideed, i the cadidate plae is the plae at iiity, this homography leaves ivariat the projected absolute coic, but i this is ot the case, ivariace o the coic does ot hold true, ad thereore these additioal costraits are ot redudat. These equatios provide us with a method to recover the projectio o the absolute coic rom the kowledge o the coordiates o the plae at iiity. They are i the heart o our algorithms, as will be explaied later. Π Q 0 Q 0 13 Q 13 2 Q 2 Q 1 Q 23 1 Q 13 1 Q 23 2 Q 23 0 r r r 1 3 r 0 3 r 0 1 r 1 1 r 0 2 r 1 2 r 2 3 camera 1 camera 2 camera 3 Figure 1. Diagram o relatioships betwee the itersectios o the horopters with the plae at iiity, the absolute coic, ad their projectios. 1 This is just a projective versio o the act that the real lie determied by the complex poits is the directio o the pecil o plaes orthogoal to the screw axis.

5 CAMERA AUTOCALIBRATION AND HOROPTER CURVES Horopters ad the uimodular costrait. Twisted cubics ca be geerated by meas o a homography relatig two stars i space. For the coveiece o the reader, we recall here this Steier-type costructio (see [16]). The star o a poit has a structure o projective plae ad so we ca cosider homographies betwee stars. Such homographies ca be geerated usig a homography o the ambiet space H : P 3 P 3 as ollows: For each pair o poits C 1 ad C 2 = H(C 1 ) we ca deie a homography Star(C 1 ) Star(C 2 ) just by sedig the lie l Star(C 1 ) (resp. the plae π) to the lie H(l) Star(C 2 ) (resp. the plae H(π)). For simplicity, we will deote the homography betwee these stars agai by H. Note that ay homography betwee stars is iduced by a homography o the ambiet space: to see this it is eough to realize that a homography betwee stars is equivalet to a homography betwee two plaes o the dual space P 3, which has a iiity o extesios to the whole space. I geeral, a lie o the irst star does ot itersect its image. However, the set o lies which do itersect its image produce a twisted cubic, i.e., give a homography H : Star(C 1 ) Star(C 2 ) the set {P P 3 : P = l H(l), l Star(C 1 )}. is a twisted cubic. Ad, coversely, every twisted cubic ca be geerated i this way. The motio betwee the cameras is a homography o the space which iduces the correspodig homography betwee the stars based o the optical ceters o the cameras. The associated twisted cubic is the horopter previously deied. From this, it ollows immediately that the horopter depeds oly o the relative motio betwee the cameras ad the positio o the irst optical ceter. So let us cosider a homography H : Star(C 1 ) Star(C 2 ). For each plae τ ot cotaiig either o the poits C 1 ad C 2, there is a atural homography H τ : τ τ iduced by H, deied as ollows: Give a poit Q τ, we deie H τ (Q) = H(C 1 Q) τ. Geerically, a homography o a projective plae has three ixed poits. By its very deiitio, the three ixed poits o H τ are the three itersectio poits o τ with the twisted cubic associated to H. Theorem 3.2. (Uimodular costrait) Let H : Star(C 1 ) Star(C 2 ) be a homography ad τ a plae ot cotaiig ay o the ceters o the stars. Let us cosider the associated homography H τ : τ τ, which we suppose to be geeric, i the sese that it has exactly three dieret ixed poits, say, Q 0, Q 1 ad Q 2. Let h = h() be the twisted cubic attached to H, ad let us deote by i the parameters o the poits Q i or i = 0, 1, 2, ad by µ j the parameters o C j, j = 1, 2. The the eigevalues λ 0, λ 1 ad λ 2 o H τ have ratios give by λ 0 λ 2 = {µ 1, µ 2, 0, 2 }, λ 1 λ 2 = {µ 1, µ 2, 1, 2 }. I the particular case that the ceters are reached at parameters 0 ad, we have λ 0 λ 2 = {0,, 0, 2 } = 0 2, λ 1 λ 2 = {0,, 1, 2 } = 1 2. Proo. Let us cosider the projective reerece {X 0,X 1,X 2,X 3,E} o P 3, where X 0 = C 1,X 1 = Q 0,X 2 = Q 1,X 3 = Q 2,E = C 2. I terms o this reerece, the plae τ = X 1 X 2 X 3 has equatio X = 0. The cubic that reaches the poits at the required parameters has the orm h() = ( µ2 µ 1 µ 1, µ 2 0 0, µ 2 1 1, µ as ca be easily checked. To determie the homography H τ we eed to kow the image o a ourth poit. Note that the twisted cubic ca be reparametrizated by meas o a homographic chage o coordiate = a + b c, ad bc 0 + d without aectig the cross ratios o the parameters. So we ca assume, reparametrizatig the curve i ecessary, that oe o the parameters λ i, µ j coicides with. The we ca cosider the poit Q = h( ) = (µ 2 µ 1, µ 2 0, µ 2 1, µ 2 2 ). Sice H τ (C 1 Q τ) = C 2 Q τ, the poit C 1 Q τ = (0, µ 2 0, µ 2 1, µ 2 2 ) maps to the poit o coordiates (0, µ 1 0, µ 1 1, µ 1 2 ). Usig ow (Y, Z, T) as coordiates or the plae τ, the homography H τ maps (1, 0, 0) (1, 0, 0) (0, 1, 0) (0, 1, 0) (0, 0, 1) (0, 0, 1) ). (µ 2 0, µ 2 1, µ 2 2 ) (µ 1 0, µ 1 1, µ 1 2 )

6 C 2 C1 6 JOSÉ IGNACIO RONDA, ANTONIO VALDÉS, AND FERNANDO JAUREGUIZAR ad so it is give by a matrix o the orm (up to multiples) µ 1 0 µ µ H τ µ µ 1 2 µ 2 2 so λ 0 : λ 1 : λ 2 = µ1 0 µ 2 0 : µ1 1 µ 2 1 : µ1 2 µ 2 2 rom which the result ollows. Sice we have see that i the particular case o a horopter attached to a pair o cameras with idetical itrisic parameters the optical ceters are reached by the horopter at = 0,, we obtai that the eigevalues λ 0, λ 1 ad λ 2 o the iter-image homography iduced by the plae at iiity are i the same ratio that the parameters 0, 1 ad 2 at which the horopter reaches the plae at iiity, i.e., λ 0 : λ 1 : λ 2 = 0 : 1 : 2. This equality, together with Theorem implies the uimodular costrait itroduced by Polleeys et al. []. Compare with [15]. Next Theorem shows how the parameters o these poits are related with the eigevalues o H τ. Note that this result, together with Theorem implies the uimodular costrait 3.4. Coes ad horopters. There is a 2-parameter amily o quadrics cotaiig a give twisted cubic (see [16]), ad this relates the horopter with the ambiguity pheomeo (see the iterestig book o Maybak [10] or more iormatio o this subject). For each poit P o the twisted cubic, the set o rays joiig P with all the other poits o the cubic is a coe, icludig the taget lie at P as a limit case. To see this, it is eough to check that the curve obtaied itersectig this surace with a plae ot icludig P is a coic. Accordig to Bezout s Theorem it is eough to see that a geeric lie o the plae itersects the curve i just two poits. To id them is equivalet to idig the itersectios, dieret rom P, o the plae determied by the lie ad P with the twisted cubic. These itersectio are, i geeral, three poits, the vertex P ad two other oes. This meas that the curve is a coic ad thereore that the ruled surace is a coe (c. [16]). I the particular case o a horopter curve, we ca cosider the coe with vertex the real poit at iiity o the horopter, Q 0, which is a cylider. To see what type o coic is the base o this cylider, let us cosider a plae orthogoal to the axis o the cylider, i.e., a plae itersectig the plae at iiity i the polar lie o Q 0 with respect the absolute coic. By Theorem 3.1, this plae cotais the complex cojugate poits o the horopter at iiity, Q 1 ad Q 2, the cyclic poits at iiity o the plae. Thereore the coic is a circle (see igure 2). We have proved the ollowig Theorem (this result is well kow ad requetly metioed i the literature, e.g., [14]). Theorem 3.3. The horopter curve is cotaied withi a circular cylider ormed by all the lies touchig the horopter with the same directio that the screw axis o the motio., Figure 2. A horopter i its cylider showig the screw axis o the motio.

7 CAMERA AUTOCALIBRATION AND HOROPTER CURVES 7 For the sake o completeess, we iclude the ollowig property. Let us costruct a coe cotaiig the horopter takig as vertex oe o the optical ceters. The curve obtaied itersectig the coe with the correspodig retial plae is a coic. It is ot diicult to id the equatio o this coic: I the poits q ad q are the images i the irst ad secod cameras, respectively, o the same poit i space, the their coordiates satisy the relatio q T Fq = 0, where F is the udametal matrix o the pair. I q ad q are the images o a poit o the horopter h(), the q ad q have the same coordiates. We abuse otatio ad write q = q. Thereore q T Fq = 0 I we decompose F = F S + F A as a sum o its symmetric part F S = (F + F T )/2 ad its atisymmetric part F A = (F F T )/2, we have that q T Fq = q T F S q = 0, i.e., q lies over a coic o matrix F S. Note that although F is a sigular matrix, its atisymmetric part is ot sigular, i geeral. So we have proved the ollowig Theorem, which ca also be oud i [7]). Theorem 3.4. The projectio o the horopter o each retia o the camera pair is a coic with matrix the symmetric part o the udametal matrix o the pair Other properties o the horopters. Give a plae π Star(C 1 ) let us cosider its image π = H(π) Star(C 2 ), which we suppose to be dieret rom π. Let us cosider the lie l = π π, which we suppose dieret rom C 1 C 2. The H iduces a homography o l, sedig each P l to the poit P = H(C 1 P) l. Ay homography o a lie has either two dieret ixed poits, or oe double ixed poit. Note that the ixed poits belog to the associated twisted cubic, so l is a chord o this cubic. I we have a double ixed poit o l the l is taget to the twisted cubic at that poit. I the particular case o the horopter curve, let l be the screw axis o the motio ad π the plae determied by C 1 ad l. Beig the screw axis ivariat uder the motio, the image o π is the plae π determied by C 2 ad l. Hece the screw axis l = π π is a chord o the horopter. But, sice the motio acts o l as a traslatio (assumig that the motio is ot a pure rotatio), the oly ixed poit o the homography iduced o l is the poit at iiity, which is double. So we have the ollowig Theorem: Theorem 3.5. I the motio betwee the cameras is ot a pure traslatio, the the taget to the horopter at its real poit at iiity is the screw axis o the motio. Proo. We have already cosidered the case o a geeric motio. I the motio is a pure rotatio, the horopter actorices i a lie (the screw axis) ad a circle, ad so the Theorem holds true. Let us ow study the eect o a coordiate chage o the horopter curve. So we have ew projective coordiates Q = ( X, Ȳ, Z, T) T related with the ormer oes by a o-sigular matrix A as ollows: Q = GQ. The we will have ew camera matrices P i = ν i P i G 1, ad the horopter h = h( ) is deied by 0 = ( P 1 P 2 ) h( ) = (ν 1 P 1 ν 2 P2 )G 1 h( ), thereore ) ν2 h( ) = Gh(. ν 1 We see rom this that or a give coordiate system ad a order o the cameras all the possible parameterizatios o the correspodig horopter are related by a coordiate chage o the orm = k, k 0. I ay o these parameterizatios the optical ceter o the irst camera is reached at = 0 ad that o the secod camera is reached at =. I there is o privileged order o cameras, we must also cosider chages o parameter o the orm = k/, as it ollows rom equatio [1]. So we have the ollowig Theorem: Theorem 3.6. Uder a chage o projective coordiates Q = GQ, the correspodig horopter h = h( ) is related to h = h() by h( ) = Gh ( λ ) ( ) or h( ) = Gh λ accordig to whether we iterchage or ot the order o the cameras ad where λ is a costat which depeds o the choice o the represetatives o the matrices o the cameras. The parameters 0 ad always correspod to the optical ceters o the cameras. 4. Camera sel-calibratio usig horopter curves I this sectio we propose two dieret algorithms based o the properties o the horopters itroduced above. The irst algorithm cosists i a stratiied calibratio which irst provides the plae at iiity ad the the absolute coic. Its irst phase (aie calibratio) ca be see as a implemetatio o the uimodular costrait algorithm o [] i terms o horopter curves. The secod phase (Euclidea calibratio) provides the absolute coic by

8 8 JOSÉ IGNACIO RONDA, ANTONIO VALDÉS, AND FERNANDO JAUREGUIZAR estimatig liearly the best-it coic with respect to the itersectios o the horopters with the plae at iiity (relatios give i Theorem 3.1). The secod oe gives directly the Euclidea structure o space. While the irst algorithm is computatioally simpler, the secod oe is more robust i the presece o oise, as we will see i the ext sectio. Both algorithms use geeral purpose optimizatio techiques (a Leveberg-Marquardt algorithm as i [13]) Algorithm 1: Horopters ad the uimodular costrait. This algorithm operates i two phases. I the irst oe the plae at iiity is obtaied by meas o a optimizatio process i which the target uctio is based o the uimodular costrait. The secod phase provides the projected absolute coic i a direct ashio usig the relatioships give i Remark 3.1. The cost uctio employed or the aie calibratio assigs to a cadidate plae o coordiates u = (u 0, u 1, u 2, u 3 ) the quatity 2 ( ij k 2, c 1 (u) = 1) i,j=1 i<j k,l=1 k l where ij 0, ij 1, ij 2 are the parameters o the poits o itersectio o the plae u with the horopter associated to the camera pair (i, j). This cost uctio has bee desiged to be ivariat uder permutatios ad scalig o the parameters. Note that with a adequate parameterizatio o the space o plaes, this leads to a three-dimesioal search. I practice, this will be achieved by selectig oe o the u i to be oe. It would also be possible to carry out just a two-dimesioal search usig as parameters the modulus ad the phase o the ij k or a give horopter hij. However, umerical istability has bee observed, which discourages this approach. Besides, three-dimesioal search turs out to perorm quite eicietly, as will be explaied i the ollowig sectio. Note that the computatioal cost o oe evaluatio o c 1 is essetially that o idig the roots o a third degree polyomial equatio. For the startig poit o the optimizatio process, a irst guess o the plae at iiity is obtaied by meas o a liear algorithm which provides a exact solutio i the cameras are orthogoal, i.e., i K is a diagoal matrix (see [17]). The good covergece properties o the algorithm allow to employ a startig poit obtaied by this method eve i the camera is very ar rom veriyig this coditio, as will be see i the sectio o results. Oce the plae at iiity has bee oud, dieret liear methods ca be employed to calculate the projectio o the absolute coic (see e.g. []). The properties o the horopters provide ew liear methods or this task. A irst approach would be to estimate the absolute coic as the best-it coic i the plae at iiity with respect to the icidece ad polarity relatios give by Theorem 3.1. This would require the deiitio o a suitable projective reerece i this plae. To avoid this, we take advatage o the costrutio i Remark 3.1 by projectig the itersectio poits oto the virtual plae Π ad calculatig the best-it coic with respect to equatios (2). The obtaied coic is the projectio o the absolute coic, whose matrix is give by A = (KK T ) 1, so that the itrisic parameter matrix ca be obtaied rom it by meas o Cholesky actorizatio Algorithm 2: Horopters ad absolute coic. This algorithm is a alterative to the previous oe i which both aie ad Euclidea calibratio are perormed at the same time by meas o a optimizatio process. The ew target uctio measures to what extet a cadidate plae veriies equatios (2). For the sake o clarity we deie this uctio i two steps. First, we associate to a give plae o coordiates u = (u 0, u 1, u 2, u 3 ) T ad a symmetric matrix A the umber (u, A) give by (u, A) = { ( ) T r ij 2 2 ( ) T 0l Ar ij kl + r ij } 2 kl Ar ij kl i<j l=1 with otatios as i Remark 3.1 ad takig ormalized represetatives o the r ij kl. This is a quadratic orm i the coeiciets o A, so with respect to these coeiciets stadard miimizatio ca be applied: We write ij l (u, A) = a T Ma where M is a 6 6 matrix whose etries deped o the r ij kl ad at = (a 1,..., a 6 ) where A = a 1 a 2 a 3 a 2 a 4 a 5. a 3 a 5 a 6 The we deie the cost o the plae u as k=1 c(u) = mi (u, A) a =1

9 CAMERA AUTOCALIBRATION AND HOROPTER CURVES 9 where a stads or the Euclidea orm o the vector. The c(u) is give by the miimum eigevalue o M ad the vector a is the correspodig eigevector. I u is the true plae at iiity, this eigevalue must be zero, sice the best-it coic meets exactly all the costraits. Although there are more sophisticated methods to id the best-it coic, we will see i the ollowig sectio that this liear techique suices to provide satisactory results. The risk that the optimizatio process leads to a spurious miimum motivates the itroductio o additioal terms i the cost uctio. As the matrix o the projected absolute coic is deiite, pealty terms have bee icluded i the target uctio to icrease the cost o a cadidate plae leadig to a o-deiite matrix. The ially selected target uctio has the orm c 2 (u) = c(u)g 1 (A u ) + αg 2 (A u ) where A u is the ormalized symmetric matrix that miimizes (u, A) or the plae u, g 1 (A) is the pealty or closeess to sigularity, g 2 (A) is that or o-deiiteess ad α is a weightig actor. We deie g 1 (A) = 1 + 1/λ mi p g 2 (A) = sig(λ i) sig(λ max) where λ mi (resp. λ max ) is the eigevalue o A o miimum (resp. maximum) absolute value, p is a suitable power ad (λ i ) is the sequece o eigevalues o A. I our experimets we have take α = 10, p = 6. The iitializatio o the algorithm is the same as that o the previous oe, ad it is also robust with respect to the startig poit. However, as we ext see, it is more robust with respect to oise. λ i 5. Experimetal results To evaluate the perormace o the techiques a sceario has bee simulated i which a set o three cameras capture a scee cosistig i a set o 100 radomly positioed 3D poits. The Euclidea coordiates o these poits are obtaied rom a uiorm distributio with support a cetered cube o side two uits. The three cameras are located at radom with pricipal axes passig close to the ceter o the poit distributio. More speciically, the irst camera has optical ceter C 1 = t 1 = (0, 0, d) T ad projects oto plae z = h, so that its projectio matrix i stadard orm ca be writte as P 1 = K(I t 1 ). The other cameras are radomly rotated ad traslated versios o the irst oe, with projectio matrices P i = K(R i t i ), where the R i are radom rotatio matrices ragig over the whole rotatio group, ad t i = R i t 1 + t i, with the t i radom vectors with idepedet compoets uiormly distributed withi [ s, s]. This arragemet iteds to model a set o cameras approximately poitig toward the ceter o coordiates, ad located all o them at a similar distace o this ceter. We project the 3D poits ad perturb the resultig aie coordiates with oise o idepedet compoets uiormly distributed withi [, ]. The values o the itrisic parameters have bee take so that the projectios lie roughly withi the rage that would be typical or values measured i pixels o images obtaied with a video camera. Projective calibratio is irst perormed by camera pairs usig the algorithm described i [5]. The estimatio o the udametal matrix is computed by meas o the elemetary eight-poit algorithm [7]. The ive o the observed 3D poits are selected at radom to establish a commo projective basis. We parameterize the space o plaes just by settig oe o the compoets o the plae coordiates u = (u 0, u 1, u 2, u 3 ) T to be oe. I practice, a very slight improvemet is observed i the our possible choices are employed ad the result o miimum cost is selected, which is what we do i our experimets. Although the geometry o the algorithms is idepedet o scalig, its umerical procedures are ot: For example, the extractio o eigevalues is scalig-depedet. I practice, scalig o the data has proved to be very sigiicat i the perormace o the algorithms. I our case, a homothety (u, v) (λu, λv) is applied to the o-homogeeous aie observed oisy coordiates, ad its eects are corrected i the output o the algorithm. A rule o thumb or the value o λ is to take it as the iverse o the maximum observed coordiate. For a give selectio o itrisic parameters ad oise level, a set o 300 dieret experimets is cosidered, each with a dieret set o camera positios ad 3D poit coordiates. With high oise levels the algorithms ail occasioally to provide a deiite matrix or the estimated absolute coic. This limitatio is easily overcome by reprocessig the data with a dieret choice or the projective basis. As each optimizatio takes a ew secods or the secod algorithm (o a Itel Petium 4 machie ruig uder Liux at 1500 MHz), which is the most costly, this redudacy is perectly aordable. I our experimets each processig is actually perormed with dieret basis util three dieret successes are obtaied (with a maximum o te attempts), ad the miimum cost solutio is selected.

10 10 JOSÉ IGNACIO RONDA, ANTONIO VALDÉS, AND FERNANDO JAUREGUIZAR Figure 3 show the average relative error curves or the irst (igure 3.a) ad secod (igure 3.b) algorithms together with the correspodig curves ad or two itermediate algorithms resultig rom two dieret combiatios o the cost uctios β 1 c 1 + β 2 c 2 (igure 3.c ad 3.d). We cosider the case o three cameras with parameters idicated i the captio. Figure 4 shows aalogous results or a dieret set o itrisic parameters. These results clearly show that the icrease i computatioal cost o algorithm 2 is justiied by a improvemet i perormace. Besides, it is see that a combiatio o both cost uctios does ot ecessarily imply a additioal gai. Nacho: tiees que meter ms iguras Reereces [1] M. Armstrog, A. Zisserma, R. Hartley, Sel-calibratio rom image triplets,, I Europea Coerece o Computer Visio, pages [2] S. Maybak ad O. Faugeras, A theory o sel calibratio o a movig camera. I Iteratioal Joural o Computer Visio, 8 (2), pages [3] O. Faugeras, Three-Dimesioal Computer Visio: A Geometric Viewpoit, MIT Press, Cambridge, Massachusetts [4] A. Fusiello, Ucalibrated Euclidea recostructio: a review. I Image ad Video Computig, 18, pages , [5] R.I. Hartley, Projective recostructio ad ivariats rom multiple images, I IEEE Tras. o PAMI, vol. 16, o. 10, Oct [6] R. I. Hartley, Chirality, Iteratioal Joural o Computer Visio, 26 (1), pp , [7] R.I. Hartley ad A. Zisserma, Multiple View Geometry i Computer Visio. Cambridge Uiversity Press, Cambridge, UK, [8] R.I. Hartley, E. Hayma, L. de Agapito ad I. Reid, Camera calibratio ad the search or iiity. I Proceedigs o the Iteratioal Coerece o Computer Visio, [9] S.J. Maybak, The Projective Geometry o Ambiguous Suraces. I Philosophical Trasactios: Physical Scieces ad Egieerig, 332 (1623), pages 1 47, [10] S.J. Maybak, Recostructio rom projectios, Spriger-Verlag, Berli, [11] D. Nister, Calibratio with robust use o cheirality by quasi-aie recostructio o the set o camera projectio cetres, I Proceedigs 8th IEEE Iteratioal Coerece o Computer Visio. ICCV 2001, 2001, pp , vol.2. [] M. Polleeys, L. Va Gool, Stratiied sel-calibratio with the modulus costrait, I IEEE Tras. o Patter Aalysis ad Machie Itelligece, 21 (6), pages [13] W.H. Press et al., Numerical Recipes i C++: The Art o Scietiic Computig, 2d. ed.. Cambridge Uiversity Press, Cambridge, MA [14] L. Qua ad Z. La, Liear N-Poit Camera Pose Determiatio. I IEEE Trasactios o Patter Aalysis ad Machie Itelligece, vol. 21, o. 8, pages , [15] F. Schaalitzky, Direct Solutio o Modulus Costraits. I Proc. Idia Coerece o Computer Visio, Graphics ad Image Processig, Bagalore [16] J.G. Semple ad G.T. Keeboe, Algebraic Projective Geometry, Oxord Classic Texts i Physical Scieces, Oxord Uiversity Press, Oxord, [17] Y. Seo, A. Heyde, Auto-calibratio rom the orthogoality costraits, I Iteratioal Coerece o Computer Visio, Barceloa, Spai, [18] W. Triggs, Auto-calibratio ad the absolute quadric. I Proc. IEEE Coerece o Computer Visio ad Patter Recogitio, pages

11 CAMERA AUTOCALIBRATION AND HOROPTER CURVES (a) (b) (c) (d) Figure 3. Average results or / u = 250, v / u =, = 0.8π/2, u 0 = 80, v 0 = 80, d = 1.6, s = 0.1, ad oise amplitud rom 0 to 3 pixels. I (c) β 1 = 1, β 2 = I (d) β 1 = 1, β 2 = (a) (b) (c) (d) Figure 4. Average results or / u = 1000, v / u = 1, = π/2, u 0 = 250, v 0 = 250, other parameters as i previous igure.

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

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

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.

More information

Systems Design Project: Indoor Location of Wireless Devices

Systems Design Project: Indoor Location of Wireless Devices Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 haupt@ieee.org Abstract:

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

THE problem of fitting a circle to a collection of points

THE problem of fitting a circle to a collection of points IEEE TRANACTION ON INTRUMENTATION AND MEAUREMENT, VOL. XX, NO. Y, MONTH 000 A Few Methods for Fittig Circles to Data Dale Umbach, Kerry N. Joes Abstract Five methods are discussed to fit circles to data.

More information

Finding the circle that best fits a set of points

Finding the circle that best fits a set of points Fidig the circle that best fits a set of poits L. MAISONOBE October 5 th 007 Cotets 1 Itroductio Solvig the problem.1 Priciples............................... Iitializatio.............................

More information

MINING RELAXED GRAPH PROPERTIES IN INTERNET

MINING RELAXED GRAPH PROPERTIES IN INTERNET MINING RELAXED GRAPH PROPERTIES IN INTERNET Wilhelmiia Hämäläie Departmet o Computer Sciece, Uiversity o Joesuu, P.O. Box 111, FIN-80101 Joesuu, Filad whamalai@cs.joesuu.i Hau Toivoe Departmet o Computer

More information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets

BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets BENEIT-CST ANALYSIS iacial ad Ecoomic Appraisal usig Spreadsheets Ch. 2: Ivestmet Appraisal - Priciples Harry Campbell & Richard Brow School of Ecoomics The Uiversity of Queeslad Review of basic cocepts

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

LECTURE 13: Cross-validation

LECTURE 13: Cross-validation LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M

More information

Chapter XIV: Fundamentals of Probability and Statistics *

Chapter XIV: Fundamentals of Probability and Statistics * Objectives Chapter XIV: Fudametals o Probability ad Statistics * Preset udametal cocepts o probability ad statistics Review measures o cetral tedecy ad dispersio Aalyze methods ad applicatios o descriptive

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

More information

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

More information

Coordinating Principal Component Analyzers

Coordinating Principal Component Analyzers Coordiatig Pricipal Compoet Aalyzers J.J. Verbeek ad N. Vlassis ad B. Kröse Iformatics Istitute, Uiversity of Amsterdam Kruislaa 403, 1098 SJ Amsterdam, The Netherlads Abstract. Mixtures of Pricipal Compoet

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

Universal coding for classes of sources

Universal coding for classes of sources Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric

More information

Normal Distribution.

Normal Distribution. Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Capacity of Wireless Networks with Heterogeneous Traffic

Capacity of Wireless Networks with Heterogeneous Traffic Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata

More information

ARTICLE IN PRESS. Statistics & Probability Letters ( ) A Kolmogorov-type test for monotonicity of regression. Cecile Durot

ARTICLE IN PRESS. Statistics & Probability Letters ( ) A Kolmogorov-type test for monotonicity of regression. Cecile Durot STAPRO 66 pp: - col.fig.: il ED: MG PROD. TYPE: COM PAGN: Usha.N -- SCAN: il Statistics & Probability Letters 2 2 2 2 Abstract A Kolmogorov-type test for mootoicity of regressio Cecile Durot Laboratoire

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

Elementary Theory of Russian Roulette

Elementary Theory of Russian Roulette Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 007 MARKS: 50 TIME: 3 hours This questio paper cosists of pages, 4 diagram sheets ad a -page formula sheet. Please tur over Mathematics/P DoE/Exemplar

More information

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E MCCARTHY, SANDRA POTT, AND BRETT D WICK Abstract We provide a ew proof of Volberg s Theorem characterizig thi iterpolatig sequeces as those for

More information

Ekkehart Schlicht: Economic Surplus and Derived Demand

Ekkehart Schlicht: Economic Surplus and Derived Demand Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

3. If x and y are real numbers, what is the simplified radical form

3. If x and y are real numbers, what is the simplified radical form lgebra II Practice Test Objective:.a. Which is equivalet to 98 94 4 49?. Which epressio is aother way to write 5 4? 5 5 4 4 4 5 4 5. If ad y are real umbers, what is the simplified radical form of 5 y

More information

7.1 Finding Rational Solutions of Polynomial Equations

7.1 Finding Rational Solutions of Polynomial Equations 4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?

More information

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k. 18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The

More information

Chapter 7: Confidence Interval and Sample Size

Chapter 7: Confidence Interval and Sample Size Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

1 Correlation and Regression Analysis

1 Correlation and Regression Analysis 1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average

More information

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics

More information

Descriptive Statistics

Descriptive Statistics Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

Non-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring

Non-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring No-life isurace mathematics Nils F. Haavardsso, Uiversity of Oslo ad DNB Skadeforsikrig Mai issues so far Why does isurace work? How is risk premium defied ad why is it importat? How ca claim frequecy

More information

Irreducible polynomials with consecutive zero coefficients

Irreducible polynomials with consecutive zero coefficients Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Partial Di erential Equations

Partial Di erential Equations Partial Di eretial Equatios Partial Di eretial Equatios Much of moder sciece, egieerig, ad mathematics is based o the study of partial di eretial equatios, where a partial di eretial equatio is a equatio

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

Lecture 7: Stationary Perturbation Theory

Lecture 7: Stationary Perturbation Theory Lecture 7: Statioary Perturbatio Theory I most practical applicatios the time idepedet Schrödiger equatio Hψ = Eψ (1) caot be solved exactly ad oe has to resort to some scheme of fidig approximate solutios,

More information

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2 4. Basic feasible solutios ad vertices of polyhedra Due to the fudametal theorem of Liear Programmig, to solve ay LP it suffices to cosider the vertices (fiitely may) of the polyhedro P of the feasible

More information

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas: Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

More information

Convention Paper 6764

Convention Paper 6764 Audio Egieerig Society Covetio Paper 6764 Preseted at the 10th Covetio 006 May 0 3 Paris, Frace This covetio paper has bee reproduced from the author's advace mauscript, without editig, correctios, or

More information

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives Douglas A. Lapp Multiple Represetatios for Patter Exploratio with the Graphig Calculator ad Maipulatives To teach mathematics as a coected system of cocepts, we must have a shift i emphasis from a curriculum

More information

Hypergeometric Distributions

Hypergeometric Distributions 7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

Estimating Probability Distributions by Observing Betting Practices

Estimating Probability Distributions by Observing Betting Practices 5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,

More information

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the. Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).

More information

1 The Gaussian channel

1 The Gaussian channel ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

Overview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals

Overview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals Overview Estimatig the Value of a Parameter Usig Cofidece Itervals We apply the results about the sample mea the problem of estimatio Estimatio is the process of usig sample data estimate the value of

More information

DIAGNOSTIC-ROBUST STATISTICAL ANALYSIS FOR LOCAL SURFACE FITTING IN 3D POINT CLOUD DATA

DIAGNOSTIC-ROBUST STATISTICAL ANALYSIS FOR LOCAL SURFACE FITTING IN 3D POINT CLOUD DATA ISPRS Aals of the Photogrammetry, Remote Sesig ad Spatial Iformatio Scieces, Volume I-3, 1 XXII ISPRS Cogress, 5 August 1 September 1, Melboure, Australia DIAGNOSTIC-ROBUST STATISTICAL ANALYSIS FOR LOCAL

More information

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4 GCE Further Mathematics (660) Further Pure Uit (MFP) Tetbook Versio: 4 MFP Tetbook A-level Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5

More information

Lecture 2: Karger s Min Cut Algorithm

Lecture 2: Karger s Min Cut Algorithm priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.

More information

Lesson 17 Pearson s Correlation Coefficient

Lesson 17 Pearson s Correlation Coefficient Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig

More information