Paracatadioptric Camera Calibration Using Lines

Size: px
Start display at page:

Download "Paracatadioptric Camera Calibration Using Lines"

Transcription

1 Prctdioptric Cmer Clibrtion Using Lines Joo P Brreto, Helder Arujo Institute of Systems nd Robotics - Dept of Electricl nd Computer Engineering University of Coimbr, 33 Coimbr, Portugl Abstrct Prctdioptric sensors combine prbolic shped mirror nd cmer inducing n orthogrphic projection Such configurtion provides wide field of view while keeping single effective viewpoint Previous work in centrl ctdioptric sensors proved tht line projects into conic curve nd tht three line imges re enough to clibrte the system However the estimtion of the conic curves where lines re mpped is hrd to ccomplish In generl only smll rc of the conic is visible in the imge nd conventionl conic fitting techniques re unble to correctly estimte the curve The present work shows tht set of conic curves corresponds to prctdioptric line imges if, nd only if, certin properties re verified These properties re used to constrint the serch spce nd correctly estimte the curves The ccurte estimtion of minimum of three line imges llows the complete clibrtion of the prctdioptric cmer If the cmer is skewless nd the spect rtio is known then the conic fitting problem is solved nturlly by n eigensystem For the generl sitution the conic curves re estimted using non-liner optimiztion 1 Introduction Omnidirectionl vision is becoming n incresingly importnt sub-re in computer vision reserch The pproch of combining mirrors with conventionl cmers to enhnce sensor field of view is referred to s ctdioptric imge formtion Ctdioptric sensors with n unique effective viewpoint re of primry interest The entire clss of ctdioptric configurtions verifying the fixed viewpoint constrint is derived in [1] Pnormic centrl ctdioptric systems cn be built by combining n hyperbolic mirror with perspective cmer nd, prbolic mirror with n orthogrphic cmer (prctdioptric sensor) The construction of the former requires creful lignment between the mirror nd the imging device The cmer projection center must be positioned in the outer focus of the hyperbolic reflective surfce The prctdioptric cmer is esier to construct being brodly used in vision pplictions In [], Geyer nd Dniilidis introduce for the first time n unifying theory for generl centrl ctdioptric imge formtion A modified version of this mpping model is proposed in [3] It is shown tht centrl ctdioptric projection is isomorphic to projective mpping from sphere, centered in the effective viewpoint, to plne with projection center on the perpendiculr to the plne For the prticulr cse of prctdioptric sensors the projection center lies on the sphere nd the projective mpping is stereogrphic projection The plne nd the finl ctdioptric imge re relted by collinetion depending on the mirror nd cmer intrinsic prmeters The system is clibrted when this collinetion is known It hs lredy been proved tht ny centrl pnormic system cn be fully clibrted from the imge of three lines in generl position [3] However, since lines re mpped into conic curves which re only prtilly visible, the ccurte estimtion of ctdioptric line imges is fr from being trivil tsk [7] The present pper focuses on prctdioptric cmer clibrtion using lines in generl position If it is true tht ny line mps into conic in the ctdioptric imge plne, it is not true tht ny conic is the imge of line We derive for the first time the necessry nd sufficient conditions tht must be verified by set of conic curves to be the prctdioptric projection of lines We lso show tht the derived conditions cn be used to ccurtely estimte the line imges by non-liner optimiztion Moreover if the system is skewless nd the spect rtio is known then the lines cn be computed by solving n eigensystem Given the imge of t lest three lines the prctdioptric cmer is esily clibrted using the results presented in [3] Previous Work The imge formtion model for prctdioptric systems nd the clibrtion lgorithm using three or more lines re introduced For further detils plese consult [3] Consider prctdioptric system combining prbolic mirror with ltus rectum h, nd n orthogrphic cmer The principl xis of the cmer must be ligned with the symmetry xis of the prboloid The prctdioptric projection cn be modeled by stereogrphic projection from n unitry sphere, centered in the effective /3 $17 3 IEEE

