AUTO-CALIBRATION. FACTORIZATION. STRUCTURE FROM MOTION.
|
|
- Horatio Barber
- 6 years ago
- Views:
Transcription
1 AUO-CALIBRAION. FACORIZAION. SRUCURE FRO OION.
2 hank you for the sldes. hey coe ostly fro the followng sources. arc ollefeys U. of North Carolna artal Hebert CU Slvo Savarese U. of chgan Dan Huttenlocher Cornell U.
3 otvaton Avod explct calbraton procedure Coplex procedure Need for calbraton obect Need to antan calbraton
4 Factorzaton Factorse observatons n structure of the scene and oton/calbraton of the caera Use all ponts n all ages at the sae te Affne factorsaton roectve factorsaton
5 Affne caera he affne proecton equatons are y x Z Y X y x 000 y x Z Y X y x ~ ~ 4 4 y x y x Z Y X y x y x
6 Orthographc factorzaton he ortographc proecton equatons are where n,...,,,...,, All equatons can be collected for all and where [ ] n n n n,...,,,, L O L L ~ ~ y x Z Y X,, y x Note that and are resp. x3 and 3xn atrces and therefore the rank of s at ost 3 (oas anade 9)
7 Orthographc factorzaton Factorze through sngular value decoposton An affne reconstructon s obtaned as follows V U Σ V U Σ ~, ~ (oas anade 9) [ ] n n n n,...,, n L O L L Closest rank-3 approxaton yelds LE!
8 A etrc reconstructon s obtaned - ~A - - A~ A a 3 3 atrx he atrx A can be obtaned by self-calbraton or knowng the age of absolute conc and dong Cholesky factorzaton A A ( 3 ω... 3 ) - or for,..., AA AA AA 0 Frst RANSAC (or slar) to elnate outlers. Not all the nler ponts are present all the fraes! If three ponts are present n four ages and the fourth one s only present n three ages, t can be recovered. ont are recovered one by one. Start fro the begnnng fro te to te.
9 Factorzaton Results 8
10 erspectve factorzaton he caera equatons for a fxed age can be wrtten n atrx for as where λ,,...,,,..., Λ [,,..., ], [,,..., ] Λ dag ( λ, λ,..., λ )
11 erspectve factorzaton All equatons can be collected for all as where Λ Λ Λ n n...,... In these forulas are known, but Λ, and are unknown Observe that s a product of a 3x4 atrx and a 4xn atrx,.e. t s a rank 4 atrx
12 Iteratve perspectve factorzaton When Λ are unknown the followng algorth can be used:. Set λ (affne approxaton).. Factorze and obtan an estate of and. If σ 5 s suffcently sall then SO. 3. Use, and to estate Λ fro the caera equatons (lnearly) Λ 4. Goto. In general the algorth nzes the proxty easure (Λ,,)σ 5 Note that structure and oton recovered up to an arbtrary proectve transforaton
13 Noralzng depths. α and β X does not change α β λ x. -th colun and/or -th row can brng λ close to one. Noralzng the age coordnates. o centrod values 0 and average dstance \sqrt{}. he λ s vald at frst teraton f the rato of true depths n 3D s approxately constant through the sequence! Bundle adustent. he fnal step! Needs good ntalzaton and has any paraeter nvolved Levenberg-arquardt (3n ) atrx factored possble wthout sparse ethod.
14 Further Factorzaton work Factorzaton wth uncertanty (Iran & Anandan, IJCV 0) Factorzaton for dynac scenes (Costera and anade 94) (Bregler et al. 000, Brand 00)
15 Extensons araperspectve [oelan & anade, AI 97] Sequental Factorzaton [orta & anade, AI 97] Factorzaton under perspectve [Chrsty & Horaud, AI 96] [Stur & rggs, ECCV 96] Factorzaton wth Uncertanty [Anandan & Iran, IJCV 00] 9
16 Herarchcal structure and oton recovery Copute -vew Copute 3-vew Sttch 3-vew reconstructons erge and refne reconstructon F H
17 Deternng close vews If vewponts are close then ost age changes can be odelled through a planar hoography Qualtatve dstance easure s obtaned by lookng at the resdual error on the best possble planar hoography Dstance n edan D( H, )
18 Coputaton of ntal structure and oton accordng to Hartley and Zsseran ths area s stll to soe extend a black-art All features not vsble n all ages No drect ethod Buld partal reconstructons and asseble (ore vews s ore stable, but less corresp.) ) Sequental structure and oton recovery ) Herarchcal structure and oton recovery
19 Structure fro oton: Ltatons Very dffcult to relably estate etrc structure and oton unless: Large (x or y) rotaton, or Large feld of vew and depth varaton Caera calbraton portant for Eucldean reconstructons Need good feature tracker 7
20 Constrants? Scene constrants arallells, vanshng ponts, horzon,... Dstances, postons, angles,... Unknown scene no constrants Caera extrnscs constrants ose, orentaton,... Unknown caera oton no constrants Caera ntrnscs constrants Focal length, prncpal pont, aspect rato & skew erspectve caera odel too general soe constrants
21 Self-calbraton Upgrade fro proectve structure to etrc structure usng constrants on ntrnsc caera paraeters Constant ntrnscs (Faugeras et al. ECCV 9, Hartley 93, rggs 97, ollefeys et al. AI 98,...) Soe known ntrnscs, others varyng (Heyden&Astro CVR 97, ollefeys et al. ICCV 98,...) Constrants on ntrncs and restrcted oton (e.g. pure translaton, pure rotaton, planar oton) (oons et al. 94, Hartley 94, Arstrong ECCV 96,...)
22 Stratfcaton of geoetry roectve Affne etrc 5 DOF DOF plane at nfnty parallels 7 DOF absolute conc angles, rel.dst. ore general ore structure
23 A countng arguent o go fro proectve (5DOF) to etrc (7DOF) at least 8 constrants are needed nal sequence length should satsfy (# known) + ( n ) (# ) 8 n fxed Independent of algorth Assues general oton (.e. not crtcal)
24 Iages n Features Assue correspondences p p p roectve SF heore: Reconstructon s possble as long as n > +3n 5 roectve SF heore Gven ages and n features Each pont s represented by ts hoogeneous coordnates [X Y Z ] Each feature s represented by ts hoogeneous coordnates n the age plane p [u v ] Each age s represented by ts 3x4 proecton atrx [A b ] (A s a 3x3 atrx, b s a 3 vector) For each feature, we have: p ~ (~ s the sae as the trple-bar hoogeneous equalty: left hand sde proportonal to rght hand sde). ey results:. he unknowns and can be recovered only up to a 4x4 proectve transforaton Q. hat s, for any 4x4 Q, ( Q,Q - ) yelds the sae age proectons as (, ).. he unknowns and can be recovered f n > +3n 5 3. In partcular, for caeras, at least 7 ponts are needed. 3
25 α u 0 s 0 uo v 0 αv o [Id 0] [R t ] [R t ] etrc Upgrade: he proectve reconstructon gves us a set of 3x4 proecton atrces for each caera,..,. he next proble s to convert ths proectve reconstructon to a etrc reconstructon. Specfcally, we want to fnd a 4x4 atrx Q such that: Q [R t ] R and t are the rotaton/translaton between the coordnate syste of caera and an arbtrary coordnate syste. s the atrx of ntrnsc paraeters of caera, whch s defned as: α u 0 s α 0 u α α cotθ o β vo 0 snθ 0 0 α x and α y are the scales n the x and y drectons, x o and y o are the coordnates of the center, and s s the skew of the caera (s 0 f the axes are orthogonal.) uo v 0 v o 0
26 α u 0 s 0 uo v 0 αv o [R t ] [R t ] Fundaental ransforaton: Our fundaental equaton s: Q [R t ] Denotng the atrx fored by takng the frst 3 coluns of Q by Q 3, such that Q [Q 3 q 4 ], we have: Q 3 R. akng the frst 3 coluns and observng that R s a rotaton atrx: Q 3 Q 3 hs s the key observaton: By wrtng that the frst three coluns of the product of by Q s a rotaton, we are able to elnate the rotaton fro the unknowns. All that s left are the atrces of nternal paraeters for each of the ages. hs process s soetes called auto-calbraton snce t aounts to calbratng the nternal paraeters of the caeras drectly fro ages. It s portant to understand the nuber of degrees of freedo n Q 3. he total nuber of entres n Q 3 s 4x3. he atrx s defned up to scale snce all the equaltes are hoogeneous. oreover, the atrx s defned up to a rotaton snce for any arbtrary rotaton R: Q 3 RR Q 3 Q 3 Q 3 so that f Q 3 s a soluton, so s Q 3 R. hese addtonal degrees of freedo sply reflect the fact that one can choose the orentaton and scale of the global coordnate syste arbtrarly. herefore, Q 3 s characterzed by 3 8 unknowns.
27 Look only at the frst 3 coluns Q Q 3 3 Q Q Basc trck: 3 [ R t ] R R R [R t ] Use the fact that R s a rotaton [R t ] For convenence, we denote the atrx the atrx Q 3 Q 3 by L (a 4x4 atrx) and L by ω. he set of equatons to solve s: L,.., Each age generates 5 ndependent equatons (the left hand sde s a 3x3 syetrc atrx, but the equalty s up to scale). he total nuber of unknowns s 8 (Q 3 ) + 5 ( ). herefore, the nuber of equatons (5) s always lower than the nuber of unknowns (8 + 5) and we can never solve ths syste of equatons wthout soe constrants on the caeras. he key queston s what constrants can be used. A couple of constrants are nvestgated below, followed wth a general result. Case : Identcal Intrnsc araeters: Let us suppose now that we do not know the ntrnsc paraeters of the caeras, but that we do know that they are all dentcal, that s, for all caeras. For all the caeras, we have: Where ω s coputed fro the frst age: L ω,.., (wth the equalty up to scale) L L,.., hs gves us 5(-) ndependent equatons for 8 unknowns (n Q 3 ). herefore, we can solve the reconstructon proble n ths case f: 5(-) > 8 - > 3
28 α u 0 s 0 uo v 0 αv o [R t ] [R t ] Note also that we solved for 8 unknowns for Q 3, even though t s a 4x3 atrx eleents. he dfference s due to the fact that the reconstructon s defned up to a global rotaton, n other words, Q 3 R for any rotaton R s also a soluton. We can verfy the paraeter count: Q 3 Q 3 Arbtrary rotaton Arbtrary scale q 4 It s portant to note that by anpulatng the equatons so that the unknown becoes L, we have effectvely elnated the rotaton and translaton and reduced the proble to the recovery of the ntrnsc paraeters. hs step s often tered self-calbraton. 3
29 o v o u v u s α α o o v o o o v o u v v u v u s u s α α α ω Case : rncpal pont at orgn In that case, u o v o 0, whch ples that ω 3 ω 3 0. herefore, gong back to the orgnal equaton, we can wrte that: ( L ) 3 0 and ( L ) 3 0 hose are two equatons n L that are ndependent of. We have such equatons for vews for 8 unknowns n L (eanng, 8 unknowns n Q 3 ). hese equatons are ndependent of. herefore: If the prncpal pont s at the orgn, a etrc reconstructon can be obtaned fro a nu of 4 vews. > 4
30 Assupton Fxed f nown k Constrants Iage s Constant 5 0 ω /ω 33 ω /ω 33 3 rncpal pont known 0 ω 3 ω Aspect rato and skew constant 0 5 Zero Skew 0 ω ω 33 ω 3 ω known + Zero skew 0 3 ω 0 ω 3 ω k + (-)f > 8 Case 3: Zero-Skew If the skew s zero but all the other paraeters are allowed to vary, then we have the constrant: ω ω 33 ω 3 ω 3 hs provdes constrants. herefore, we ust have >8, thus 8 ages are necessary. General countng arguent: he total nuber of paraeters to be estated fro the set of equatons above s 8: L Q 3 Q 3 s a 4x4 syetrc atrx that s defned by 0 entres, 9 of whch are ndependent because of the scale factor. here s one ore constrant that det(l) 0 (t s of rank 3). hus the nuber of ndependent paraeters s If we know k nternal paraeters, then we have k constrants - If we know that f nternal paraeters are fxed (but unknown) we have f(-) constrants - herefore, we can recover a etrc reconstructon ff: k + (-)f > 8 5
31 U D U L U 3 D 3 U 3 L 3 U 3 D 3 ½ D 3 ½ U 3 L 3 L 3 Q 3 Q3 Recoverng Q: One proble n the prevous result s that, whle we used the atrx L for convenence, the actual unknown s Q 3 wth L Q 3 Q 3, whch s a non-lnear relaton. hs can be nconvenent because we have to solve a set of non-lnear equatons. In fact, t s possble n any cases to solve the proble lnearly. hs s done by usng the sae trck as before wth F and E, and wth the factorzaton ethod: Let s pretend frst that we solve the equatons n L, whch has 9 degrees of freedo (4x4 syetrc atrx 0, but t s up to scale), and then decopose L nto L Q 3 Q 3. For exaple, n case (rncpal pont at orgn), u o v o 0, whch ples that ω 3 ω 3 0. herefore: ( L ) 3 0 and ( L ) 3 0 hose are two equatons that are lnear n L and can be solved very easly!! Once we have L, we need to decopose t back nto L Q 3 Q 3. here s a practcal dffculty here: Snce Q 3 s a 4x3 atrx, for such a decoposton to exst, L ust be of rank at ost 3 whch s not enforced n the lnear soluton. We can fnd the closest atrx L 3 of rank three as follows: L s a syetrc atrx so L UDU, where D s a 4x4 dagonal atrx of egenvalues and U s a 4x4 rotaton atrx. he atrx L 3 of rank 3 that s closest to L can be fored by elnatng the sallest egenvalue of L, that s, L 3 U 3 D 3 U 3, where U 3 s the 4x3 atrx obtaned by reovng the last colun of Q and D 3 s the 3x3 upper rght block of D. Wth ths decoposton, the atrx Q 3 U 3 D 3 ½ s a soluton snce L 3 Q 3 Q 3. can be recovered by Cholesky decoposton ω. 6
32 Gven Solve for L such that: L ~ L (,..) Dagonalze L: L UDU Approxate by rank-3 atrx: L 3 U 3 D 3 U 3 Copute Q 3 : Q 3 U 3 D 3 ½ Copute q 4 by settng the orgn of the frst caera to 0: q 4 0 Return Q [Q 3 q 4 ] Gven Q 3, the last colun of Q s coputed by settng the orgn at the orgn of the frst caera, that s: q 4 0. Note that any scaled verson of q 4 s a soluton. hs s a consequence of the fact that t s not possble to recover the absolute scale of the translaton between the caeras. Reeber that we solved for 8 unknowns for Q 3, even though t s a 4x3 atrx eleents. he dfference s due to the fact that the reconstructon s defned up to a global rotaton, n other words, Q 3 R for any rotaton R s also a soluton. We can verfy the paraeter count: Q 3 Q 3 Arbtrary Arbtrary q rotaton 4 scale It s portant to note that by anpulatng the equatons so that the unknown becoes L, we have effectvely elnated the rotaton and translaton and reduced the proble to the recovery of the ntrnsc paraeters. hs step s often tered auto-calbraton. 7
33 p p p Non-Lnear Approach: Bundle Adustent (proectve case) he dscusson so far has assued a lnear reconstructon that (plctly) nzes the error λ p. hs error s not the true geoetrc error,.e., the error between a feature poston and the proecton of a reconstructed pont. Suppose that we have estated the proecton atrces (..) usng the prevous (lnear) technques. Suppose also that we a set of correspondng ponts n the ages p (..n) correspondng to n ponts n the scene. For each..n, we assue that we have an ntal reconstructon of the correspondng scene pont. Ideally, the data pont p [u v ] should be dentcal to the proecton of the reconstructed pont. Startng wth an ntal estate of the proecton atrces and the scene ponts, we want to nze the geoetrc dstance between p and : u + v 3 Where,, 3 are the rows of. Sung over all the ponts and all the ages, we have to fnd the nu of: E u + v, 3 3 Over all the and (a total of + 3n varables). hs technque s called bundle adustent, wdely used n photograetry. 0
34 E u + v, 3 3,..,,.., n nzaton algorth: Let X be the vector fored by concatenatng all the N + 3n unknowns of the proble, the atrces and the ponts. he error functon can be wrtten as: E(X) f(x) f ( X) wth [ ε ε... ε... ε ] A basc pleentaton of bundle adustent uses an teratve Gauss-Newton algorth for solvng the non-lnear least-squares: If X k s the value at teraton k, a frst order approxaton gves us: f(x k + X) f(x k ) + J k X Where J k s the Jacoban (n rows by N coluns atrx of dervatves) of f. We want to fnd X that nzes the rght-hand sde of ths frst order equaton. he soluton s found usng the standard least-squares soluton: X (J k J k ) - J k f(x k ) n wth X s added to the current estate X k to yeld the next estate X k+. Convergence ssues: he algorth assues that the startng pont X o s close to the nu. he algorth ay converge to a local nu or even dverge otherwse. ypcally, X o s obtaned fro one of the prevous lnear technques. ε u 3 v 3
35 E u + v, 3 3,..,,R,..,R,t,..,t rncpal drectons of J J,.., n Fnal Adusteent (etrc case): Once we have the ntrnsc paraeters through self-calbraton, we recover the perspectve proecton atrces by transforng the ones obtaned fro the proectve reconstructon as: Q. Slarly, the reconstructed ponts are transfored by the nverse transforaton: Q -. hs gves an ntal estate of the s. In general, reconstructon systes nclude a last step n whch all the atrces and ponts are adusted sultaneously usng bundle adustent. hs s the sae bundle adustent obectve functon as before, except that the nzaton s done explctly wth respect to the coponents, R, and t nstead of wth respect to the s snce we need to enforce a etrc reconstructon.,,, n u + v R t, 3 3 It s also portant to know the uncertanty on the resultng reconstructon: onts far away are ore uncertan, for exaple. If we assue that all the errors are Gaussan, the atrx J J s the covarance atrx representng the error dstrbuton of all the unknown paraeters. he prncpal drecton of J J are the an drectons of uncertanty, the egenvalues are the uncertantes n those drectons. he atrx can be nterpreted as characterzng the curvature of the error surface n dfferent drectons.
36 3 3 ε ε n ε ε n ε 3 Iage 3 Iage Iage ε 3n Coputatonal ssues: Bundle adustent ay nvolve hundreds of varables. As a result, the coputaton of J k J k and ts nverson ay be expensve and nuercally unstable. An portant fact to note s that the dervatves of ε wth respect to l for l / s zero. Slarly, the dervatve of ε wth respect to l s zero for any l other than l. herefore, J k J k s very sparse and ths property can be exploted to speed up the teratons. 3
37 E,..,,.., n -Gauge ssues: he reconstructon s defned up to a slarty transforaton. hat s, one can transfor the entre set of by an arbtrary transforaton and transfor the proecton atrces accordngly to get a copletely equvalent reconstructon. hs causes a nuercal proble because the nu of the surface E E(X) s not a pont but t s a valley of equvalent na correspondng to dfferent transforatons. It s therefore portant to ether fx the transforaton, or to odfy the functon so that the nzaton s nvarant to transforatons. echncally, ths the gauge ssue (choosng a partcular transforaton s choosng a gauge.) A sple way to do ths, for exaple, s to fx the proecton atrx of the frst caera and to express everythng wth respect to the frst caera. Another possblty s to fx a set of scene ponts (a bass). It s portant to note that, for nuercal reasons, the result ay be dfferent dependng on the selectng gauge. - Outlers: hs has assued so far that all the correspondences are correct. In fact, f soe correspondences are ncorrect (outlers), the entre functon E s corrupted. o avod ths, a dfferent functon s used n place of the squared dstance between features and scene proectons. hs s the obect of robust estaton, to be dscussed later. 4
38 (Fro D. orrs) Uncertanty: he uncertanty on each pont and the caeras orentaton R and poston t can be recovered by proectng on the approprate subspaces of paraeters (techncally, takng the argnal of the dstrbutons). he dstrbuton of uncertanty depends strongly on the gauge constrant: Obvously, the uncertanty s 0 around the caera that s chosen as reference. hs s the sae stuaton n oble robotcs n whch one gets a dfferent dstrbuton of uncertanty f the ap s expressed wth respect to the startng poston of the robot, or wth respect to the current poston. 5
39 6 ages + features ( ) ( ) d d n p F p Fp p, ' ', + ) ' ( n Fp p + rank- SVD reducton Eppolar geoetry: Fundaental atrx estaton (n. ages + 7 correspondences) roectve reconstructon: [ ] ] [ b A 0 b F F b A F etrc reconstructon: Q t R Q ] [ Self-calbraton (ntrnsc paraeter atrx ): Q Q 3 3 ROJECIVE ERIC Lnear eght-pont + RANSAC Non-lnear refneent 3, 3,,, + u v n t R REFINEEN Bundle adustent: COLEE SYSE
40 Structure fro oton proble X x x x Fro the xn correspondences x, estate: proecton atrces n 3D ponts X oton structure
41 he Structure-fro-oton roble Gven ages of n fxed ponts X we can wrte x X roble: estate the 3 4 atrces and the n postons X fro the n correspondences x. Wth no calbraton nfo, caeras and ponts can only be recovered up to a 4x4 proectve Gven two caeras, how any ponts are needed? How any equatons and how any unknown? n equatons n +3n 5 unknowns So 7 ponts! [xx7 8; x + 3x7 5 8]
42 Bundle adustent Non-lnear ethod for refnng structure and oton nzng re-proecton error E(, X) n ( ) x, D X X? X x x 3 X x 3 X 3
43 Bundle adustent Non-lnear ethod for refnng structure and oton nzng re-proecton error E(, X) n Advantages Handle large nuber of vews Handle ssng data ( ) x, D X Ltatons Large nzaton proble (paraeters grow wth nuber of vews) requres good ntal condton Used as the fnal step of SF
44 Reovng the abgutes: the Stratfed reconstructon up grade reconstructon fro perspectve to affne [by easurng the plane at nfnty] up grade reconstructon fro affne to etrc [by easurng the absolute conc] Recoverng the etrc reconstructon fro the perspectve one s called self-calbraton
45 Self-calbraton rocess of deternng ntrnsc caera paraeters drectly fro un-calbrated ages Suppose we have a proectve reconstructon, X } { GOAL: fnd a rectfyng hoography H such that { H, H X } X H s a etrc reconstructon L [R ] If world ref. syste caera ref. syste: [I 0] If the perspectve caera s canoncal: [I 0]
46 Self-calbraton basc equaton ] a [A p 0 H perspectve reconstructon of the caera ] [R ( ) p a A R H L [ ] [ ] a A R p 0 [ ] a p a A ( ) p a A R
47 Self-calbraton basc equaton ( ) p a A R ( ) p a A R I R R ( ) I p a A ( ) p a A ( ) p a A ( ) p A a?
48 Absolute conc Any x Ω [Fro lecture 5] satsfes: Ω s a C Π Ω 0 Ω x + x + x 4 0 x x roectve transforaton of x 0 3 Ω 0 ω ( ) ω* Dual age of the absolute conc
49 Self-calbraton basc equaton ( A ) a p ( ) A a p ( ) *( ) * A a p ω A a p ω How any unknowns? 3 fro p 5 fro ω [per vew] How any equatons? Art of self-calbraton: [A and a are known] 5 ndependent equatons [per vew] use constrants on ω () to generate enough equatons on the unknowns
50 Self-calbraton dentcal s ( ) *( ) * A a p ω A a p ω ( ) *( ) * A a p ω A a p ω For vews, 5(-) constrants Nuber of unknowns: 8 >3 provdes enough constrants o solve the self-calbraton proble wth dentcal caeras we need at least 3 vews
Structure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7
Structure from Moton Forsyth&once: Chap. 2 and 3 Szelsk: Chap. 7 Introducton to Structure from Moton Forsyth&once: Chap. 2 Szelsk: Chap. 7 Structure from Moton Intro he Reconstructon roblem p 3?? p p 2
More informationLecture 3. Camera Models 2 & Camera Calibration. Professor Silvio Savarese Computational Vision and Geometry Lab. 13- Jan- 15.
Lecture Caera Models Caera Calbraton rofessor Slvo Savarese Coputatonal Vson and Geoetry Lab Slvo Savarese Lecture - - Jan- 5 Lecture Caera Models Caera Calbraton Recap of caera odels Caera calbraton proble
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationGeometric Camera Calibration
Geoetrc Caera Calbraton EECS 598-8 Fall 24! Foundatons of Coputer Vson!! Instructor: Jason Corso (jjcorso)! web.eecs.uch.edu/~jjcorso/t/598f4!! Readngs: F.; SZ 6. (FL 4.6; extra notes)! Date: 9/7/4!! Materals
More informationy new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)
Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. ) with a symmetric Pcovariance matrix of the y( x ) measurements V
Fall Analyss o Experental Measureents B Esensten/rev S Errede General Least Squares wth General Constrants: Suppose we have easureents y( x ( y( x, y( x,, y( x wth a syetrc covarance atrx o the y( x easureents
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationSolutions for Homework #9
Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationMinimization of l 2 -Norm of the KSOR Operator
ournal of Matheatcs and Statstcs 8 (): 6-70, 0 ISSN 59-36 0 Scence Publcatons do:0.38/jssp.0.6.70 Publshed Onlne 8 () 0 (http://www.thescpub.co/jss.toc) Mnzaton of l -Nor of the KSOR Operator Youssef,
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationOn the Eigenspectrum of the Gram Matrix and the Generalisation Error of Kernel PCA (Shawe-Taylor, et al. 2005) Ameet Talwalkar 02/13/07
On the Egenspectru of the Gra Matr and the Generalsaton Error of Kernel PCA Shawe-aylor, et al. 005 Aeet alwalar 0/3/07 Outlne Bacground Motvaton PCA, MDS Isoap Kernel PCA Generalsaton Error of Kernel
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationChapter 1. Theory of Gravitation
Chapter 1 Theory of Gravtaton In ths chapter a theory of gravtaton n flat space-te s studed whch was consdered n several artcles by the author. Let us assue a flat space-te etrc. Denote by x the co-ordnates
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationTrifocal Tensor for Heterogeneous Cameras
Trfocal Tensor for Heterogeneous Caeras SrRa Thrthala tvn@cs.unc.edu Marc Pollefeys arc@cs.unc.edu Abstract We study the ult-vew geoetry arsng out of a setup consstng of a pn-hole caera and two D radal
More informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationModified parallel multisplitting iterative methods for non-hermitian positive definite systems
Adv Coput ath DOI 0.007/s0444-0-9262-8 odfed parallel ultsplttng teratve ethods for non-hertan postve defnte systes Chuan-Long Wang Guo-Yan eng Xue-Rong Yong Receved: Septeber 20 / Accepted: 4 Noveber
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationCHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS
CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationFixed-Point Iterations, Krylov Spaces, and Krylov Methods
Fxed-Pont Iteratons, Krylov Spaces, and Krylov Methods Fxed-Pont Iteratons Solve nonsngular lnear syste: Ax = b (soluton ˆx = A b) Solve an approxate, but spler syste: Mx = b x = M b Iprove the soluton
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSpecial Relativity and Riemannian Geometry. Department of Mathematical Sciences
Tutoral Letter 06//018 Specal Relatvty and Reannan Geoetry APM3713 Seester Departent of Matheatcal Scences IMPORTANT INFORMATION: Ths tutoral letter contans the solutons to Assgnent 06. BAR CODE Learn
More informationElastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.
Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationRecap: the SVM problem
Machne Learnng 0-70/5-78 78 Fall 0 Advanced topcs n Ma-Margn Margn Learnng Erc Xng Lecture 0 Noveber 0 Erc Xng @ CMU 006-00 Recap: the SVM proble We solve the follong constraned opt proble: a s.t. J 0
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationAn Optimal Bound for Sum of Square Roots of Special Type of Integers
The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type
More information1. Statement of the problem
Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationImplicit scaling of linear least squares problems
RAL-TR-98-07 1 Iplct scalng of lnear least squares probles by J. K. Red Abstract We consder the soluton of weghted lnear least squares probles by Householder transforatons wth plct scalng, that s, wth
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More information4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation
4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More informationarxiv: v2 [math.co] 3 Sep 2017
On the Approxate Asyptotc Statstcal Independence of the Peranents of 0- Matrces arxv:705.0868v2 ath.co 3 Sep 207 Paul Federbush Departent of Matheatcs Unversty of Mchgan Ann Arbor, MI, 4809-043 Septeber
More informationITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING
ESE 5 ITERATIVE ESTIMATION PROCEDURE FOR GEOSTATISTICAL REGRESSION AND GEOSTATISTICAL KRIGING Gven a geostatstcal regresson odel: k Y () s x () s () s x () s () s, s R wth () unknown () E[ ( s)], s R ()
More informationEstimating the Odometry Error of a Mobile Robot during Navigation
Estatng the Odoetry Error of a Moble Robot durng Navgaton Agostno Martnell and Roland Segwart Autonoous Systes Lab Swss Federal Insttute of Technology Lausanne (EPFL) CH-5 Lausanne, Swtzerland e-al: agostno.artnell,
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationPHYS 705: Classical Mechanics. Canonical Transformation II
1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationMultiplicative Functions and Möbius Inversion Formula
Multplcatve Functons and Möbus Inverson Forula Zvezdelna Stanova Bereley Math Crcle Drector Mlls College and UC Bereley 1. Multplcatve Functons. Overvew Defnton 1. A functon f : N C s sad to be arthetc.
More informationPHYS 705: Classical Mechanics. Newtonian Mechanics
1 PHYS 705: Classcal Mechancs Newtonan Mechancs Quck Revew of Newtonan Mechancs Basc Descrpton: -An dealzed pont partcle or a system of pont partcles n an nertal reference frame [Rgd bodes (ch. 5 later)]
More informationtotal If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions.
Lesson 0: Collsons, Rotatonal netc Energy, Torque, Center o Graty (Sectons 7.8 Last te we used ewton s second law to deelop the pulse-oentu theore. In words, the theore states that the change n lnear oentu
More informationCoordinate-Free Projective Geometry for Computer Vision
MM Research Preprnts,131 165 No. 18, Dec. 1999. Beng 131 Coordnate-Free Proectve Geometry for Computer Vson Hongbo L, Gerald Sommer 1. Introducton How to represent an mage pont algebracally? Gven a Cartesan
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationImportant Instructions to the Examiners:
Summer 0 Examnaton Subject & Code: asc Maths (70) Model Answer Page No: / Important Instructons to the Examners: ) The Answers should be examned by key words and not as word-to-word as gven n the model
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
More informationThe Impact of the Earth s Movement through the Space on Measuring the Velocity of Light
Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the
More informationOptimal Marketing Strategies for a Customer Data Intermediary. Technical Appendix
Optal Marketng Strateges for a Custoer Data Interedary Techncal Appendx oseph Pancras Unversty of Connectcut School of Busness Marketng Departent 00 Hllsde Road, Unt 04 Storrs, CT 0669-04 oseph.pancras@busness.uconn.edu
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More informationQuantum Mechanics for Scientists and Engineers
Quantu Mechancs or Scentsts and Engneers Sangn K Advanced Coputatonal Electroagnetcs Lab redkd@yonse.ac.kr Nov. 4 th, 26 Outlne Quantu Mechancs or Scentsts and Engneers Blnear expanson o lnear operators
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationChapter One Mixture of Ideal Gases
herodynacs II AA Chapter One Mxture of Ideal Gases. Coposton of a Gas Mxture: Mass and Mole Fractons o deterne the propertes of a xture, we need to now the coposton of the xture as well as the propertes
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationPhysics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum
Recall that there was ore to oton than just spee A ore coplete escrpton of oton s the concept of lnear oentu: p v (8.) Beng a prouct of a scalar () an a vector (v), oentu s a vector: p v p y v y p z v
More informationENVIRONMENT OBSERVATION BY STRUCTURE FROM MOTION WITH AN OMNI-DIRECTIONAL CAMERA. Tomoaki Harada, Atsushi Yamashita and Toru Kaneko
ENVIRONMEN OBSERVAION BY SRUCURE FROM MOION WIH AN OMNI-DIRECIONAL CAMERA ooak Harada, Atsush Yaashta and oru Kaneko Departent of Mechancal Engneerng, Shzuoka Unversty, 3-5- Johoku, Haaatsu-sh, Shzuoka,
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationHandling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload
PS-663: Real-Te Systes Handlng Overloads Handlng Overload (G Buttazzo, Hard Real-Te Systes, h 9) auses for Overload Bad syste desgn eg poor estaton of worst-case executon tes Sultaneous arrval of unexpected
More informationScattering by a perfectly conducting infinite cylinder
Scatterng by a perfectly conductng nfnte cylnder Reeber that ths s the full soluton everywhere. We are actually nterested n the scatterng n the far feld lt. We agan use the asyptotc relatonshp exp exp
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationCHAPTER 10 ROTATIONAL MOTION
CHAPTER 0 ROTATONAL MOTON 0. ANGULAR VELOCTY Consder argd body rotates about a fxed axs through pont O n x-y plane as shown. Any partcle at pont P n ths rgd body rotates n a crcle of radus r about O. The
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationASYMMETRIC TRAFFIC ASSIGNMENT WITH FLOW RESPONSIVE SIGNAL CONTROL IN AN URBAN NETWORK
AYMMETRIC TRAFFIC AIGNMENT WITH FLOW REPONIVE IGNAL CONTROL IN AN URBAN NETWORK Ken'etsu UCHIDA *, e'ch KAGAYA **, Tohru HAGIWARA *** Dept. of Engneerng - Hoado Unversty * E-al: uchda@eng.houda.ac.p **
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More information