Efficient Free-Form Surface Modeling with Uncertainty

Size: px
Start display at page:

Download "Efficient Free-Form Surface Modeling with Uncertainty"

Transcription

1 IEEE Iteratioal oferece o Robotics ad utomatio, Mieapolis, US, pril 1996, Efficiet Free-Form Surface Modelig with Ucertaity Miguel gel García Luis asañez Divisio of Robotics ad rtificial Itelligece Istitute of yberetics Polytechic Uiversity of ataloia Diagoal 647, plata arceloa, SPIN fax: , garcia@ic.upc.es bstract This paper describes the use of a previously developed surface model for represetig 3D geometric iformatio that is subject to ucertaity. The proposed model is based o a geometric data fusio techique that allows the efficiet approximatio of arbitrary triagular meshes i space with smooth surfaces. This paper shows how the shape modifiers defied i that model ca be used to represet both global ad local ucertaity associated with the iput data. The possibility of hadlig scattered 3D poits, takig ito accout their correspodig ucertaities, makes this techique a suitable tool for modelig free-form surfaces acquired through sesig, as well as for itegratig 3D data obtaied from multiple sesors with differet associated cofideces. 1 Itroductio Free-form surface modelig is a field which ca be applied to a wide variety of disciplies, icludig robotics, computer graphics, computer aided geometric desig ad geographic iformatio systems. I mobile robotics, for example, free-form surface models ca be utilized to represet rugged terrai such that robots operatig outdoors may be able to pla their actios, safeguard their motios ad estimate their positios [9]. I additio, free-form surface models are advatageous i order to defie world models suitable for represetig complex shapes preset i the robotic workspace, especially whe o assumptios are made a priori about the ature of those shapes [7]. I fact, at the lowest level of iterpretatio ay surface ca be cosidered to be freeform, disregardig that, at subsequet stages, some of those surfaces may be idetified as well-established fuctios such as plaes or quadrics. I this sese, free-form The first author has bee supported by the Govermet of Spai uder both a FPI fellowship ad the IYT project TP complemetary grat has bee give to him by the Polytechic Uiversity of ataloia surface models costitute a rather geeral geometric descriptio tool. May differet free-form surface models have bee proposed over the last decades, especially i the areas of computer graphics ad computer aided geometric desig. survey of represetative methods ca be foud i [4]. I D/M ad computer graphics, tesor-product methods, such as -Splies or NURS, have become a stadard tool for free-form surface modelig. These models geerate smooth surfaces that approximate rectagular meshes of 3D cotrol poits. However, the eed for rectagular meshes complicates the modelig of surfaces of arbitrary topology ad geus closed surfaces with holes, for istace ad the applicatio of these techiques whe scattered data obtaied through sesig are hadled. Numerous o-tesor-product methods have also bee proposed to approximate ad iterpolate irregular meshes of 3D cotrol poits [4]. However, most of them are devised with the aim of geeratig fair surfaces they are proposed i the scope of computer graphics at the expese of efficiecy. The best models are based o recursive procedures or global optimizatio techiques. This complicates their applicatio to fields, such as robotics, with tight timig costraits. I additio, these techiques igore the presece of ucertaity sice they typically work with sythetically geerated data or with 3D poits obtaied through high resolutio scaers. I previous work [3][4], a ew techique for geeratig smooth free-form surfaces through approximatio of triagular meshes of 3D cotrol poits was proposed. Triagular meshes are appropriate for hadlig scattered iformatio ad they facilitate the itegratio of ew data as they become available to the system. techique for obtaiig triagular meshes from dese rage images was preseted i [6]. Moreover, the use of parametric fuctioals allows the represetatio of ope ad closed surfaces of arbitrary topology ad geus. That surface model possesses a set of additioal properties [5], icludig efficiecy, covex hull, affie ivariace ad shape cotrol, that make it suitable for the represetatio of