2 Ω^ Ο^ 11 H c ^ x 1 Prctdioptric Imge Plne Step 1 Step Determine the ctdioptric line imges ˆΩ i for i =1,, 3 K For ech pir of conics ˆΩ i, ˆΩ j, compute the intersection points ˆF ij, ˆB ij nd determine the cor- Ξ world point x Ω x P n X Y O Z O 11 1 Z c Xc 11 1 O Yc c Π responding line ˆµ ij = ˆF ij ˆB ij Step 3 Estimte the imge center Ô which is the intersection point of lines ˆµ ij Step 4 For ech conic ˆΩ i compute the polr line ˆπ i of the imge center Ô (i =1,, 3 K) Step For ech conic curve obtin the points Î i nd Ĵ i where line ˆπ i intersects ˆΩ i (i =1,, 3 K) Step 6 Estimte the conic ˆΩ going through points Î i, Ĵ i (i =1,, 3 K) Step 7 Compute the Cholesky decomposition of ˆΩ to derive mtrix H c Figure 1: Model for prctdioptric imge formtion Tble 1: Clibrting prctdioptric system using K lines viewpoint, into plne Ξ s shown in Fig 1 The world point shown in Fig 1 is imged t point ˆx in the prctdioptric imge plne To ech visible scene point corresponds n oriented projective ry x =(x, y, z) t, joining the 3D point with the projection center O The projective ry intersects the unit sphere in single point P Consider point O c, with coordintes (,, 1) t, which lies in the unitry sphere To ech x corresponds n oriented projective ry x joining O c with the intersection point P The non-liner mpping F (eqution 1) corresponds to projecting the scene in the unity sphere surfce nd then re-projecting the points on the sphere into plne Ξ from novel projection center O c Points in ctdioptric imge plne ˆx re obtined fter collinetion H c of D projective points x Eqution shows tht H c depends on the intrinsic prmeters K c of the orthogrphic cmer, nd on the ltus rectum of the prbolic mirror F(x) =(x, y, z + x + y + z ) t (1) h ˆx = K c h x () 1 H c Consider the plne Π =(n, ) t going through the effective viewpoint O s depicted in Fig 1 (n =(n x,n y,n z ) t ) The prctdioptric imge of ny line lying on Π is the conic curve ˆΩ The line in the scene is projected into gret circle in the sphere surfce This gret circle is the curve of intersection of plne Π, contining both the line nd the projection center O, nd the unit sphere The projective rys x, joining O c to points in the gret circle, form centrl cone surfce The centrl cone, with vertex in O c, projects into the conic Ω in plne Ξ (eqution 3) Since the imge plne nd Ξ re relted by collinetion H c,the result of eqution 4 comes in strightforwrd mnner Notice tht conic Ω degenerte to line whenever n z = Ω = ˆΩ = n z n x n z n z n y n z n x n z n y n z n z b d b c e d e f = H t 1 c ΩH c (3) The ctdioptric system is clibrted whenever the collinetion H c is known Assume tht the imge center is C =(c x,c y ) t, nd tht α, f o nd s k re the spect rtio, the focl length nd the skew of the orthogrphic imging device The projective trnsformtion H c is given in eqution where f c = f o h/ is mesurement in pixels of the combined focl length of the cmer nd the mirror H c = αf c s k c x α 1 f c c y 1 (4) () Any centrl ctdioptric system cn be clibrted from the imge of K lines with K 3 Tble 1 summrizes the steps of the clibrtion method proposed in [3] The first step is to estimte the conic curves ˆΩ i corresponding to the prctdioptric projection of K lines in the scene Any two line imges ˆΩ i, ˆΩ j intersect in two rel points ˆB ij, ˆF ij It cn be shown tht the imge center Ô must lie in the line ˆµ ij going through the two intersection points Consider the originl line in the scene nd the plne Π i going through the effective viewpoint nd contining the imged line (see Fig /3 $17 3 IEEE

3 1) If the line is projected in the conic ˆΩ i, then the polr line ˆπ i of the center Ô is the imge of the vnishing line of Π i The polr line ˆπ i intersects the conic curve ˆΩ i in two points Î i, Ĵ i It cn be proved tht these two points lie on the conic ˆΩ, which is the locus where the bsolute conic is mpped by collinetion H c Conic ˆΩ cn be estimted using the K pirs of points Î i, Ĵ i Since H c is n upper tringulr mtrix nd ˆΩ = H c t H c 1, then H c cn be determined from the Cholesky decomposition of ˆΩ The clibrtion of the prctdioptric system is strightforwrd whenever the conic curves corresponding to the line imges re known However the estimtion of the these conics using imge points is hrd to ccomplish There re severl lgorithms to fit conic curve to dt points [7] A robust conic fitting lgorithm hs to cope with noisy dt points, bising due to curvture nd prtil occlusions The occlusion problem is of prticulr importnce for our purposes By occlusion we men tht the vilble dt points lie on smll rc of the curve It is intuitive tht in this circumstnces, even for smll mounts of noise, it is very hrd to obtin the correct conic curve The present work ims to to cope with this problem using the properties of prctdioptric line projection 3 The Line Imge ˆω In generl conic curve hs DOF nd it cn be represented by symmetric 3 3 mtrix ˆΩ in P (eqution 4), or by point ˆω =(, b, c, d, e, f) t in P From eqution 4, replcing Ω, H c by the result of equtions 3, nd ssuming Υ=αs k c y f c c x, yields b c d e f = αn yn z f c n z αcynynz f c n z fc n xn z αf c n z α f c n z s k αf 3 c ( s k f c + α ) n z Υ α f 3 c + α n z cy s kn xn z fc α3 c y n z nxnzυ αfc + s kn z Υ αf 4 c n z Υ α f 4 c The prctdioptric imge of line depends on the intrinsic prmeters of the system nd on the orienttion of the 3D plne Π (Fig 1) After some lgebric mnipultion the previous result cn be rewritten in the form of eqution 6 If the clibrtion is known then the conic curve ˆω is only described by prmeters, d nd e These three prmeters encode the scle informtion nd the orienttion of plne Π contining the imged line Considering tht conic ˆω hs DOF, we my conclude tht 3 DOF depend on the prbolic system prmeters, nd the remining DOF re relted with the line tht is projected ˆω = b c d e f = ( α s k f c αs k f c + α 4 ) d e α fc c x d c y e 4 Prctdioptric Line Estimtion Assume tht we hve prctdioptric imge of K lines in spce Ech line is projected in conic curve ˆω i prmeterized hs point in P (eqution 7) The gol is to correctly estimte the set of conic curves knowing neither the system clibrtion nor the position of the lines in the scene (6) ˆω i =( i,b i,c i,d i,e i,f i ) t, i=1,,3 K (7) 41 Estimtion of ˆω i from Imge Points Consider the imge points ˆx i j = (ˆx j, ŷ j ) t with j = 1, M i nd M i, lying on conic ˆω i Neglecting the effects of noise it is strightforwrd tht A iˆω i must be null (eqution 8) ˆx 1 ˆx 1 ŷ 1 ŷ 1 ˆx 1 ŷ 1 1 ˆx ˆx ŷ ŷ ˆx ŷ 1 ˆω i = } ˆx M i ˆx Mi ŷ Mi ŷm {{ i ˆx Mi ŷ Mi 1 } A i (8) Eqution 9 provides the design mtrix A for the entire set of conic curves p =(ˆω 1, ˆω ˆω K ) t A 1 A A 3 } {{ A K } A ˆω 1 ˆω ˆω 3 ˆω K } {{ } p = (9) The equlity of eqution 9 is only verified in idel circumstnces In generl the dt points re corrupted with noise nd Ap One wy to estimte the set of conic curves is to find the solution p tht minimizes the lgebric distnce φ (eqution 1) under the constrint p t p =1 The minimizer is the normlized eigenvector of A t A corresponding to the smllest eigenvlue φ(p) =p t A t Ap (1) /3 $17 3 IEEE

4 As referred bove the problem is tht in generl the conic curves corresponding to the prctdioptric projection of lines re strongly occluded in the imge We re only ble to obtin points lying on smll rc of the curve There re severl other conic fitting lgorithms which minimizes other distnces thn the lgebric one [7] However none of them works properly under these circumstnces since the dt points do not provide enough informtion to correctly estimte the conics This pper proposes to solve the estimtion problem by constrining the serch spce using the properties of prctdioptric line projection 4 Constrints Verified by Set of Prctdioptric Line Imges Assume K lines in the scene tht re projected into K conic curves in the prctdioptric imge plne (K 3) These conic curves cn be represented by points of P s shown in eqution 7 From the result of eqution 6 yields b 1 = b = b 3 = = b K = αs k 1 3 K f c c 1 = c = c 3 = = c K = α s k 1 3 K fc + α 4 From the first expression rises tht η i = for i =, 3 K with η i provided by eqution 11 Moreover, using the second expression in similr mnner, comes tht χ i =for i =, 3 K where χ i is given by eqution 1 η i = 1 b i i b 1, i=,3 K (11) χ i = 1 c i i c 1, i=,3 K (1) From eqution 6 rises tht ech line imge ˆω i must verify α f c i + c x d i + c y e i + f i = Consider the conic curves ˆω 1, ˆω nd ˆω 3, which re the first three elements of the set of line imges α f c, c x nd c y cn be determined s follows α f c c x c y = 1 d 1 e 1 d e 3 d 3 e 3 } {{ } Φ 1 f 1 f f 3 Γ If K>3 then ech conic curve ˆω i with i =4Kmust verify the constrint ν i =(eqution 13) ν i = [ i d i e i f i ] [ Φ 1 Γ 1 ], i=4 K (13) It is cler tht if set of K conic curves corresponds to the prctdioptric projection of K lines, then η i, χ i nd ν i, provided in equtions 11, 1 nd 13, must be equl to zero We hve derived 3K independent conditions which re necessry for the conic curves to be prctdioptric line imges However it hs not been proved tht these conditions re lso sufficient By sufficient we men tht, if certin set of conic curves verify these conditions then it cn be the prctdioptric projection of set of lines Consider the unclibrted imge of K lines tht re mpped in the sme number of conics Since ech conic hs DOF then set of K conics hs totl of K DOF Ech line introduces unknowns (DOF), which correspond to the orienttion of the ssocited plne Π (see Fig 1) Moreover the prmeters of mtrix H c re lso unknown (eqution ) Thus there re totl of K +unknowns (DOF) Since K >K +then it is obvious tht there re sets of conic curves tht cn never be the prctdioptric projection of lines The conics tht cn correspond to the imge of the lines lie in subspce of dimension K + This mens tht there re 3K independent constrints, which proves the sufficiency of the conditions derived bove 43 Estimtion of Line Imges for Clibrtion Purposes Section 41 shows how to estimte the set of K prctdioptric line imges using imge points The method consists in finding solution p for the conic curves which minimizes the lgebric distnce to the dt (eqution 1) Since the curves pper strongly occluded in the imge plne, the estimtion results re in generl very inccurte Section 4 shows tht set of K conic curves corresponds to the prctdioptric projection of K lines, if nd only if, it verifies the constrints provided by equtions 11, 1 nd 13 Our pproch consists in using the necessry nd sufficient conditions derived bove to constrint s much s possible the serch spce 431 Generl Cse Assume the imge of K lines cquired by n unclibrted prctdioptric cmer Nothing is known bout the prmeters of mtrix H c The skew cn be non null nd the spect rtio different from one Function φ provides the lgebric distnce between the set of conic curves p nd the dt points (eqution 1) We im to minimize of the lgebric distnce under the constrints η i =, χ i =nd ν i =(equtions 11, 1 nd 13) One wy to chieve this gol is to find the solution p which minimizes the function ɛ provided in eqution 14 K K K ɛ(p) =φ(p)+λ( ηi + χ i + νi ) (14) i= i= i= /3 $17 3 IEEE

5 The constrints re introduced s penlty terms weighted by prmeter λ The minimiztion of the function ɛ cn be stted s nonliner lest squres problem The solution cn be found using Guss-Newton or Levenberg-Mrqurdt lgorithms Notice tht the Jcobin mtrix cn be explicitly derived 43 Skewless Imges with Known Aspect Rtio Assume tht the orthogrphic cmer is skewless nd tht the spect rtio α is known Replcing s k by in eqution 6 yields b =nd c = α 4 The constrints η i =nd χ i =for i =K, become b i =nd c i α 4 i = for i =1K Notice tht there re two dditionl constrints becuse now two of the clibrtion prmeters re known The new function ɛ is given by eqution 1 K K K ɛ(p) =φ(p)+λ( b i + (c i α 4 i ) + νi ) (1) i=1 i=1 i=4 Mking b i =nd c i = α 4 i in eqution 8 yields ˆx 1 + α 4 ŷ1 ˆx 1 ŷ 1 1 ˆx + α 4 ŷ ˆx ŷ 1 ˆx M i + α 4 ŷm i ˆx Mi ŷ Mi 1 à i i d i e i f i ω i = A novel design mtrix à cn be obtined by replcing A i by à i for i = 1K in eqution 9 Consider φ( p) = p t à t à p with p =( ω 1 t ω K t )t The minimum of function φ( p) is the set of conic curves which minimizes the lgebric distnce to the dt points nd verifies the constrints b i =nd c i α 4 i = Thus we cn use the objective function ɛ insted of the one of eqution 1 ɛ( p) = p t à t à p + φ( p) [ λ K νi i=4 ] (16) In generl the minimiztion of function ɛ is still nonliner lest squres problem However if K =3then the second term of eqution 16 disppers nd the problem becomes closed from The solution is given by the eigenvector corresponding to the smllest eigenvlue of à t ÃEven when K > 3 the eigenvector solution is in generl quite ccurte In this cse the conditions of eqution 13 re neglected nd the serch spce is not fully constrined Nevertheless it is constrined enough to provide good results Performnce Evlution Other uthors hve lredy proposed lgorithms to clibrte prctdioptric cmer [4, 6, ] The pproch presented in [6] requires sequence of prctdioptric imges The system is clibrted using the consistency of pirwise trcked point fetures cross the sequence, bsed on the chrcteristics of ctdioptric imging In [], the center nd focl length re determined by fitting circle to the imge of the mirror boundry The method is simple nd cn be esily utomted, however it is not very ccurte nd requires the visibility of the mirror boundry Its mjor drwbck is tht it is only pplicble for the sitution of skewless cmer with unitry spect rtio Geyer nd Dniilidis propose clibrtion lgorithm using line imges [4] They present closed-form solution for focl length, imge center, nd spect rtio for skewless cmers, nd polynomil root solution in the presence of skew The line imges re estimted tking into ccount the properties of prbolic projections Nevertheless the conic curves verifying those properties re not necessrily the prctdioptric projection of lines In this section we use simulted imges to evlute the performnce of our lgorithm nd compre it with the one proposed by Geyer nd Dniilidis 1 Simultion Scheme Assume prctdioptric cmer with field of view (FOV) of 18 nd pre-defined intrinsic prmeters The imge of set of K lines is generted s follows To ech line in the scene corresponds plne Π with norml n (Fig 1) The K normls re unitry nd rndomly chosen from n uniform distribution in the sphere Ech norml defines plne tht intersects the unit sphere in gret circle Notice tht hlf of the gret circle is within the cmer field of view An ngle θ, less or equl to the FOV, is chosen to be the mplitude of the rc tht is ctully visible in the prctdioptric imge The rc is rndomly nd uniformly positioned long the prt of the gret circle which is within the FOV The visible rc is uniformly smpled by fixed number N of smple points The ech smple point corresponds projective ry x The smple rys re projected using formul 1 nd trnsformed using with the chosen intrinsic prmeters Two dimensionl gussin noise with zero men nd stndrd devition σ is dded to ech imge point ˆx As finl remrk notice tht the mplitude of the visible rc is mesured in the gret circle where plne Π intersects the sphere, nd not in the conic curve where the line is projected In generl the visible ngle of the prctdioptric line imge is much less thn θ /3 $17 3 IEEE

6 4 N = 3 ; Θ = 17 N = 8 ; Θ = 17 N = 4 ; Θ = 9 N = ; Θ = Lines Lines 7 Lines 9 Lines 4 Focl Length RMS Error (pixel) 3 3 Skew MEDIAN Error (pixel) Noise Stndrd Devition (pixel) 11 N = 3 ; Θ = 17 1 N = 8 ; Θ = 17 N = 4 ; Θ = 9 9 N = ; Θ = Noise Stndrd Devition (pixel) 3 3 Lines Lines 7 Lines 9 Lines Center RMS Error (pixel) Focl Length MEDIAN Error (pixel) Noise Stndrd Devition (pixel) Noise Stndrd Devition (pixel) Figure : Clibrtion of skewless system with known spect rtio using three line imges Figure 3: Clibrtion results for skew nd focl length using 3,, 7 nd 9 lines Clibrtion of Skewless Cmer with Known Aspect Rtio Consider prbolic cmer such tht the skew is (s k = ), the spect rtio is 11 (α = 1), nd both re ssumed to be known We wish to determine the focl length (f c = 4) nd the imge center ((c x,c y ) = (33, 38)) using the imge of three lines (K =3) The line imges re estimted using the closed-form solution proposed t the end of section 43 nd the system is clibrted using the lgorithm presented in Tb 1 The dt points re rtificilly generted using the simultion scheme explined bove The estimted clibrtion prmeters re compred with the ground truth nd the RMS error is computed over 1 runs of ech experiment Fig shows the results for different choices of θ (mplitude of the visible rc) nd N (number of smple points) For ech sitution the stndrd devition of the dditive gussin noise vries between nd 6 pixels by increments of pixels For θ = 17 the lgorithms presents n excellent performnce The decrese on the number of smple points from 3 to 8 only slightly ffects the ro- bustness to noise Since we re only using three lines, the decrese on the mplitude of the visible rc θ nd on the number of points N hs strong impct on the performnce Even so the clibrtion using rcs of 9 is still prcticble The sitution of θ =7 nd N =is very extreme leding to bd estimtion of the intrinsic prmeters The performnce of method proposed in [4] is evluted using similr simultion conditions A direct comprison cn be mde between the results presented in here nd the ones presented on their pper In generl terms they estimte the conic curves by exploiting the fct tht the imge center must lie in the line going through the intersection points of ny two line imges As discussed in section 4, this condition is necessry, but not sufficient, for set of conic curves to be the prctdioptric projection of lines Since the serch spce is not fully constrined, they need much more thn three line imges to clibrte the sensor The results presented in Fig re obtined using the minimum theoreticl number of lines for clibrtion [3] Even so, nd s fr s we re ble to judge from the results presented in [4], the performnce of our pproch seems to be significntly better /3 $17 3 IEEE

7 3 Lines 4 Lines Lines 6 Lines α men std f c men std s k men std c x men std c y men std Figure 4: Line imges estimtion for clibrtion Tble : Clibrting prctdioptric system using K lines 3 Generl Clibrtion Consider tht nothing is known bout the clibrtion prmeters We wish to determine the spect rtio, skew, focl length nd imge center using line imges The mplitude of the visible rc nd the number of smple points re respectively θ = 14 nd N = 14 (section 1) The present experiment compres the performnce of the clibrtion lgorithm for 3,, 7 nd 9 line imges The set of line imges is estimted by minimizing the function ɛ provided by eqution 14 The solution is found using n itertive grdient descent method The strting point is the minimizer of the lgebric distnce to the dt points (eqution 1) The clibrtion prmeters re computed (Tb 1), the results re compred with the ground truth nd the medin error is computed over 1 runs The performnce of the clibrtion lgorithm cn be observed in Fig 3 As expected the increse in the number of lines improves the robustness of the clibrtion 6 Experiments with Rel Imges Five imges re tken using prctdioptric cmer with resolution nd the FOV 18 Fig 4 depicts one of the clibrtion imges For ech frme set of points lying on 6 different line imges is selected The points re used to estimte the conic loci where the lines re imged Since nothing is known bout the sensor clibrtion, the estimtion of the set of line imges must be performed by minimizing function ɛ (eqution 14) The sensor is clibrted using 3, 4, nd 6 lines Tb presents the men nd the stndrd devition of the clibrtion results obtined with ech imge Notice tht the estimted vlues for the clibrtion prmeters re more or less the sme for the different K (number of lines) The stndrd devition cts s mesure of confidence If the results obtined for ech imge re very different, the vrince is high nd the chieved clibrtion is not trustble As expected the stndrd devition decreses when the number of lines increses To evlute the correctness of the clibrtion we performed the perspective rectifiction of prctdioptric imge of six pirs of prllel lines The lines were estimted in the rectified imge using norml lest squres The ngle between ech two directions ws determined using the corresponding vnishing points nd the imge of the bsolute conic (which is known since the perspective is rtificilly generted) The ngles between ech two directions were computed nd the results were compred with the ngles mesured in the scene The men of the error ws 1 nd the stndrd devition ws 3 References [1] S Bker nd S Nyr, A theory of ctdioptric imge formtion, in IEEE Interntionl Conference on Computer Vision, Bomby, 1998 [] C Geyer nd K Dniilidis, An unifying theory for centrl pnormic systems nd prticl implictions, in Europen Conference on Computer Vision, Dublin, [3] Joo P Brreto nd Helder Arujo, Geometric properties of centrl ctdioptric line imges, in Europen Conference on Computer Vision, Copenhgen, My [4] C Geyer nd K Dniilidis, Prctdioptric cmer clibrtion, IEEE Trns on Pttern Anlysis nd Mchine Intelligence, vol 4, no 4, April [] Y Ygi, S Kwto nd S Tsuji, Rel-time Omnidirectionl Vision Sensor(copis) for Vision Guided Nvigtion, IEEE Trns on Robotics nd Automtion, vol 1, pp 11-, 1994 [6] S B Kng, Ctdioptric self clibrtion, in IEEE Int Conf on Computer Vision nd Pttern Recognition, USA, [7] A Fitzgibbon nd R Fisher, A buyer s guide to conic fitting, in British Mchine Vision Conference, Birminghm, /3 $17 3 IEEE

Paracatadioptric Camera Calibration Using Lines

Paracatadioptric Camera Calibration Using Lines Prctdioptric Cmer Clibrtion Using Lines Joo P Brreto, Helder Arujo Institute of Systems nd Robotics - Dept of Electricl nd Computer Engineering University of Coimbr, Coimbr, Portugl Abstrct Prctdioptric

More information

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round

More information

Lecture 4 Single View Metrology

Lecture 4 Single View Metrology Lecture 4 Single View Metrology Professor Silvio Svrese Computtionl Vision nd Geometry Lb Silvio Svrese Lecture 4-4-Jn-5 Lecture 4 Single View Metrology Review clibrtion nd 2D trnsformtions Vnishing points

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

Fitting Conics to Paracatadioptric Projections of Lines

Fitting Conics to Paracatadioptric Projections of Lines Fitting Conics to Paracatadioptric Projections of Lines João P. Barreto, Helder Araujo Institute for Systems and Robotics Dept. of Electrical and Computer Engineering University of Coimbra, 3030 Coimbra,

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

Ray surface intersections

Ray surface intersections Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive

More information

Topics in Analytic Geometry

Topics in Analytic Geometry Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 2530: WORKSHEET 7. x 2 y dz dy dx = MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl

More information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

Math 35 Review Sheet, Spring 2014

Math 35 Review Sheet, Spring 2014 Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve. Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the

More information

II. THE ALGORITHM. A. Depth Map Processing

II. THE ALGORITHM. A. Depth Map Processing Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A

More information

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016) \ Interntionl Conference on Mechnics, Mterils nd tructurl Engineering (ICMME 2016) Reserch on the Method to Clibrte tructure Prmeters of Line tructured Light Vision ensor Mingng Niu1,, Kngnin Zho1, b,

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

