FBE IE-11/00-11 AUTOMATED TOLERANCE INSPECTION USING IMPICIT AND PARAMETRIC REPRESENTATIONS OF OBJECT BOUNDARIES CEM ÜNSALAN AYTÜL ERÇĐL
|
|
- Gertrude Hutchinson
- 5 years ago
- Views:
Transcription
1 FBE IE-/- AUTOMATED TOLERACE ISPECTIO USIG IMPICIT AD PARAMETRIC REPRESETATIOS OF OBJECT BOUDARIES CEM ÜSALA AYTÜL ERÇĐL Ağustos August Fe Bilimleri Estitüsü Istitute for Graduate Studies i Sciece ad Egieerig Boğaziçi Uiversity, Bebek, Istabul, Turkey Boğaziçi Araştırmaları deeme iteliğide olup, bilimsel tartışmaya katkı amacıyla yayıladıklarıda, yazar(ları yazılı izi olmaksızı kedilerie atıfta buluulamaz. Boğaziçi Research papers are of a prelimiary ature, circulated to promote scietific discussio ad ot to be quoted without writte permissio of the author(s.
2 Automated Tolerace Ispectio usig Implicit ad Parametric Represetatios Cem ÜSALA Aytül ERÇĐL Ohio State Uiversity, Dept. of Electrical Egieerig Boğaziçi Uiversity, Dept. of Idustrial Egieerig Abstract: I this paper, two approaches of Automated Tolerace Ispectio will be proposed ad evaluated to see whether they are reliable, cosistet, robust ad applicable i a idustrial eviromet. A compariso of the studied methods will be preseted both i terms of their capabilities, ad their time requiremets. Keywords: implicit polyomials, parametric modelig, tolerace ispectio.. Itroductio Ispectio i its broadest sese is the process of determiig if a product deviated from a give set of specificatios [7,9]. May differet sectors of idustry have developed automatic systems to detect o-coformace ad treds, ad exercise process cotrol over discrete part maufacture. Dimesioal ispectio is oe of the most importat areas of ispectio. May automated ispectio systems have bee preseted i the literature [7]. Chi ad Harlow have surveyed some of the early work i automated visual ispectio i [3]. Chi preseted a secod survey of papers published from 98 to 987 i [4]. ewma ad Jai have surveyed the automated visual ispectio systems ad techiques that have bee reported i the literature from 983 to 988 i [3]. Curretly, may automated ispectio tasks are performed usig cotact ispectio devices that require the part to be stopped, carefully positioed, ad the repositioed several times. Machie visio ca alleviate the eed for precise positioig ad lie stoppage, ad there is also a lower level risk of product damage durig ispectio [8]. For automated ispectio to be feasible, however, it must ru i real-time ad be cosistet, reliable, robust ad cost-effective. I this paper, two approaches of Automated Tolerace Ispectio are proposed to see whether they are reliable, cosistet, robust ad applicable i a idustrial eviromet. Implicit polyomial ad parametric represetatios are the two approaches used for complex free-form object modelig ad ispectio. With these approaches, objects i D images are described by their silhouettes ad the represeted by D implicit polyomial curves or parametric equatios; objects i 3D data are represeted by implicit polyomial or parametric surfaces. The ispectio is carried out usig these boudary represetatios of the objects. The layout of the paper is as follows: Mathematical prelimiaries are give i sectio two. The proposed methods for automated tolerace ispectio i D are give i sectio three. The results are geeralized to ispectio i 3D i sectio four. I sectio three, a
3 implicit fuctio fittig method ad a theorem for ispectio i 3D is give. Experimetal results are give i sectio 5. Summary ad coclusios are give i sectio 6. I this study, aligmet is assumed to be doe prior to the ispectio operatio.. Mathematical Prelimiaries I this sectio, mathematical theorems ad tools to be used throughout the paper are itroduced. First the distace fuctios betwee two poits i -dimesioal real space are give. Depedig o these distace fuctios, a theorem to fid the distace betwee a poit ad a poit set which represets a shape i -dimesioal space is itroduced. Usig this theorem, a ew method for tolerace ispectio i -dimesioal space is give. Defiitio : Let dist be defied as the distace betwee two poits, ad dist dist β ( β,..., β R by give formulas: ( α, β max α k β k ( dist, β k k / ( α, β ( α k β k (3 k I geeral for p / p p (, β α k βk k α ( α,..., α R ( α α β ( dist p α (4 Defiitio: Let f ( x,..., x be a parametric or implicit represetatio of a - dimesioal shape. Defie two sets as: F x, y : f x,..., x ;( x,..., R {( ( x },..., α, d ( x,..., x : dist( ( x,..., x,( α,..., α { d;( x,..., x,( α,..., R } ( α α C I the followig figures, the poit set havig equal distace from origi for three differet distace fuctios are plotted. It is see from Figure that, for dist the set correspods to a square, for dist the set correspods to diamod ad for dist the set correspods to circle. k k Figure. a C (,, d, dist b C (,, d, dist c C (,, d, dist Defiitio 3: The distace betwee a poit ( α,..., α R ad F, deoted by d, is such that F C( α,..., α, d φ ad F C( α,..., α, d + ε φ as ε Ispectio theorems to be itroduced i the followig sectios will heavily deped o fidig real roots of a polyomial or a fuctio withi give rages. For this purpose, two methods from umerical aalysis are give i the followig theorems. First of these theorems is cocetrated o a iterative search withi a give rage. This theorem is applicable both for fuctios ad polyomial represetatios. The secod theorem is oly applicable for polyomials. It checks the existece of a real root withi give rages.
4 Theorem : (Iterval Halvig Method If f is a cotiuous fuctio o the iterval [ α, β ] ad if f ( α f ( β <, the f must have a zero i [ α, β ]. Proof: Sice ( α f ( β < α, β ad, therefore, it has at least oe zero i the iterval. More iformatio about this theorem ca be foud i the give refereces [,]. f, the fuctio f chages sig o the iterval [ ] Theorem : (Fourier-Buda Theorem Let p deote a real polyomial of degree, ad v(x deote the umber of sig chages i the sequece { p( x, p' ( x,..., p ( x }. For ay real α ad β such that β > α, p ( α p( β the umber of zeroes, z, i the iterval [ α, β ] (each zero couted with its proper multiplicity equals v( α v( β mius a eve o-egative iteger. z v( v( β k k,,,3.... α { } Proof: The proof of this theorem ca be foud i []. Corollary : If ( α v( β α, β. Proof: Let k, so that we obtai the upper boud for the umber of zeros, z, i the iterval [ α, β ]. Give that v( α v( β, z. This meas o zeros i the iterval [ α, β ]. I the followig Lemma, Fourier series approximatio of parametric represetatio of the shape will be give i a special form. The same procedure is applied to obtai the implicit form of star shaped objects [6]. v the o zero i the iterval [ ] Defiitio 4: Let C be a + dimesioal vector such that i i C ( i + ( a, C (i + ( b i,,,3 where s a x( k s k (5 a x( k cos( π b s k s k π s k x( ksi( s (7 s k i i ad D ( i + ( c, D (i + ( d i,,,3 where s c y( k s k (8 c y( kcos( d s k s k π s k y( ksi( s ( s k s s (6 (9 a, b, c, d correspod to Fourier series coefficiets of the parametric represetatio of a D shape f ( x( t, y( t t [, ]. s s is the total umber of samples of the fuctio x(k of the cotour of the D shape.
5 + + Defie to be a operator such that a i S ai S ( i i i ( Lemma : th degree Fourier series approximatio for x(t ad y(t ca be represeted as: ( α ± C y( t ( α ± α x( t α where α si(t Proof: th degree Fourier series approximatios for x(t ad y(t are: x D ( t ( a si( t + b cos( t ( y t ( c si( t + d cos( t ( (3 With the help of the operator give i Defiitio 4 ad expasios of sie ad cosie terms give i Appedix, equatios. ( ad (3 ca be writte as: x ( t ( si( t + cos( t C (4 y t ( si( t + cos( t Let The ( D (5 si(t α. From polar coordiate represetatios, si ( t + cos ( t t R cos( α t ±, α < So the above represetatios for x(t ad y(t are obtaied. I the previous results, the square root terms ca ot be avoided. To be able to use Theorem for fidig the roots, Taylor Series expasio ca be used to obtai a polyomial approximatio for fuctio forms obtaied. For this purpose the followig theorems are give here. Theorem 3: (Taylor s theorem i R, Form II Let U be a ope set i R ad let c be a poit of U. Let f be a real-valued fuctio o U that is (k+ times cotiuously differetiable o a eighborhood (c of c. For each x i (c there exists a poit z x i (c,x such that j K * f ( x, x ( x c + ( x c f ( c, c + Higher Order Terms j j! x x The above polyomial is called the k th Taylor polyomial of f at c. As a polyomial i * two variables, f has degree less tha or equal to k. Proof: The proof of this theorem ca be foud i the give referece []. Corollary: (Taylor s theorem i D Taylor polyomial i D aroud c is, K j d f ( x x c f c + Higher Order Terms j j ( dx ( (6! Proof: The proof of this theorem ca be foud i the give referece []. The Taylor series approximatio for x x x 5x 7x y ± d d 8d 6d 8d 56d y ± d x d x d + Higher Order Terms ca be give as:
6 To observe the approximatio quality of the give polyomials, circle ad two approximatig polyomials for this circle are plotted i Figure. Oly the regio close to the horizotal axis has some deficiecy, which will decrease as the degree of the approximatio is icreased. 3. Ispectio i D Figure. Circle ad its polyomial approximatio of degree I most works i computer aided desig, a surface is represeted parametrically as a smooth vector fuctio as s: R R 3 where each coordiate of s is typically either a polyomial or ratio of polyomials. Implicit polyomials, o the other had, are very effective for ivariat object recogitio ad are amog the most effective represetatios for complex free-form object modelig. For the ispectio process, objects i D images are described by their silhouettes ad the represeted by D parametric/implicit curves. The ext step is to obtai the image of the object to be ispected ad to extract the edge of the object. By applyig the procedure described below, each poit belogig to the edge is tested to check whether it is iside tolerace values or ot. This check is performed by formig a circle of radius equal to the tolerace limits aroud each pixel. If these circles itersect with the ideal template, the object is withi tolerace limits. The procedure is based o two sets, oe defiig the ideal template, ad the other defiig the tolerace regio aroud each poit belogig to the edge of the image, represeted by F ad C(d respectively. Here d deotes the radius of the circles, hece the tolerace. 3. Tolerace Ispectio usig a implicit polyomial represetatio of the object boudary A implicit surface is the set of zeros of a smooth fuctio f: R 3 R of three variables: Z(f {(x,x,x 3 t : f(x,x,x 3 }. Similarly, a implicit -D curve is the set of zeros of a smooth fuctio f: R R of two variables: Z(f {(x,x : f(x,x } The curves or surfaces are algebraic if the fuctios are polyomials. Other commo surface represetatios such as quadric surfaces (e.g. coes, ellipsoids, hyperboloids, etc. admit both a parametric ad a implicit form. However, there are some algebraic surfaces (third order ad higher that ca oly be represeted implicitly. A essetial requiremet for practicality of implicit polyomial related techiques is to have robust ad cosistet implicit polyomial fits to data sets [5]. The problem has bee formulated through differet miimizatio criteria ad costraits. A variety of iterative ad o-iterative solutio techiques, perturbatio methods ad stoppig rules have bee proposed i the literature [,4,5,6]. I this paper, Fourier series expasio of polar represetatio of a object cotour is used to obtai robust ad fast implicit polyomial
7 fittigs for star shaped objects i D ad 3D. The method is based o approximatig the polar represetatio of the cotour by a Fourier series ad the fidig the correspodig implicit polyomial usig the polar/cartesia coversio formulas. Fittig is achieved by fidig coefficiets i this structure usig the data. [6]. Lemma : Give a tolerace bad ± d ad a object havig a implicit polyomial model f ( x, y to observe whether a poit ( x, y is iside toleraces, due to differet distace fuctios, it is sufficiet to check the existece of at least oe real root for oe of the followig fuctios, havig oe variable. i- For distace fuctio dist f x x ± d y x d (7 (, ( ± d x y y f y d (8, ii- For distace fuctio dist f x x ± d x y x d (9 (, ( ( ± ( d y x y y, f y d ( iii- For distace fuctio dist ( x x, ± d x y ( ± d y x y y f x d ( f,, y d ( Proof: For three differet distace fuctios, if there exists at least oe real root withi give rages, the the implicit polyomial f ( x, y ad the circle, or the shape used for differet distace fuctios, havig a ceter ( x, y ad radius d has at least oe commo poit. From Defiitio 3, it is kow that the distace betwee poit ( x, y ad f x, y is smaller tha or equal to d. So the poit x, is iside toleraces. ( ( y 3. Tolerace Ispectio usig a parametric represetatio of the object boudary Although implicit algebraic curves ad surfaces have may good properties that make them the atural choice for object recogitio ad positioig, parametric curves ad surfaces outperform them i a fudametal area. More stable or robust algorithms are kow to approximate sets of measured data poits by parametric curves ad surfaces tha by their implicit couterparts. []. Lemma 3: Give a tolerace bad ± d ad a object havig a parametric model f ( x( t, y( t, t [, s ], to observe whether a poit ( x, y is iside toleraces, due to differet distace fuctios, it is sufficiet to check whether there exists at least oe t [, s ] that satisfies the iequality, for the distace fuctio used, give below. Aother method is to write the followig fuctios i special form give i Lemma ad search for the existece of real root for obtaied polyomial. i- For distace fuctio dist
8 x( t x d ad y( t y d (3 ii- For distace fuctio dist x( t x + y( t y d (4 iii- For distace fuctio dist x( t x + y( t y (5 ( ( d Proof: For three differet distace fuctios, if there exists at least oe t [, ] that s satisfies the iequalities give i eqs. (3 to (5, the the parametric form f ( x( t, y( t ad the circle, or the shape used for differet distace fuctios, havig a ceter ( x, y ad radius d has at least oe commo poit. From Defiitio 3, it is kow that the distace betwee poit ( x, y ad f ( x, y is smaller tha or equal to d. So the poit ( x, y is iside toleraces. If the parametric form is represeted as a polyomial by Lemma, the the methods derived for implicit represetatios ca be used. 4. Ispectio i 3D For the ispectio of 3D objects, the object boudaries are represeted by 3D parametric/implicit surfaces. The ispectio process is very similar to that described i previous sectios for the case of D objects. This check is performed by formig a sphere of radius equal to the tolerace limits aroud each pixel. If these spheres itersect with the ideal template, the object is withi tolerace limits. 4. Ispectio by implicit represetatios Lemma 4: Give a tolerace bad ± d ad a object havig a implicit polyomial model f ( x, y, z to observe whether a poit ( x, y, z is iside toleraces, it is sufficiet to check the existece of at least oe of the followig o-degeerate implicit fuctios havig two variables. i- For distace fuctio dist f x x y y, ± d z x d, y d (6 (, ( x x, ± d y, z z ( ± d x y y, z z f x d, z d (7 f y d, y d (8, ii- For distace fuctio dist f x x y y, ± d x y z x d, y d (9 (, ( ( x x, ± ( d x z y, z z ( ± ( d y z x y y, z z f x d, z d (3, f y d, z d (3 iii- For distace fuctio dist
9 ( x x, y y, ± d x y z ( x x, ± d x z y, z z ( ± d y z x, y y, z z f x d, y d (3 f x d, z d (33 f y d, z d (34 Proof: If at least oe of the implicit fuctios give i eqs. (6 to (34, due to differet distace fuctios, represet a o-degeerate implicit fuctio the the sphere havig a ceter ( x, y, z, radius d ad implicit fuctio f ( x, y, z have commo poits. So from Defiitio 3, the distace betwee poit ( x, y, z ad f ( x, y, z is smaller tha d. that is to say the poit is iside toleraces. To check whether a implicit fuctio/polyomial is degeerate or ot, it is sufficiet to covert it to parametric form ad check for at least oe positive real poit belogig to this parametric form. Coversio betwee implicit ad parametric forms ca be foud i the give referece [7]. Lemma 5: Give a tolerace bad ± d ad a object havig a implicit polyomial model f ( x, y, z to observe whether a ad a poit ( x, y, z is iside toleraces, it is sufficiet to check the existece of a space curve defied by f ( x, y, z ad implicit surface(s represetig the distace fuctio used. Proof: A space curve is represeted by the itersectio of two implicit surfaces. The first implicit surface is f ( x, y, z which represets the object. The secod implicit surface will be defied by distace fuctio used. If both of these surfaces itersect, the the poit to be ispected will be iside toleraces. I the same time, there will be a space curve formed by these two implicit surfaces. Checkig for the existece of a space curve ca be foud i the give referece [7]. 4. Ispectio by parametric represetatios: Lemma 6: Give a tolerace bad ± d ad a object havig a parametric patch model f ( X ( θ, ϕ, Y( θ, ϕ, Z( θ, ϕ, to observe whether a poit ( x, y, z is iside toleraces, it is sufficiet to check the existece of at least oe real root for oe of the followig fuctios havig two variables. i- For distace fuctio dist X ( θ, ϕ x d ad Y ( θ, ϕ y d ad Z( θ, ϕ z d (35 There exists at least oe θ, such that satisfies both iequalities. ( ϕ ii- For distace fuctio dist X ( θ, ϕ x + Y ( θ, ϕ y + Z ( θ, ϕ z d (36 ( θ, ϕ There exists at least oe such that satisfies the iequality. iii- For distace fuctio dist ( X ( θ, ϕ x + ( Y ( θ, ϕ y + ( Z( θ, ϕ z d (37 There exists at least oe θ, such that satisfies the iequality. ( ϕ
10 Proof: If oe of the fuctios give i eqs. (35 to (37, due to differet distace fuctios, have at least oe real root withi give rages, the the parametric patch model f ( X ( θ, ϕ, Y( θ, ϕ, Z( θ, ϕ ad the circle, or the shape used for differet distace fuctios, havig a ceter ( x, y, z ad radius d has at least oe commo poit. From Defiitio 3, it is kow that the distace betwee poit ( x, y, z ad f ( X ( θ, ϕ, Y( θ, ϕ, Z( θ, ϕ is smaller tha or equal to d. So the poit ( x, y, z is iside toleraces. The existece of at least oe real root ca be checked by umerical methods by iterative root fidig i D [8]. 5. Experimets I order to test the theory explaied above agaist real pieces several parts have bee obtaied from maufacturig orgaizatios. Both withi ad out of tolerace pieces were obtaied for testig purposes. After preprocessig operatios were coducted i a lab eviromet to obtai boudary data, the best fits were foud. ote that the order of the fit is differet for the implicit polyomial ad the parametric method. I the followig sectios, the applicatio of the implicit ad parametric method are explaied i detail ad the results are preseted. 5. Implemetatio of the Implicit Method The first step i the implemetatio is fidig the best fit for each part. As ca be see from Figure, the fit improves with the icrease i order of the polyomial. Sice the Fourier series expasio of the boudary is used i estimatig the implicit polyomial, error the actual image ad the fitted curve is easily obtaied. I the examples preseted, order was specified such that the error would be at the thousadths level. Oce a appropriate fit is foud, the ispectio is doe usig the procedure outlied above. To demostrate the importace of tolerace specificatio, the results of two differet tolerace values are displayed. For the first tolerace value (tolerace set to pixels, defects ca be detected (Figure 3.a, whereas i the secod tolerace value (tolerace set to 6 pixels all poits remai withi the tolerace limit (Figure 3.b. The poits that are out of tolerace are show with a red star i Figure 3.c. (for tolerace pixels. Figures 4 ad 5 show the ispectio results for some other objects.. Out of tolerac Figure 3. (a tolerace pixels defected, (b tolerace6 fail to detect defects (c out of tolerace poits marked red
11 (a (b (c (d Figure 4. (a The template object ad the implicit fit (b The template object ad the faulty part with implicit fit (c implicit ispectio with tolerace3 pixels (d ispectio with tolerace pixels. Figure 5 a Data ad 57 th order implicit fit, b Ispectio with tolerace pixels c Out of tolerace poits marked red The implicit polyomial method was very successful for the give examples, however, with the described fittig techique, oly star-shaped items could be modeled. Figure 5 shows a usuccessful attempt to fit a implicit polyomial to a o-star-shaped object at a order of. The image is of a alumium profile. I order to model these parts iterpolatio ad further aalysis is required. Whe the error of fit is above the give threshold, carryig out the ispectio task is ot reasoable. Figure 6. A usuccessful th order implicit fit 5. Implemetatio of the Parametric Method The same images used i applicatio of the ew implicit method were used to experimet with the parametric fittig techique. The sum of squared deviatios betwee the actual image ad the fitted curve is utilized i determiig the best fit. Figures 6-8 show the results of ispectig a object usig parametric represetatio.
12 Fig 7. a Imb-4 Data ad 4 th order b Ispectio with c Out of tolerace parametric fit tolerace pixels poits marked red Fig 8. a Imb4- Data ad 5 th order b Ispectio with c Out of tolerace parametric fit tolerace pixels poits marked red Fig 9. a Imb6- Data ad 5 th order b Ispectio with c Out of tolerace parametric fit tolerace pixels poits marked red It is importat to ote the modelig capability of parametric equatios. Although the implicit method was limited with star-shaped objects, it is possible to fid a fit for very complicated, o-star-shaped objects usig the parametric method. To give a example, the alumium profile that could ot be modeled usig implicit polyomials is preseted here with its parametric fit ad the ispectio output (Figure. Figure. a- imb8-4 th order parametric fit b- tolerace pixels (ote lower right edge c- out of tolerace poits marked red 5.3 Compariso of the Two methods A compariso of the implicit polyomial ad parametric represetatio methods is preseted i Table. Table : Compariso of the implicit ad the parametric method
13 Image # of poits Order of fit T. Fittig (sec T. Ispectio (sec Implicit parametric implicit parametric implicit Parametric Imb_ Imb_ Imb_ Imb_ Imb3_ Imb3_ Imb3_ Imb3_ Imb4_ Imb7_ Imb8_ The compariso is performed for both the fittig ad the ispectio procedures. The images icluded are show together with the umber of poits they have ad the order of the model their fit was achieved at the give tolerace level. T. Fittig is the time that is required to calculate the coefficiets of the implicit polyomial that is fitted. T. Ispectio is the time it takes for the ispectio algorithm to check whether object poits are withi the tolerace limits aroud the fit. Both the fittig time ad the ispectio times are foud to be icreasig with umber of poits ad degree of order. The time values give are i MATLAB, hece do ot represet real ispectio times. C implemetatio of the code would speed up the give times by at least a factor of. I Figure, the degrees of order for both methods are displayed. It is see that there is o clear relatio betwee method ad order of fit. Therefore it ca be cocluded that the difficulty to achieve a fit for a object is ot related to the method employed. As for the fittig time requiremets Figure shows that fittig time is cosiderably shorter for the parametric method. The ispectio time requiremets for the two methods are compared i Figure 3. Order of Fit 6 4 Imb_ Imb_ Imb_3 Imb_4 Imb3_ Imb3_3 Imb3_4 Imb3_6 Imb4_ Imb7_ Imb8_ Implicit Parametric Figure. Order of fit i the two methods for ivestigated images
14 Fittig Time (sec.5.5 Implicit Parametric Imb_ Imb_ Imb_3 Imb_4 Imb3_ Imb3_3 Imb3_4 Imb3_6 Imb4_ Imb7_ Imb8_ Figure. Fittig time requiremets i the two methods for ivestigated images T.Isp(d (dist (sec Imb_ Imb_ Imb_3 Imb_4 Imb3_ Imb3_3 Imb3_4 Imb3_6 Imb4_ Imb7_ Imb8_ Implicit Parametric Figure 3. Ispectio time requiremets i the two methods for ivestigated images I this example, ispectio of a 3D object by itersectio of two implicit surfaces is give. I ispectio, the first surface correspods to object to be ispected ad the secod surface correspods to the set created to ispect the poit, (,,, at the ceter. Tolerace value is take as d. Both of these implicit surfaces are plotted i Figure 4. Space curve is formed sice the poit to be ispected is iside toleraces. This formed space curve is plotted i Figure 5. For the object: x + y + z The ispectio surface: x + y + ( z. 3 Their itersectio set is obtaied as: x + y ad correspodig z-level is z Figure 4. Object ad data set for ispectio Figure 5. Space curve formed
15 6. Summary ad Coclusios I this paper, two approaches of Automated Tolerace Ispectio were itroduced ad their properties were studied. The ispectio is carried out usig implicit/parametric boudary represetatios of the objects. Fourier series expasio of polar represetatio of a object cotour is used to obtai robust ad fast implicit polyomial/parametric fuctio fittig of the object boudary. The order of the fit was specified such that the error would be at the thousadths level. As expected, better fits are achieved as the order of the model is icreased at the expese of icreased computatioal time. The processig time seems to icrease liearly with the order of the polyomial fit ad with the umber of poits o the boudary of the object. After the itroductio of two ew methods with implicit polyomial ad parametric represetatio the studied methods were compared o basis of their capabilities ad time requiremets. The studied implicit method works oly for star-shaped objects whereas the parametric method ca obtai fits for all free form objects allowig more flexibility i the implemetatio. I terms of time requiremets, the parametric method is faster tha implicit polyomial represetatio i both fittig ad ispectio. dist, which is the Euclidea distace, gives fastest result for both methods. Experimets doe i the previous sectio show clearly the practical applicatio power of the itroduced ispectio methods. The ispectio methods itroduced are suitable for parallel processig, hece ca be implemeted i real time. Ackowledgemets: This work has bee partially supported by TUBITAK MISAG 6, SF 465, EUREKA 77 ad BU Research Fud 99A3 projects. Refereces. M. M. Blae, Z. Lei, H. Civi ad D. B. Cooper The 3L Algorithm for Fittig Implicit Polyomial Curves ad Surfaces to Data IEEE PAMI,. R.L. Burde, J.D. Faires ad A.C. Reyolds, umerical Aalysis, Pridle, Weber & Scmidt, R.T. Chi ad C.A. Harlow, Automated Visual Ispectio: A Survey IEEE Tras. PAMI, vol. 6, pp , R.T. Chi, Automated Visual Ispectio: 98 to 987 Computer Visio Graphics ad Image Processig, vol. 4, pp , S.A. Douglas, Itroductio to Mathematical Aalysis, Addiso-Wesley, M. Hebert, J. Poce, T. Boult ad A. Gross eds. Object Represetatio i Computer Visio. Spriger Lecture otes i Computer Sciece Series. Spriger-Verlag, K. Hedegre, Methodology for Automatic Image-Based Ispectio of Idustrial Objects, i J. Saz (ed., Advaces i Machie Visio, pp. 6-9, Spriger Verlag, ew York, P. Herici, Computatioal Complex Aalysis vol., Joh Wiley ad Sos, ew York, C.W. Keedy, E.G. Hoffma ad S.D. Bod, Ispectio ad Gagig, Sixth Editio, Idustrial Press Ic., ew York, D. Kicaid ad W. Cheey, umerical Aalysis, d editio, Brooks Cale, Califoria, 996.
16 . Z. Lei, H. Civi ad D.B. Cooper, Free form Object Modelig ad Ispectio Proceedigs, Automated Optical Ispectio for Idustry, SPIE s Photoics Chia 96, Beijig, Chia, ovember 996. J.H. Mathews, umerical Methods for Mathematics Sciece ad Egieerig, d editio, Pretice Hall, ew Jersey, T.S. ewma ad A.K. Jai A Survey of Automated Visual Ispectio Computer Visio ad Image Uderstadig, vol. 6, pp. 3-6, March G. Taubi, Estimatio of plaar curves, surfaces ad o-plaar space curves defied by implicit equatios, with applicatios to edge ad rage image segmetatio. IEEE Trasactios o Patter Aalysis ad Machie Itelligece, ovember G. Taubi, F. Cukierma, S. Sulliva, J. Poce ad D.J. Kriegma, Parametrized family of polyomials for bouded algebraic curve ad surface fittig IEEE Trasactios o Patter Aalysis ad Machie Itelligece, March C. Usala ad A. Ercil, A ew robust ad fast implicit polyomial fittig techique, Proceedigs of MVIP 99, Akara, Turkey, September 999, 7. C. Usala ad A. Ercil, Coversio betwee parametric ad implicit forms for computer graphics ad visio, Proceedigs of ISCIS 99, pp , October 999, Kusadasi, Turkey 8. C. Usala ad A. Ercil, Automated Tolerace Ispectio By Implicit Polyomials, Proceedigs of ICIAP '99 th Iteratioal Coferece o Image Aalysis ad Processig, Image-based Emergig Applicatios, p. 8-5, September 999, Veice, Italy
17 Appedix We ca represet cos θ ad si θ for ay iteger, from recursive calculatios startig from cos θ ad si θ as: cos θ cos θ si θ si θ si θ cosθ 3 3 cos 3θ cos θ 3si θ cosθ si 3θ 3siθ cos θ si θ cos 4θ cos θ 6si θ cos θ + si θ si 4θ 4siθ cos θ 4 cosθ si θ
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. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationCreating 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 informationA 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 informationBezier 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 information3D 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 informationOnes 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 informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationAn 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 informationVisualization 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 informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
More informationPattern 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 informationA 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 informationChapter 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 informationNew 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 informationAn 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 informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationarxiv: 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 informationCounting 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 informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationMath 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 informationAccuracy 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 informationSouth 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 informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationThe 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 informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationDynamic 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 informationMobile 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 informationThe 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 informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationConsider 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 informationA 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 informationcondition 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 informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationAnalysis 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 informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationA Very Simple Approach for 3-D to 2-D Mapping
A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationMATHEMATICAL 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 informationComputational 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 informationPerformance 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 information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More informationLearning 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 informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationLinearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)
1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,
More informationFundamentals 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 informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationLecture 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 informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationAPPLICATION 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 informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationIntermediate Statistics
Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationImage 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 informationON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION
I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationBASED 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 informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationA 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 informationData 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 informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationLecture 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 informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationIMP: 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 informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationHandwriting 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 informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationProtected 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 informationParallel 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 informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationAn Efficient Image Rectification Method for Parallel Multi-Camera Arrangement
Y.-S. Kag ad Y.-S. Ho: A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet 141 A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet Yu-Suk Kag ad Yo-Sug Ho, Seior
More informationEffect 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 informationEvaluation 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 informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationDescriptive 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 information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More information