2 complex shapes i the cotext of a robotic system that must iteract with its eviromet i real-time [7]. This paper studies the use of shape modifiers provided by this model so that the geerated surfaces may reflect global ad local ucertaity estimatios associated with the sesed 3D data. Ucertaity hadlig is a very importat issue i robotics owig to the imprecise ature of sesig. Ucertaity has bee typically approached by statistical methods, by cosiderig that sesed data are subject to oise which ca be modeled as a probability desity fuctio usually Gaussia with a give mea ad a covariace matrix. ovariace matrices are physically iterpreted as ucertaity ellipsoids [11] cetered at the positios correspodig to the sesed data. I robotics, the problem of geometric ucertaity hadlig has bee tackled from two basic perspectives. O the oe had, some authors provide the sesor data ad their related ucertaities idepedetly. For example, Kweo ad Kaade [9] geerate elevatio maps ad associated ucertaity maps, the secod oes takig ito accout the ucertaity associated with sesor measuremets. Elevatio maps are computed disregardig the estimated ucertaities. I a similar lie, Hutchiso ad Kak [8] represet ucertaity i the positio of a object by a homogeeous trasformatio matrix whose etries are expressed i terms of ucertaity variables. other importat lie is costituted by methods i which sesor data are trasformed by takig ito accout their correspodig ucertaities. Typically, the aim of these techiques is the estimatio of geometric features, such as segmet ed-poits, from sesor readigs subject to ucertaity, the latter usually modeled as Gaussia probability distributios. The Kalma filter is used to geerate the best statistical estimatio of the physical parameters the ubiased estimatio of miimum variace from the give sesory observatios cosiderig their associated ucertaities. [1], [2], [1], [12] ad [13] are some works followig this approach. This paper presets a differet approach to the problem of geometric ucertaity hadlig. Our objective is the estimatio of the exteral surface of a object by takig ito accout a collectio of poits measured from the real surface of that object, ad ucertaity estimatios associated with those poits. The aim is to obtai a surface that automatically adapts to the available kowledge by itegratig both the measured positios ad their correspodig ucertaities. Sectio 2 outlies the proposed surface model. Sectio 3 aalyzes the use of the shape modifiers defied i the model i order to represet global ad local ucertaity. Fially, coclusios are give ad future work is proposed i Sectio 4. D K E D J K E Figure 1: Polygoal patches associated with cotrol triagle. 2 Free-form surface modelig L K F J This sectio summarizes a techique for approximatig triagular meshes of cotrol poits with smooth surfaces. Further details are give i [3][4]. Every vertex X of a give triagular mesh is a surface cotrol poit defied by three spatial coordiates ad a weightig factor: X { ( x X, y X, z X, W X }. Every triagle of the cotrol mesh is the domai of a parametric surface patch S ( P. The parameters of S are the three barycetric coordiates b, b, b of a evaluatio poit P cotaied i : P b + b + b where b + b + b 1 ad b, b, b 1., ad are the 3D coordiates of the vertices of. I this paper both S ( P ad S ( b, b, b will represet the value of the surface patch S for a give evaluatio poit P. The fial surface that approximates the give triagular mesh is composed of as may surface patches S as cotrol triagles. Those surface patches are defied so that they joi smoothly. Let Patch {,, a } be the set of cotrol poits composed of ad its a atural eighbors (adjacet cotrol poits. This set is defied i R 3 ad will be called a polygoal patch. Similar patches are defied for ad. Let {,, W a } be the weightig factors associated with those cotrol poits. ccordig to this defiitio, each triagle of the mesh belogs to three polygoal patches, Fig. 1. The surface computatio correspodig to a cotrol triagle requires similar operatios applied to the three patches that cotai that triagle. Due to space limitatios, some of these formulatios will oly be show for the patch cetered at. The correspodig equatios for the patches cetered at ad are obtaied by substitutig for or ad the modifyig the remaiig idices accordigly. M N I H I H G E F H G

3 ifluece K d K P If (K, P Γ (d d D E Figure 2: omputatio of topological iflueces. (left 2D polar represetatio of the polygoal patch cetered at cotrol poit i Fig. 1. (right Use of the topological distace d K to obtai the ifluece of cotrol poit K. First, each 3D polygoal patch is mapped to a 2D regular polygo which oly depeds o the umber of eighborig poits of the origial patch. This ew represetatio has bee called the polar represetatio of a polygoal patch: Polar {,, a }. The cetral vertex is set to (.,.. The remaiig poits are defied as i ( cos ( 2π ( i 1 a, si ( 2π ( i 1 a. Next, the polar represetatio of the evaluatio poit P is computed for each of the three patches (oly show for : P b + b + b, where,, are the polar represetatios of,, i Patch. The, a ifluece factor If i, P that deotes the ifluece each i exerts upo P is computed, Fig. 2. Similar formulatios are defied for the polygoal patches cetered at ad. If (1 where d i P, d 2, represets the Euclidea 2 distace betwee two poits i R 2 ad N,2 is the quadratic basis -splie fuctio [3] with kot vector [, 1/3, 2/3, 1]. The parameter Γ i (1 cotrols the width of the bell-shaped fuctio (Fig. 2, behavig as a global shape modifier. The surface patch ( P is fially computed as S (b, b, b S (P FF (P S (P + FF (P S (P + FF (P S (P (2 where FF, FF ad FF are covex combiatio factors calculated as (oly show for Patch FF (3 ad S, S, S are parametric surface subpatches associated with the patches cetered at, ad respectively, d K i, P Γ ( d N, 2 (.5 d Γ +.5 S ( P FF ( P ( FF ( P + FF ( P + FF ( P 2 FF ( P b b b P 2 Γ Figure 3: Example of ope mesh ad recostructed surface. ll the weightig factors W X are equal to 1. Global shape modifier Γ cotrol triagles S ( P i a If (4 The previous surface patches, S, joi with 1 ( P cotiuity alog edges but with cotiuity across them. I spite of the discotiuity of derivatives across surface patches, experimetal results show good results with smooth surfaces displayig imperceptible defects, Fig. 3. Those surface patches may be optioally modified to esure first order geometric cotiuity G 1 betwee them by applyig a techique preseted i [3]. Sice this techique iterpolates the boudary curves defied by S ( P, it preserves the overall shapes defied through the shape modifiers of S ( P. Hece, the followig cosideratios are also applicable. 3 Ucertaity hadlig a i If i, P W i i i, P W i The shape of the recostructed surface ca be globally ad locally altered through shape modifiers defied i the model. These parameters may be utilized to itroduce both global ad local ucertaity i the surface recostructio process. Their behavior is studied below. 3.1 Embeddig global ucertaity Parameter Γ i (1 defies the amout of ifluece of a certai cotrol poit upo its adjacet eighbors. large value of Γ leads to the surface beig pulled eve by topologically distat vertices. The result is a icrease of smoothess, which ca be iterpreted as a bad reductio of a low-pass filter. Fig. 4 shows this effect by applyig a factor Γ equal to 1.5 istead of 1.25, which is the oe utilized i Fig. 3. This parameter is a global shape modifier that ca be used to represet the average geometrical ucertaity associated with the whole set of cotrol poits. Its behavior is aalyzed below.

4 Figure 4: Global shape modificatio of the cotrol mesh i Fig. 3. ll W X 1. Global shape modifier Γ1.5. Eq. (4 determies the relatioship betwee weight ad shape variatios. I particular, let be the cetral vertex of a 3D polygoal patch Patch with +1 cotrol poits, ad α a cotrol triagle cotaied i Patch β. ccordig to (1 to (4, cotrol poit exerts its maximum ifluece upo its correspodig surface patch whe the evaluatio poit P coicides with. I that case,. The, (4 ca be rewritte as α β i If α β i, W i i i If α β i, W i (5 ccordig to the defiitio of If give i (1, see Fig. 2, two differet iflueces are cosidered i (5: (i the ifluece exerted by the cetral vertex, If If, ad (ii the iflueces of the α β, cotrol poits adjacet to, If N If, α β i, i. Therefore, (5 may be rewritte as If + If N W i i i 1 (6 osiderig the defiitio of If ( X, P, If is the maximum of the bell-shaped fuctio Γ ( d defied i (1, ad correspods to a costat idepedet of the actual value of Γ: If Γ (.75. O the other had, If N Γ ( 1, cosiderig that the polar represetatios of all polygoal patches are regular polygos whose circumscircles have uitary radius. I this secod case, though, that ifluece depeds o the value of the global shape modifier Γ. Takig this ito accout ad cosiderig that all weightig factors are equal,... W W, (6 may be rewritte as If + If N W i i 1 Γ Figure 5: Effect upo the surface shape of the variatio of the global parameter Γ. cotrol poit with 4, 8, 12 ad 16 adjacet cotrol poits is cosidered. ( Γ ( Γ + α N ( Γ i α.75 + Γ ( 1 N ( Γ i 1 (7 which satisfies ( Γ + α N ( Γ 1. Eq. (7 expresses the way Γ affects the shape of the surface approximat. Sice Γ ( x.75 for ay x ad Γ, S ca theoretically rage betwee, whe Γ ( 1, ad whe, depedig o Γ. 1 + i Γ ( 1.75 i, I the first case, which correspods to Γ 1, the cotrol mesh is iterpolated although the resultig surface loses its smooth appearace. The secod case correspods to Γ ad leads to a fial degeerated surface. I practice, appropriate values for Γ rage betwee 1.5 ad 2.. Fig. 5. plots the fuctio ( Γ for Γ ragig betwee 1. ad 2. ad differet umber of adjacet cotrol poits. ( Γ reflects the shape of the approximatig surface sice it determies the relative ifluece of cotrol poit i the surface subpatch ( P with respect to its eighborig cotrol poits. Whe ( Γ 1, the surface shape is etirely determied by. I that case, the fial surface iterpolates. O the other had, ( Γ implies that the approximatig surface does ot deped o, oly o the weighted average of its eighborig cotrol poits. The graph i Fig. 5 shows that, for large values of Γ, the model favors the geeratio of a cosesus surface that teds to adapt to the shape defied by groups of cotrol poits rather tha idividuals. Hece, Γ may be used to represet the average ucertaity associated with the positios of all the cotrol poits of the mesh. Whe the ucertaity is low, the approximatig surface will reflect Γ ( Γ ( 1

5 Figure 6: Local shape modificatio of the cotrol mesh show i Fig. 3. ll W X 1 except for the cetral peak which is 25. Global shape modifier Γ1.25. the positios of the cotrol poits, which are cosidered to be accurate. Whe the ucertaity is high, the surface will reflect the overall shape defied by sets of poits. I this case, isolated poits that stray from the domiat tred will be filtered. Eq. (7 establishes the relatioship betwee surface shape ad Γ. lthough Γ may be directly utilized as a ucertaity variable, i some cases it may be desirable to defie other types of relatioships betwee shape variatio ad ucertaity. This issue will be discussed i Sectio Embeddig local ucertaity The weightig factors W i i (4 behave as local shape modifiers. The approximatig surface teds to pass closer to those cotrol poits with larger weights. For istace, Fig. 6 shows the approximatio of the same cotrol mesh used i Fig. 3, but givig the cetral peak a weightig factor equal to 25, four times lower that the other cotrol poits. The surface shape is oly altered i the area defied by the cotrol triagles surroudig the modified vertex. These local shape modifiers act by icreasig or decreasig the attractio forces associated with idividual vertices. Therefore, they ca be used to represet local ucertaity associated with the mesh cotrol poits. Their behavior is aalyzed below. s i the precedet sectio, let be the cetral vertex of a 3D polygoal patch Patch ad α β a cotrol triagle cotaied i Patch. Followig the same reasoig above, the value of the approximatig surface that correspods to cotrol poit is α β. The effect of eighborig cotrol poits ca be homogeized by doig W i W N for i i (4 to (6. Thus, (6 ca be rewritte as Figure 7: Effect of weight variatio upo the surface shape. is the weightig factor associated with. W N is the weightig factor associated with the eighbors of. + α N i α N / W N i 1 (8 which satisfies + α N 1 ad lim 1. α expresses the way W affects the shape of the approximat ear. I fact, will rage betwee ( 1 i 1, i whe, ad whe 1, as a fuctio of. Fig. 7 plots the fuctio ( / W N assumig that If Γ (.75, If N Γ ( 1.45, W N 1 ad several values of. These values of If ad If N correspod to a fuctio Γ ( d with Γ1.25, Fig. 2(right. Whe is equal to oe, the surface iterpolates cotrol poit. This would oly occur i the limit, whe. O the other had, a value of equal to zero meas that does ot exert ay ifluece upo the resultig surface. I that case, the surface would etirely deped o the cotrol poits adjacet to. ccordig to this formulatio, the variatio of a weighig factor produces a o-liear variatio of the shape associated with its correspodig cotrol poit. s show i Fig. 7, whe the weightig factor of a cotrol poit is large (low ucertaity with respect to its eighbors, the surface shape will highlight the positio of this poit. lteratively, whe that weightig factor ratio is low (high ucertaity, the surface shape will ted to igore that poit, approachig the 3D positio obtaied by averagig its eighbors. If W If + If N W N If N W N If + If N W N

6 I order to use those weightig factors as a meas to represet local ucertaity, it may be desirable to defie relatioships amog ucertaity ad shape variatio differet to the o-liear fuctio determied by (8. This issue is described below. 3.3 ustomized ucertaity hadlig Eq. (7 ad Eq. (8 express the relatioships betwee the shape of the surface approximat ear the cotrol poits of a give triagular mesh ad the global ad local shape modifiers defied i the model that ca be used to represet global ad local ucertaity respectively. I some cases, though, it may be preferable to express this relatioship as a user-defied fuctio differet from the oe defied by the surface model. If the relatioship betwee surface shape ad a certai parameter x is give by a o-liear fuctio α f ( x, such as (7 or (8, it is possible to obtai a liear shape variatio with respect to a secod parameter y by defiig 1 1 x as x f ( y, sice i that case, α f ( f ( y y. I this way, the shape variatio associated with a cotrol poit is a liear fuctio of y. I tur, if y is a fuctio of a third parameter u (for ucertaity, y g ( u, the the shape variatio will be fially determied by that userdefied fuctio g, α g ( u. Thus, it is possible to relate ucertaities to shape variatios i a customized way. osiderig the represetatio of global ucertaity i Sectio 3.1, the previous priciple may be applied as follows. For 1 < Γ 3, Γ ( 1 from (1 takes the form Γ ( 1 9. The, i (7 is α ( Γ Γ 2Γ 2 ( Γ ( Γ 2 6Γ + 3 (9 If ( Γ i (9 is substituted for a parameter y, Γ ca be obtaied by solvig the quadratic equatio ( u ( Γ 2 6uΓ + 3u. If Γ is defied i this way, ( y i (7 is a liear fuctio of y. Similarly, if i (8 is substituted for a parameter y, the local weight of a cotrol poit ca be obtaied as (1 With defied i this way, ( y i (8 is a liear fuctio of y. I both cases, y ca be defied as a arbitrary fuctio, g, of a ucertaity variable u. 4 oclusio y If N W N ( 1 y If This paper presets the applicatio of a previously developed free-form surface model to the represetatio of geometric iformatio that is subject to ucertaity. That model allows the approximatio of triagular meshes of 3D cotrol poits with smooth surfaces. Global ad local ucertaity associated with the cotrol poits ca be directly embedded ito the recostructio process through shape modifiers defied i the model. The behavior of those parameters has bee studied, as well as the way to cotrol the fial surface shape through user-defied ucertaity fuctios. pedig problem of iterest is the itegratio of measuremets that are subject to ucertaity with data cosidered to be reliable. I order to do that, the proposed surface model must be complemeted with iterpolatio capabilities. 5 Refereces [1] N. yache ad O. D. Faugeras, Maitaiig represetatios of the eviromet of a mobile robot. IEEE Tras. o Robotics ad utomatio, vol. 5, o. 6, pp , December [2] J. L. rowley, World modelig ad positio estimatio for a mobile robot usig ultrasoic ragig, IEEE It. of. o Robotics ad utomatio, pp , [3] M.. García, Smooth approximatio of irregular triagular meshes with G1 parametric surface patches. It. of. o omputatioal Graphics ad Visualizatio Techiques, lvor, Portugal, pp , December [4] M.. García, Efficiet surface recostructio for scattered poits through geometric data fusio. IEEE It. of. o Multisesor Fusio ad Itegratio for Itelliget Systems, Las Vegas, US, pp , [5] M.. García, Recostructio of visual surfaces from sparse data usig parametric triagular approximats. IEEE It. of. o Image Processig, usti, US, pp , [6] M.. García, Fast approximatio of rage images by triagular meshes geerated through adaptive radomized samplig. IEEE It. of. o Robotics ad utomatio, Nagoya, Japa, 6 pages, [7] M.. García, hierarchical world model represetatio supportig heterogeeous multisesory itegratio. ccepted for publicatio at It. of. o dvaced Robotics, Sat Feliu de Guíxols, Spai, 11 pages, September 2-22, [8] S.. Hutchiso ad.. Kak, Extedig the classical I paradigm to robotic assembly plaig. IEEE It. of. o Robotics ad utomatio, pp , 199. [9] S. Kweo ad T. Kaade, High resolutio terrai map from multiple sesor data. IEEE Tras. o Patter alysis ad Machie Itelligece, vol. 14, o. 2, pp , February [1] J. J. Leoard, H. F. Durrat-Whyte ad I. J. ox, Dyamic map buildig for a autoomous mobile robot. The Iteratioal Joural of Robotics Research, vol. 11, o. 4, pp , ugust [11] Y. Nakamura ad Y. Xu, Geometrical fusio method for multisesor robotic systems. IEEE It. of. o Robotics ad utomatio, pp , [12] F. Nashashibi ad M. Devy, 3D icremetal modelig ad robot localizatio i a structured eviromet usig a laser rage fider. IEEE It. of. o Robotics ad utomatio, pp. 2-27, 1993, [13] Z. Zhag ad O. Faugeras, 3D world model builder with a mobile robot. The Iteratioal Joural of Robotics Research, vol. 11, o. 4, pp , ugust 1992.

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended: Readig Recommeded: Stollitz, DeRose, ad Salesi. Wavelets for Computer Graphics: Theory ad Applicatios, 996, sectio 6.-6.3, 0., A.5. Subdivisio curves ad surfaces Note: there is a error i Stollitz, et al.,

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More information

Orientation. Orientation 10/28/15

Orientation. Orientation 10/28/15 Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

Lecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10

Lecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10 Lecture 24: Bezier Curves ad Surfaces thou shalt be ear uto me Geesis 45:0. Iterpolatio ad Approximatio Freeform curves ad surfaces are smooth shapes ofte describig ma-made objects. The hood of a car,

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS 28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets

More information

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

A General Framework for Accurate Statistical Timing Analysis Considering Correlations A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of

More information

Handwriting Stroke Extraction Using a New XYTC Transform

Handwriting Stroke Extraction Using a New XYTC Transform Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

Smooth Spline Surfaces over Irregular Meshes

Smooth Spline Surfaces over Irregular Meshes Smooth Splie Surfaces over Irregular Meshes Charles Loop Apple Computer, Ic. Abstract A algorithm for creatig smooth splie surfaces over irregular meshes is preseted. The algorithm is a geeralizatio of

More information

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015 Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

Dimension Reduction and Manifold Learning. Xin Zhang

Dimension Reduction and Manifold Learning. Xin Zhang Dimesio Reductio ad Maifold Learig Xi Zhag eeizhag@scut.edu.c Cotet Motivatio of maifold learig Pricipal compoet aalysis ad its etesio Maifold learig Global oliear maifold learig (IsoMap) Local oliear

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9. Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

More information

Improved triangular subdivision schemes 1

Improved triangular subdivision schemes 1 Improved triagular subdivisio schemes Hartmut Prautzsch 2 Georg Umlauf 3 Faultät für Iformati, Uiversität Karlsruhe, D-762 Karlsruhe, Germay E-mail: 2 prau@ira.ua.de 3 umlauf@ira.ua.de Abstract I this

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

localization error 1st pc pc 3 pc x2=

localization error 1st pc pc 3 pc x2= Proc. IROS'99, IEEE/RSJ It. Cof. o Itelliget Robots ad Systems, Kyogju, Korea, Oct 999 Robot Eviromet Modelig via Pricipal Compoet Regressio Nikos Vlassis Be Krose RWCP Autoomous Learig Fuctios SNN Dept.

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables 1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT

GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT 6th Iteratioal DAAAM Baltic Coferece INDUSTRIAL ENGINEERING 24-26 April 2008, Talli, Estoia GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT Rahayem, M.; Kjellader,

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology

More information

Convex hull ( 凸殻 ) property

Convex hull ( 凸殻 ) property Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Speeding-up dynamic programming in sequence alignment

Speeding-up dynamic programming in sequence alignment Departmet of Computer Sciece Aarhus Uiversity Demark Speedig-up dyamic programmig i sequece aligmet Master s Thesis Dug My Hoa - 443 December, Supervisor: Christia Nørgaard Storm Pederse Implemetatio code

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

EVALUATION OF ALGORITHMS FOR SURFACE INTERPOLATION OVER TRIANGULAR PATCH. Jenn-Taur Lee

EVALUATION OF ALGORITHMS FOR SURFACE INTERPOLATION OVER TRIANGULAR PATCH. Jenn-Taur Lee EVALUATION OF ALGORITHMS FOR SURFACE INTERPOLATION OVER TRIANGULAR PATCH Je-Taur Lee Departmet of Civil ad Evirometal Egieerig Uiversity of Wiscosi-Madiso Madiso, WI 53706 ABSTRACT Surface iterpolatio

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

SUBDIVISION surfaces are becoming more and more popular

SUBDIVISION surfaces are becoming more and more popular IEEE-TVCG RGB Subdivisio Erico Puppo, Member, IEEE, ad Daiele Paozzo Abstract We itroduce the RGB Subdivisio: a adaptive subdivisio scheme for triagle meshes, which is based o the iterative applicatio

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

Xiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation

Xiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Novel Encryption Schemes Based on Catalan Numbers

Novel Encryption Schemes Based on Catalan Numbers D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha

More information

Polymorph: Morphing Among Multiple Images

Polymorph: Morphing Among Multiple Images Feature Article Polymorph: Morphig Amog Multiple Images Image metamorphosis has prove to be a powerful visual effects tool. May breathtakig examples ow appear i film ad televisio, depictig the fluid trasformatio

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 1, 5-22 INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES NENAD U. STOJANOVIĆ Abstract. If above each side of a regular polygo

More information

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information