Pointwise convergence need not behave well with respect to standard properties such as continuity.

Pointwise convergence need not behave well with respect to standard properties such as continuity. Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of

More information

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction

More information

Step-Voltage Regulator Model Test System

Step-Voltage Regulator Model Test System IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node

More information

Approximation by NURBS with free knots

Approximation by NURBS with free knots pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

Surfaces. Differential Geometry Lia Vas

Surfaces. Differential Geometry Lia Vas Differentil Geometry Li Vs Surfces When studying curves, we studied how the curve twisted nd turned in spce. We now turn to surfces, two-dimensionl objects in three-dimensionl spce nd exmine how the concept

More information

ANALYTICAL GEOMETRY. The curves obtained by slicing the cone with a plane not passing through the vertex are called conics.

ANALYTICAL GEOMETRY. The curves obtained by slicing the cone with a plane not passing through the vertex are called conics. ANALYTICAL GEOMETRY Definition of Conic: The curves obtined by slicing the cone with plne not pssing through the vertex re clled conics. A Conic is the locus directrix of point which moves in plne, so

More information

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

OPTICS. (b) 3 3. (d) (c) , A small piece

OPTICS. (b) 3 3. (d) (c) , A small piece AQB-07-P-106 641. If the refrctive indices of crown glss for red, yellow nd violet colours re 1.5140, 1.5170 nd 1.518 respectively nd for flint glss re 1.644, 1.6499 nd 1.685 respectively, then the dispersive

