Distance based similarity measures of fuzzy sets
|
|
- Cathleen Gregory
- 5 years ago
- Views:
Transcription
1 Johanyák, Z. C., Kovács S.: Dstance based smlarty measures of fuzzy sets, SAMI 2005, 3 rd Slovakan-Hungaran Jont Symposum on Appled Machne Intellgence, Herl'any, Slovaka, January , ISBN , pp Dstance based smlarty measures of fuzzy sets Zsolt Csaba Johanyák Department of Informaton Technology, Kecskemét College, GAMF Faculty Kecskemét, H-600 Pf. 9, Hungary johanyak.csaba@gamf.kefo.hu Szlveszter Kovács Department of Informaton Technology, Unversty of Mskolc, Mskolc-Egyetemváros, Mskolc, H-355, Hungary szkovacs@t.un-mskolc.hu Abstract: In case of fuzzy reasonng n sparse fuzzy rule bases, the queston of selectng the sutable fuzzy smlarty measure s essental. The rule antecedents of the sparse fuzzy rule bases are not fully coverng the nput unverse therefore fuzzy reasonng methods appled for sparse fuzzy rule bases requres smlarty measures able to dstngush the smlarty of non-overlappng fuzzy sets too. The goal of ths paper s enumeratng some of these dstance based smlarty measures and brefly ntroducng them. Keywords: smlarty measure, dstance of fuzzy sets, vague envronment Dstance based smlarty measure The most obvous way of calculatng smlarty of fuzzy sets s based on ther dstance. There are more approaches on how the relaton between the two notons n form of a functon can be expressed. Two of them are presented below. The frst functon s the followng [7]: ( A,B) = + DM A,B SM, () ( ) where SM s the smlarty measure, DM s the dstance measure of two fuzzy sets, and A respectve B are the examned fuzzy sets.
2 Another way of dstance based smlarty assessment s proposed by Wllams and Steele n []. The suggested formula (2) contans an exponental expresson. - DM( A,B) ( ) = e SM A,B where s a steepness measure. The value =7 was found sutable for the practce n case of a one dmensonal unverse of dscourse. (2),20,00 Smlarty 0,80 0,60 0,0 SM SM2 0,20 0,00 0,00 0,2 0,2 0,36 0,8 0,60 0,72 0,8 0,96 Dstance Fg.. The functons () and (2) marked wth SM and SM2 are presented n Fg.. usng normalzed dstances. SM has a unform senstvty opposng to SM2 whch has a far hgher senstvty and capablty for dstncton n the frst quarter of the nterval. In case of a mult-dmensonal unverse of dscourse the approxmaton should be started wth a unversal dstance measure. Formng t needs the normalzaton of all lngustc varables for e.g. the nterval [0,]. It can be done by the help of pschtz functons [2]. The unversal dstance measure s determned as a weghted mean of the dstances measured along each dmenson (3). U n ( A,B) = w DM ( A, B) = DM (3) where n s the number of the nput lngustc varables, w s the weghtng for the th lngustc varable and DM s the dstance measured along the th dmenson. = 7 n = w () In a mult-dmensonal case the value of n (2) s determned by the formula () []. Instead of calculatng smlartes from dstances, by a small re-explanng of the meanngs of the fuzzy rules, we can use the dstances of fuzzy sets drectly for approxmate fuzzy reasonng.
3 Usng dstance based approxmate fuzzy reasonng has an mportant precondton. The dstance of fuzzy sets can be defned only on unverses where t s possble to defne full orderng and metrcs on every component of the unverse of dscourse of the fuzzy sets (any other case the noton of dstance s meanngless). A dstance functon DM: X x X can be consdered as metrcs, f the condtons specfed below are fulflled []: - DM(A,B) 0 A,B X - DM(A,B)=0 A=B A,B X - DM(A,B)=DM(B,A) A,B X - DM(A,B)+DM(B,C) DM(A,C) A,B,C X The Cty Block (5) and the Eucldean (6) are often used as metrcs for dstance measure n case of crsp values. n = DM = A B, (5) n = ( ) 2 DM = A B, (6) where n s the number of dmensons and s the seral number of the actual dmenson. 2 Non -cut based smlarty measures There are many useful dstance defntons of fuzzy sets n the lterature. The smplest one s the Dsconsstency Measure (S D ) of the fuzzy sets A and B (7) S D ( x) = supµ (7) x X A B A B s the mn t-norm, µ A B (x)=mn{µ A (x), µ B (x) } x X. It s where bascally the same measure as used n the mn-max composton. The dsconsstency measure s one crsp value n range of [0,]. In the followngs, some dstance measures, whch are used for expressng the smlarty of trapezodal shaped fuzzy sets (or fuzzy sets have membershp functons can be traced back to a trapezod form) wll be presented. In case of trapezodal shaped fuzzy sets, the fuzzy set can be charactersed by a vector of four values, by the upper and lower endponts of the core and support e.g. X=[x,x 2,x 3,x ].
4 Ths case the smlarty between sets A and B can be descrbed by the formula (8) proposed by Chen [5]. = a b SM(A,B) = (8) If the unverse of the fuzzy sets are normalzed, then SM(A,B) [0,]. The advantage of (8) s ts smplcty and low computatonal complexty. However, ts drawback s that t can easly lead to the same grade of smlarty n case of dfferent shapes, too. For nstance f the trapezod fuzzy set A=[0.2,0.,0.6,0.8] s compared to the trapezod term B=[0.,0.6,0.8,.0] and to the trangle shaped set C=[0.,0.7,0.7,.0] and to the D=[0.7,0.7,0.7,0.7] crsp value, the smlarty measure s.6 n each case. Chen and Chen proposed a method n [6], whch can be used n case of generalzed trapezod shaped fuzzy sets, too. Ths smlarty measure (9) s based on the calculaton of the Center Of Gravty. a b = = (9) * * max( ya, yb ) ( ) ( ) * * * * C A,B mn( ya, yb ) x x SM(A, B) A B where C(A,B) s defned as follows: x and * A C( A,B) = 0 a a a a + b + b b b > 0 = 0 y are the coordnates of the COG of the set A, respectve * A x and determne the COG of the set B. The dsadvantage of ths method s that t can not handle cases when the examned sets have the same COG, but ther shape s dfferent. The ncreased computatonal complexty can be consdered as an addtonal drawback. * B (0) * y B 3 -cut based smlarty measures 3. Smple dstance measures Most of the dstance defntons are based on the -cuts of the two fuzzy sets, for example:
5 Hausdorff Measure ( ): Hausdorff Measure (*): where HM ( A, B) sup HM( A, B ) 0 = () HM (, B) HM( A B ) *, A = (2) ( U, V ) = max sup nf d( u, v),supnf d( u, v) HM (3) v V and d ( u,v) s the Eucldean dstance. Kaufmann and Gupta Measure ( ): Kaufmann and Gupta Measure (*): where u U u U ( A, B) = sup ( A, B ) 0 v V () ( A, B) = ( A B ) (5) (, B ) *, ( a b + a b ) 2 2 A = (6) 2 ( β2 β) and [a, a 2 ], [b, b 2 ] are the supports of A, B, respectvely [β, β 2 ] s the support of both A and B, [0,]. Both the Hausdorff Measure and Kaufmann and Gupta Measure are a crsp value n range of [0, ]. 3.2 Kóczy s dstance measure The man problem of the dstance defntons presented above s, that the nformaton of the shape of the membershp functon of the fuzzy sets s mostly lost. It s mpossble to reconstruct from a gven fuzzy set A and from a gven Hausdorff or Kaufmann and Gupta dstance measure of two fuzzy sets A and B, the fuzzy set B. Ths type of reconstructon, at least n the one dmensonal case, has a great mportance n rule nterpolaton, because wthout t, from the dstances of the rule consequents and the fuzzy concluson we are lookng for, t s mpossble to reconstruct the shape of the fuzzy concluson.
6 Solvng these dffcultes a useful defnton s ntroduced by Kóczy [7]. Ths dstance s based on the -cuts of the two fuzzy sets too, but the dstance s not aggregated to one crsp value, so from ths knd of dstance and from one of the fuzzy sets the other set can be reconstructed. The dstance of two fuzzy sets s expressed by means of a fuzzy set whch s defned over the nterval [0,]. In the course of calculatons the Eucldean dstances between the end ponts of the -cuts are consdered. These are called lower ( d ) and upper ( (8) (Fg. 2.). d d d U U ) dstances and are calculated by formulas (7) and ( A, B) nf { B } nf { A } ( A, B) sup{ B } sup{ A } = (7) = (8) If the unverse of dscourse s mult-dmensonal, the dstances between nf{a }, nf{b } and sup{a }, sup{b } can be defned n the Mnkowsk sense: d d U w ( ) / w = k w ( d ) / w U A, B k ( A B) = d ( A, B ), ( A B) = ( ), = (9) (20) Fg. 2. Normalsed fuzzy dstance between the fuzzy sets A and B An mportant restrcton for the exstence of the Kóczy Dstance s that all the comparable fuzzy sets should be convex and normal, otherwse some -cuts are not connected or do not exsts at all, whch makes the dstance correspondng to these -cuts meanngless. The only dsadvantage of usng the Kóczy Dstance for nterpolatve fuzzy reasonng s that t s lttle bt dffcult to handle. Vague dstance of ponts n a vague envronment In the case of rule nterpolaton t would be useful such knd of dstance defnton, whch s easy to handle, for example the dstance of two fuzzy sets could be charactersed by one crsp number, and gve the chance of the reconstructon of
7 the membershp functon of a fuzzy set from another set and from ther dstance, at least n the one dmensonal case. These seem to be two contradctory condtons, but they can be satsfed, f we can fnd a way for handlng the dstance of the fuzzy sets and a knd of shape descrpton separately.. Connecton between smlarty of fuzzy sets and vague dstance of ponts n a vague envronment The concept of vague envronment s based on the smlarty or ndstngushablty of the elements. The x and x 2 values n the vague envronment are ε-dstngushable f ther dstance (δ(x,x 2 )) s greater than ε (2). The dstances n vague envronment are weghted dstances. The weghtng factor or functon s called scalng functon (s(x)). = x2 x ( x ) s( x) dx ε x (2) δ s, 2 > For fndng connectons between fuzzy sets and a vague envronment we can ntroduce the membershp functon µ A (x) as a level of smlarty of a to x. The - cuts of the fuzzy set descrbed by membershp functon µ A (x) (23) form the set whch contans the elements that are ( )-ndstngushable from a (Fg. 3.) (22): A δ (a, b) s (22) b ( x) = mn{ δ (a,b),} = mn ( ) s s x dx, a µ (23) Fg. 3. The vague dstance of ponts a and b (δ(a,b)) s bascally the Dsconsstency Measure (2) of the fuzzy sets A and B (where B s a sngleton): S ( x) δ (a, b) sup µ A B = s D = x X f δ(a,b) [0,] (2) Thus dsconsstency measures between member fuzzy sets of a fuzzy partton and a sngleton can be calculated, as vague dstances of ponts n the vague envronment of the fuzzy partton. The man dfference between the
8 dsconsstency measure and the vague dstance s, that the vague dstance s a crsp value n range of [0, ], whle the dsconsstency measure s lmted to [0,]. That s why t s useful n nterpolatve reasonng wth nsuffcent evdence. So f t s possble to descrbe all the fuzzy parttons of the antecedent and consequent unverses of the fuzzy rule-base, and the observaton s a sngleton, one can calculate the dsconsstency measures of the antecedent fuzzy sets of the rule-base and the observaton, and the dsconsstency measures of the consequent fuzzy sets and the consequence (we are lookng for) as vague dstances of ponts..2 Generatng vague envronments from fuzzy parttons The vague envronment s descrbed by ts scalng functon. For generatng a vague envronment we have to fnd an approprate scalng functon, whch descrbes the shapes of all the terms n the fuzzy partton [8]. The method proposed by Klawonn [9], for choosng the scalng functon s(x) (25), gves an exact descrpton of the fuzzy terms after ther reconstructon from the scalng functon. s x) = µ '( x) = dµ dx ( (25) µ Fg.. A fuzzy set and ts scalng functon Z PS PM P X Fg. 5. Scalng functon descrbng all the fuzzy sets A scalng functon always can be found, f there s only one fuzzy set n the fuzzy partton (Fg..). Usually the fuzzy partton contans more than one fuzzy set, so ths method requres some restrctons (26) [9]. µ = f mn{µ (x),µ j }>0 ' ( x) ' ( x),j I (26) µ j
9 Generally the above condton s not fulflled, so the use of an approxmate scalng functon s proposed as a unversal functon descrbng all the fuzzy sets of a fuzzy partton..3 The approxmate scalng functon The approxmate scalng functon s an approxmaton of the orgnal scalng functons descrbng the fuzzy sets separately. The smplest way of generatng ths functon s the lnear nterpolaton. Supposng that the fuzzy sets are trangles, each of them can be charactersed by three values, two constant scalng functons, whch are the scalng factors of the left and the rght slope of the trangle and the value of the core pont (Fg. 6.). Fg. 6. Thus the approxmaton (s(x)) s a pecewse lnear functon (27), whch nterpolates the rght sde scalng factor of the left neghbourng term and the left sde scalng factor of the rght neghbourng term (Fg. 7.). where x s x s x s + + ( ) = + ( x x ) + s x [ x, x ), [, n ] x (27) s the core of the th term of the approxmated fuzzy partton s, s are the left and rght sde scalng factors of the th term n s the number of the terms n the approxmated fuzzy partton Fg. 7. The drawback of the approxmaton presented above s that t can not handle the bg dfferences between neghbourng scalng factors or crsp fuzzy sets correctly.
10 In case of bg dfferences, the bgger scalng factor domnates the smaller one (Fg. 8., 9.). If one of the neghbourng fuzzy set s crsp (ts scalng factor s nfnte), the slope of the lnearly nterpolated scalng functon s nfnte too, so both the fuzzy sets descrbed by ths scalng functon wll be crsp. Fg. 8. s A << s B Fg. 9. nearly nterpolated scalng functon of fuzzy sets shown n Fg. 8., and these sets as the approxmate scalng functon descrbes them (A,B ) As a soluton of ths problem the adopton of a non-lnear nterpolatve functon (28) s suggested [8]. k w ( x + - x +) k w ( x x +) k w ( x + - x +) k w ( x x +) w ( ) + s + s s k w + x + - x + s( x ) = (28) w + < ( ) w s s s k + x + - x + + w = s s (29) + where x [x,x + ), [,n-], s(x) s the approxmate scalng functon, x s the core of the th term of the approxmated fuzzy partton, s, s are the left and rght sde scalng factors of the th trangle shaped term of k n the approxmated fuzzy partton, constant factor of senstvty for neghbourng scalng factor dfferences, s the number of the terms n the approxmated fuzzy partton.
11 The above functon has same useful propertes. If the neghbourng scalng factors are equals, s(x) s lnear. If one of the neghbourng scalng factors (e.g. S ) s and the other one s fnte, n case of x [ x, ) s( ) x + 0 x x x x x and smlarly f s and + s s fnte and x [ x, ) s( x ) x + 0 x x x x + + Fg. 0. and. show some examples for the applcaton of the proposed nonlnear functon. Fg. 0. Approxmate scalng functon generated by the non-lnear functon wth k=, and the orgnal fuzzy partton (A,B) as ths scalng functon descrbes t (A,B ) Fg.. x =0, x 2 =, s, k= s2 5 Conclusons Dstance based smlarty measures of fuzzy sets have a hgh mportance n reasonng methods handlng sparse fuzzy rule bases. The rule antecedents of the
12 sparse fuzzy rule bases are not fully coverng the nput unverse. Therefore the appled smlarty measure has to be able to dstngush the smlarty of nonoverlappng fuzzy sets, too. The dstance based smlarty measures are such a measures. To gve an overvew of the dstance based smlarty measures of fuzzy sets, some of the man exstng concepts are brefly ntroduced n ths paper. 6 eferences [] J. Wllams, N. Steele: Dfference, dstance and smlarty as a bass for fuzzy decson support based on prototypcal decson classes, Fuzzy Sets and Systems 3 (2002) [2] P. Damond, P. Kloeden: Metrc Spaces of Fuzzy Sets: Theory and Applcaton, World Scentfc, Sngapore, 99. [3]. T. Kóczy, K. Hrota: Orderng, dstance and closeness of fuzzy sets, Fuzzy Sets And Systems, 60:28-293, 993. [] W. A. Shuterland: Introducton to metrc and topologcal spaces, Oxford Unversty Press, Oxford, 977. [5] S. M. Chen: New methods for subjectve mental workload assesment and fuzzy rsk analyss, Cybernet, Systems: Internat, 996, J. 27, [6] S. J. Chen, S. M. Chen: Fuzzy rsk analyss based on smlarty measures of generalzed fuzzy numbers, IEEE Trans. Fuzzy Systems,5-56, [7] Kóczy T. ászló, Tkk Domonkos: Fuzzy rendszerek, Typotex, [8] Sz. Kovács,. T. Kóczy.: The use of the concept of vague envronment n approxmate fuzzy reasonng, Tatra Mt. Math. Publ. 2, 77 82, 997. [9] F. Klawonn: Fuzzy sets and vague envronments, Fuzzy Sets and Systems 66:207-22, 99.
Distance based similarity measures of fuzzy sets
Johanyák, Z. C., Dr. Kovác Sz.: Dtance baed mlarty meaure of fuzzy et, SAMI 2005, 3rd Slovakan-Hungaran Jont Sympoum on Appled Machne Intellgence, Herl'any, Slovaka, January 2-22 2005, ISBN 963 75 35 3,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationThe use of the concept of vague environment in approximate fuzzy reasoning
Kovác, Sz., Kóczy,.T.: The ue of the concept of vague envronment n approxmate fuzzy reaonng, Fuzzy Set Theory and pplcaton, Tatra Mountan Mathematcal Publcaton, Mathematcal Inttute Slovak cademy of Scence,
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More information(1) The control processes are too complex to analyze by conventional quantitative techniques.
Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationA new paradigm of fuzzy control point in space curve
MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationA Revised Method for Ranking Generalized Fuzzy Numbers
8th Internatonal Conference on Informaton Fuson Washngton DC - July 6-9 5 evsed Method for ankng Generalzed Fuzzy Numbers Yu uo a Wen Jang b DeYun Zhou c XYun Qn d Jun Zhan e abcde School of Electroncs
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationLecture 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSparse Fuzzy Model Identification Matlab Toolox RuleMaker Toolbox
Johanyák, Z. C.: Sparse Fuzzy Model Identfcaton Matlab Toolbox - RuleMaker Toolbox, IEEE 6th Internatonal Conference on Computatonal Cybernetcs, November 27-29, 2008, Stara Lesná, Slovaka, pp. 69-74. Sparse
More informationBarycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.
Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space
More informationA Fuzzy Image Matching Algorithm with Linguistic Spatial Queries
Fuzzy Matchng lgorthm wth Lngustc Spatal Queres TZUNG-PEI HONG, SZU-PO WNG, TIEN-HIN WNG, EEN-HIN HIEN epartment of Electrcal Engneerng, Natonal Unversty of Kaohsung Insttute of Informaton Management,
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationA METHOD FOR RANKING OF FUZZY NUMBERS USING NEW WEIGHTED DISTANCE
Mathematcal and omputatonal pplcatons, Vol 6, No, pp 359-369, ssocaton for Scentfc Research METHOD FOR RNKING OF FUZZY NUMERS USING NEW WEIGHTED DISTNE T llahvranloo, S bbasbandy, R Sanefard Department
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationBridges and cut-vertices of Intuitionistic Fuzzy Graph Structure
Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationEXTENDED BIC CRITERION FOR MODEL SELECTION
IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7
More informationAll-Pairs Shortest Paths. Approximate All-Pairs shortest paths Approximate distance oracles Spanners and Emulators. Uri Zwick Tel Aviv University
Approxmate All-Pars shortest paths Approxmate dstance oracles Spanners and Emulators Ur Zwck Tel Avv Unversty Summer School on Shortest Paths (PATH05 DIKU, Unversty of Copenhagen All-Pars Shortest Paths
More informationA Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers
62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationA Note on Quasi-coincidence for Fuzzy Points of Fuzzy Topology on the Basis of Reference Function
I.J. Mathematcal Scences and Computng, 2016, 3, 49-57 Publshed Onlne July 2016 n MECS (http://www.mecs-press.net) DOI: 10.5815/jmsc.2016.03.05 Avalable onlne at http://www.mecs-press.net/jmsc A Note on
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationHarmonic Coordinates for Character Articulation PIXAR
Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationSome kinds of fuzzy connected and fuzzy continuous functions
Journal of Babylon Unversty/Pure and Appled Scences/ No(9)/ Vol(): 4 Some knds of fuzzy connected and fuzzy contnuous functons Hanan Al Hussen Deptof Math College of Educaton for Grls Kufa Unversty Hananahussen@uokafaq
More informationA Robust LS-SVM Regression
PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationGenerating Fuzzy Term Sets for Software Project Attributes using and Real Coded Genetic Algorithms
Generatng Fuzzy Ter Sets for Software Proect Attrbutes usng Fuzzy C-Means C and Real Coded Genetc Algorths Al Idr, Ph.D., ENSIAS, Rabat Alan Abran, Ph.D., ETS, Montreal Azeddne Zah, FST, Fes Internatonal
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationMODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS
Int. Journal for Housng Scence, Vol.38, No.1 pp.13-23, 2014 Publshed n the Unted States MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Ádám BUKOVICS Szécheny István Unversty Department of Structural
More informationInternational Journal of Mathematical Archive-3(11), 2012, Available online through ISSN
Internatonal Journal of Mathematcal rchve-(), 0, 477-474 valable onlne through www.jma.nfo ISSN 9 5046 FUZZY CRITICL PTH METHOD (FCPM) BSED ON SNGUNST ND CHEN RNKING METHOD ND CENTROID METHOD Dr. S. Narayanamoorthy*
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationInteractive Rendering of Translucent Objects
Interactve Renderng of Translucent Objects Hendrk Lensch Mchael Goesele Phlppe Bekaert Jan Kautz Marcus Magnor Jochen Lang Hans-Peter Sedel 2003 Presented By: Mark Rubelmann Outlne Motvaton Background
More informationRough Neutrosophic Multisets Relation with Application in Marketing Strategy
Neutrosophc Sets and Systems, Vol. 21, 2018 Unversty of New Mexco 36 Rough Neutrosophc Multsets Relaton wth Applcaton n Marketng Strategy Surana Alas 1, Daud Mohamad 2, and Adbah Shub 3 1 Faculty of Computer
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationA Comparative Study of Fuzzy Classification Methods on Breast Cancer Data *
Comparatve Study of Fuzzy Classfcaton Methods on Breast Cancer Data * Rav. Jan, th. braham School of Computer & Informaton Scence, Unversty of South ustrala, Mawson Lakes Boulevard, Mawson Lakes, S 5095
More informationthe nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an
On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher
More informationON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR. Wu huapeng, Heikki handroos and Juha kilkki
ON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR Wu huapeng, Hekk handroos and Juha klkk Machne Automaton Lab, Lappeenranta Unversty of Technology LPR-5385 Fnland huapeng@lut.f, handroos@lut.f,
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More information