More information

1 Quad-Edge Construction Operators

1 Quad-Edge Construction Operators CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike

More information

Text mining: bag of words representation and beyond it

Text mining: bag of words representation and beyond it Text mining: bg of words representtion nd beyond it Jsmink Dobš Fculty of Orgniztion nd Informtics University of Zgreb 1 Outline Definition of text mining Vector spce model or Bg of words representtion

More information

Digital approximation to extended depth of field in no telecentric imaging systems

Digital approximation to extended depth of field in no telecentric imaging systems Journl of Physics: Conference Series Digitl pproximtion to extended depth of field in no telecentric imging systems To cite this rticle: J E Meneses nd C R Contrers 0 J Phys: Conf Ser 74 0040 View the

More information

TASK SPECIFIC DESCRIPTION

TASK SPECIFIC DESCRIPTION MYP Algebr II/Trig Unit 2 Ch. 4 Trnsformtions Project Nme: Block: - Due Dte: Tuesdy, 11/7 (B-dy) & Wednesdy, 11/8 (A-dy) Mterils: Grph pper, ruler, protrctor, compss, highlight mrkers/colored pencils SCORE:

More information

Optimization of Air Bearing Slider Design

Optimization of Air Bearing Slider Design Proceedings of TC2005 orld Tribology Congress III Proceedings of TC2005 September 2-6, orld 2005, Tribology shington, Congress D.C., III SA September 2-6, 2005, shington, D.C., SA Optimiztion of Air Bering

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 25 CLASS 5 NOTES, SEP MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

Chapter Spline Method of Interpolation More Examples Electrical Engineering

Chapter Spline Method of Interpolation More Examples Electrical Engineering Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

6.2 Volumes of Revolution: The Disk Method

6.2 Volumes of Revolution: The Disk Method mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

9.1 apply the distance and midpoint formulas

9.1 apply the distance and midpoint formulas 9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the

More information

Illumination and Shading

Illumination and Shading Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht

More information

9 Graph Cutting Procedures

9 Graph Cutting Procedures 9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric

More information

Tree Structured Symmetrical Systems of Linear Equations and their Graphical Solution

Tree Structured Symmetrical Systems of Linear Equations and their Graphical Solution Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime

More information

4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E

4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E 4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in

More information

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho IMAGE QUALITY OPTIMIZATIO BASED O WAVELET FILTER DESIG AD WAVELET DECOMPOSITIO I JPEG2000 Do Qun nd Yo-Sung Ho School of Informtion & Mechtronics Gwngju Institute of Science nd Technology (GIST) 26 Cheomdn-gwgiro

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,

More information

Integration. October 25, 2016

Integration. October 25, 2016 Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X 4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X

More information

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl

More information

Integration. September 28, 2017

Integration. September 28, 2017 Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my

More information

ZZ - Advanced Math Review 2017

ZZ - Advanced Math Review 2017 ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

2. What are the types of diffraction and give the differences between them? (June 2005, June 2011)

2. What are the types of diffraction and give the differences between them? (June 2005, June 2011) UNIT-1 b DIFFRACTION Diffrction:A) Distinction between Fresnel nd Frunhofer diffrction, B) diffrction due to single slit, N-slits,C) Diffrction grting experiment. 1 A) Distinction between Fresnel nd Frunhofer

More information

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2

A TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2 A TRIANGLAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Atti Mous nd Eng. Slh M. Teh ABSTRACT In the present pper the strin-bsed pproch is pplied to develop new tringulr finite element

More information

Math 17 - Review. Review for Chapter 12

Math 17 - Review. Review for Chapter 12 Mth 17 - eview Ying Wu eview for hpter 12 1. Given prmetric plnr curve x = f(t), y = g(t), where t b, how to eliminte the prmeter? (Use substitutions, or use trigonometry identities, etc). How to prmeterize

More information

Accuracy in Warping ECT LV Surfaces to CT Angiography Coronary Vessels

Accuracy in Warping ECT LV Surfaces to CT Angiography Coronary Vessels Accurcy in Wrping ECT LV Surfces to CT Angiogrphy Coronry Vessels BC Lee, JN Kritzmn, JR Corbett, EP Ficro * University of Michign Helth System, Ann Arbor, MI Disclosure: * Receive softwre roylties from

More information

Digital Design. Chapter 6: Optimizations and Tradeoffs

Digital Design. Chapter 6: Optimizations and Tradeoffs Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com

More information

AVolumePreservingMapfromCubetoOctahedron

AVolumePreservingMapfromCubetoOctahedron Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online

More information

Parallel Square and Cube Computations

Parallel Square and Cube Computations Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu

More information

Lecture 5: Spatial Analysis Algorithms

Lecture 5: Spatial Analysis Algorithms Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/

More information

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye A Study on Eye Gze Estimtion Method Bsed on Corne Model of Humn Eye Eui Chul Lee 1 nd Kng Ryoung Prk 2 1 Dept. of Computer Science, Sngmyung University, 7 Hongji-dong, Jongro-Ku, Seoul, Republic of Kore

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN Interntionl Journl of Scientific & Engineering Reserch, Volume 4, Issue 1, December-1 ISSN 9-18 Generlised Gussin Qudrture over Sphere K. T. Shivrm Abstrct This pper presents Generlised Gussin qudrture

More information

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes

More information

15. 3D-Reconstruction from Vanishing Points

15. 3D-Reconstruction from Vanishing Points 15. 3D-Reconstruction from Vnishing Points Christin B.U. Perwss 1 nd Jon Lseny 2 1 Cvendish Lortory, Cmridge 2 C. U. Engineering Deprtment, Cmridge 15.1 Introduction 3D-reconstruction is currently n ctive

More information

Introduction. Chapter 4: Complex Integration. Introduction (Cont d)

Introduction. Chapter 4: Complex Integration. Introduction (Cont d) Introduction Chpter 4: Complex Integrtion Li, Yongzho Stte Key Lbortory of Integrted Services Networks, Xidin University October 10, 2010 The two-dimensionl nture of the complex plne required us to generlize

More information

Section 3.1: Sequences and Series

Section 3.1: Sequences and Series Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

Statistical classification of spatial relationships among mathematical symbols

Statistical classification of spatial relationships among mathematical symbols 2009 10th Interntionl Conference on Document Anlysis nd Recognition Sttisticl clssifiction of sptil reltionships mong mthemticl symbols Wl Aly, Seiichi Uchid Deprtment of Intelligent Systems, Kyushu University

More information

The Distributed Data Access Schemes in Lambda Grid Networks

The Distributed Data Access Schemes in Lambda Grid Networks The Distributed Dt Access Schemes in Lmbd Grid Networks Ryot Usui, Hiroyuki Miygi, Yutk Arkw, Storu Okmoto, nd Noki Ymnk Grdute School of Science for Open nd Environmentl Systems, Keio University, Jpn

More information

It is recommended to change the limits of integration while doing a substitution.

It is recommended to change the limits of integration while doing a substitution. MAT 21 eptember 7, 216 Review Indrjit Jn. Generl Tips It is recommended to chnge the limits of integrtion while doing substitution. First write the min formul (eg. centroid, moment of inerti, mss, work

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.

More information

CAMERA CALIBRATION METHOD FOR STEREO MEASUREMENTS

CAMERA CALIBRATION METHOD FOR STEREO MEASUREMENTS CAMEA CAIBATION METHOD FO STEEO MEASUEMENTS Sergiu Nedevschi, Tiberiu Mrit, Mirce Vid, du Dnescu, Dn Frentiu, Florin Onig, Ciprin Pocol, Dniel Mog Technicl University o Cluj-Npoc, 15 C. Dicoviciu Str.,

More information

ON THE DEHN COMPLEX OF VIRTUAL LINKS

ON THE DEHN COMPLEX OF VIRTUAL LINKS ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd

More information

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System Modeling nd Simultion of Short Rnge 3D Tringultion-Bsed Lser Scnning System Theodor Borngiu Anmri Dogr Alexndru Dumitrche April 14, 2008 Abstrct In this pper, simultion environment for short rnge 3D lser

More information

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment

More information

MENSURATION-IV

MENSURATION-IV MENSURATION-IV Theory: A solid is figure bounded by one or more surfce. Hence solid hs length, bredth nd height. The plne surfces tht bind solid re clled its fces. The fundmentl difference between plne

More information

About the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1

About the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1 Advnces in Engineering Reserch (AER), volume 143 6th Interntionl Conference on Energy nd Environmentl Protection (ICEEP 2017) About the Finite Element Anlysis for Bem-Hinged Frme Dun Jin1,, Li Yun-gui1

More information

Constrained Optimization. February 29

Constrained Optimization. February 29 Constrined Optimiztion Februry 9 Generl Problem min f( ) ( NLP) s.. t g ( ) i E i g ( ) i I i Modeling nd Constrints Adding constrints let s us model fr more richer set of problems. For our purpose we

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

Computer-Aided Multiscale Modelling for Chemical Process Engineering

Computer-Aided Multiscale Modelling for Chemical Process Engineering 17 th Europen Symposium on Computer Aided Process Engineesing ESCAPE17 V. Plesu nd P.S. Agchi (Editors) 2007 Elsevier B.V. All rights reserved. 1 Computer-Aided Multiscle Modelling for Chemicl Process

More information

Hyperbolas. Definition of Hyperbola

Hyperbolas. Definition of Hyperbola CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces

More information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

The Interdeciplinary Center Herzliya Technical Report CS-TR

The Interdeciplinary Center Herzliya Technical Report CS-TR The Interdeciplinry Center Herzliy Technicl Report CS-TR-2002-01 Recovering Epipolr Geometry from Imges of Smooth Surfces Yel Moses nd Iln Shimshoni Computer Science Deprtment The Interdisciplinry Center

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

Cone Cluster Labeling for Support Vector Clustering

Cone Cluster Labeling for Support Vector Clustering Cone Cluster Lbeling for Support Vector Clustering Sei-Hyung Lee Deprtment of Computer Science University of Msschusetts Lowell MA 1854, U.S.A. slee@cs.uml.edu Kren M. Dniels Deprtment of Computer Science

More information

Transparent neutral-element elimination in MPI reduction operations

Transparent neutral-element elimination in MPI reduction operations Trnsprent neutrl-element elimintion in MPI reduction opertions Jesper Lrsson Träff Deprtment of Scientific Computing University of Vienn Disclimer Exploiting repetition nd sprsity in input for reducing

More information

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS S. H. Jongsm E. T. A. vn de Weide H. W. M. Hoeijmkers Overset symposium 10-18-2012 Deprtment of mechnicl engineering

More information