Exponential intuitionistic fuzzy entropy measure based image edge detection.

Size: px
Start display at page:

Download "Exponential intuitionistic fuzzy entropy measure based image edge detection."

Transcription

1 Expoetial ituitioistic fuzzy etropy measure based image edge detectio. Abdulmajeed Alsufyai 1, Hassa Badry M. El-Owy 2 1 Departmet of Computer Sciece, College of Computers ad Iformatio Techology, Taif Uiversity, Taif, KSA; 2 Aswa uiversity, Aswa, Egypt; 2 Departmet of Computer Sciece, Taif Uiversity, Taif, KSA; Abstract. This paper address a ew algorithm for image edge detectio usig expoetial etropy with Attaassov's ituitioistic fuzzy set theory. Attaassov's Ituitioistic fuzzy set takes ito accout the ucertaity i determiig the degree of membership kow as hesitatio degree. A distace measure, called Expoetial Ituitioistic Fuzzy Divergece have bee itroduced. Edge detectio is carried out usig the suggested distace measure. Experimetal results reveal that the proposed method exhibits better performace ad may efficietly be used for the detectio of edges i images. Keywords: Image edge detectio, Attaassov's ituitioistic fuzzy set, expoetial etropy, fuzzy divergece. INTRODUCTION The cocept of fuzzy set proposed by Zadeh [1, 2]. I recet times, may applicatios of this theory ca be foud, such that i sigal ad image processig, patter recogitio, operatio research, artificial itelligece, expert systems, ad robotics [3-7]. I fuzzy set theory, each elemets has a degree of membership μ ragig from zero to oe, where the degree of o-membership γ is just automatically equal to oe mius the degree of membership (γ = 1 μ). The cocept of ituitioistic fuzzy set itroduced by Ataassov [8-11], which is geeralizatio the cocept of fuzzy set. I Ataassov's ituitioistic fuzzy set the degree of omembership is ot always equal to (1 μ), but there may be some hesitatio degree π. The distace measures betwee ituitioistic fuzzy sets itroduced by Szmidt ad Kacpryzk [12, 13], which are geeralizatio of the Euclidea distace ad the Hammig distace. Grzegorzewski [14] proposed Euclidea distace ad Hammig distace usig ituitioistic fuzzy sets based o Hausdorff metric. The similarity measures betwee two ituitioistic fuzzy sets ad its applicatios i patter recogitio suggested by Degfeg ad Chutia [7]. Etropy is a ucertaity measure first itroduced by Shao [15, 16] ito iformatio theory to describe how much iformatio is cotaied i a source govered by a probability law. Pal ad Pal [17] proposed aother measure called expoetial etropy. They idicated to some advatages for cosiderig expoetial etropy over Shao's etropy. I this paper, a ew attempt to use expoetial etropy with the ituitioistic fuzzy set theory to detect edges i gray level images. Due to fuzzy divergece takes ito accout oly the membership degree, a defiitio of distace measure, called Expoetial Ituitioistic Fuzzy Divergece (EIFD), is also itroduced. EIFD takes ito accout the degrees of membership ad o-membership, ad also the hesitatio degree. To describe the applicability of EIFD i practical applicatios, it has bee used i this paper for edge detectio. Experimetal results reveal that the proposed measure exhibits better performace ad may efficietly be used for edge detectio comparig with the previous approaches. The rest of the paper is orgaized as follows. A overview about edge detectio ad its related work is give i the ext sectio. A brief itroductio of expoetial etropy is, fuzzy sets ad Attaassov's ituitioistic fuzzy sets, ad few related distace measures are itroduced i Sectio 3. Sectio 4 cotais the suggested distace measure. Sectio 5 describes the proposed methedology. The experimetal results for edge detectio are displayed ad discussed i Sectio 6. Fially, coclusio is icluded i Sectio 7. RELATED WORK A edge i a image is defied a cotour or boudary where a abrupt chage occurs i some physical aspect such as gray level value of a image [18]. Edge detectio is oe of the most importat tasks i image processig. Especially registratio, segmetatio, idetificatio ad recogitio are based o edge detectio algorithm. May edge detectio methods are available i the literature. Classical edge detectio techiques, such as Sobel, Prewitt ad Cay detectors were based o the cocept of spatial derivative filterig [19, 20], where local gradiet operators are used to detect edges of certai orietatios oly. Derivative filter suffer whe the edges are oisy ad blurred, ad are ot flexible. May fuzzy ad crisp edge detectio methods have bee proposed by researchers [20-26]. Some of the related work i fuzzy set theory is metioed. Alsheawy et al. [20] suggested a edge detectio approach based o fuzzy logic without determiig the threshold value. They segmeted the images ito regios usig 3 3 biary matrix. A fuzzy system mapped a rage of values distict from each other i the matrix to detect the edge. Lopera ad Ilhami [27] used Jese-Shao divergece of gray level histogram obtaied by slidig a double widow over a image for edge detectio. Kha ad Thakur [24] proposed fuzzy logic based edge detectio algorithm for gray scale images. Tao ad Thomso [26] used gradiet approximatios as iput variables. They used two fuzzy sets, small ad large, as liguistic variables ad 16 fuzzy rules from 16 cotour structures were obtaied. Ho ad Ohishi [22] used fuzzy edge detector for edge detectio. They used several fuzzy templates ad the edge detect a image usig a similarity measure. I all fuzzy edge detectio methods, the pixel degree of membership is equal to 1 mius the o-membership degree. However, it does ot represet a 8518

2 eutral of evidece which resulted i the real world there are may iformatio caot be represeted ad processed usig fuzzy set theory. Ituitioistic fuzzy set has bee prove to be highly useful to deal with ucertaity ad vagueess. Recetly, ituitioistic fuzzy set theory was used to improve accuracy i detectio [6, 23, 28-30]. Chaira [28] itroduced ituitioistic fuzzy etropy i objective fuctio of covetioal clusterig algorithm ad applied to medical images. Hu ad Li [23] itroduced a ovel method to detect hardwood leaves edges, which clusters, thresholds, ad the detects edges of hardwood seedligs leaves usig ituitioistic fuzzy set theory. PLIMINARIES I this sectio we preset some basic cocepts related to expoetial etropy, fuzzy set theory ad Attaassov's ituitioistic fuzzy set, also we itroduce some of the related distace measures. Expoetial Etropy. Etropy is a ucertaity measure first itroduced by Shao [15, 16] ito iformatio theory to describe how much iformatio is cotaied i a source govered by a probability law. Let P = {p 1, p 2,, p } be the probability distributio of a discrete source. Therefore, 0 p i 1, i = 1,2,, ad p i = 1, where is the total umber of states ad P is called the etropy of the distributio. The etropy of a discrete source is ofte obtaied from the probability distributio. The Shao Etropy ca be defied as: H(P) = p i l(p i ) (1) This formalism has bee show to be restricted to the domai of validity of the Boltzma Gibbs Shao (BGS) statistics. Geerally, systems that obey BGS statistics are called extesive systems. If we deem that a physical system ca be decomposed ito two statistical idepedet subsystems O ad B, the probability of the composite system is P O+B = P O P B, it has bee verified that the Shao etropy has the extesive property (additive) H(O + B) = H(O) + H(B). It is to be oted from the logarithmic etropic measure (1) that as p i 0, its correspodig self iformatio of this evet, I(p i ) l(p i ) but I(p i 1) l(1) = 0 ad I(p i 0) l(0) is udefied. Pal ad Pal [17] proposed aother measure called expoetial etropy give by E(p) = p i e (1 p i ) 1 (2) Expoetial etropy (2) [31] has some advatages over Shao's etropy, which is widely acclaimed, we fid that the measure of self iformatio of a evet with probability p i is take as l( 1 p i ) = l(p i ), a decreasig fuctio of p i. The same decreasig character alteratively may be maitaied by cosiderig it as a fuctio of 1 p i rather tha of (1/p i ). Also for example, for the uiform probability distributio P = ( 1, 1,., 1 ) expoetial etropy has a fixed upper boud lim H (1, 1,., 1 ) = e 1 which is ot the case for Shao's etropy. Basic Cocept of Attaassov's Ituitioistic fuzzy sets. Defiitio 1:[2] A fuzzy set A i a fiite set X = {x 1, x 2,, x } may be give mathematically as A = {(x, μ A (x)) x X} where the fuctio μ A (x): X [0,1] is the membership fuctio of a elemet x i the fiite set X; μ A (x) [0,1] is the degree of membership of x X. Expoetial etropy for fuzzy set A correspodig to (2) has bee itroduced by Pal ad Pal as: 1 E(A ) ( e 1) [μ A (x i )e 1 μ A (x i ) (1 μ A (x i ))e μ A (x i ) 1] (3) 1 = ( e 1) [1 μ A (x i )e 1 μ A (x i ) (1 μ A (x i ))e μ A (x i ) ] Further, Ataassov [8-11] suggested a geeralizatio of fuzzy sets, called Ituitioistic Fuzzy Sets (IFS). Defiitio 2: [11] A ituitioistic fuzzy set A i a fiite set X = {x 1, x 2,, x } may be mathematically represeted as A = {(x, μ A (x), γ A (x)) x X} where the fuctios μ A (x), γ A (x): X [0,1] are, respectively, the membership degree ad the o-membership degree of a elemet x i a fiite set X with the coditio 0 μ A (x) + γ A (x) 1 Obviously, each fuzzy set A is a particular case of ituitioistic fuzzy set A, ad may be represeted as A = {(x, μ A (x), 1 μ A (x)) x X} I [12, 13] Szmidt ad Kacpryzk stressed the ecessity of takig ito cosideratio a parameter π A (x), kow as the ituitioistic idex of x i A or degree of hesitatio, which appears due to the lack of kowledge durig calculate the distaces betwee two fuzzy sets. Defiitio 3: [9, 32] For each ituitioistic fuzzy set A i a fiite set X, which may be represeted as if A = {(x, μ A (x), γ A (x), π A (x)) x X}, π A (x) = 1 μ A (x) γ A (x), (4) the π A (x) is called the Attaassov's ituitioistic idex (or hesitatio degree) of a elemet x i a fiite set X I real world, the sum of membership ad o-membership values may ot be equal to 1. This is due to the occurrece of ucertaity i defiig the membership fuctio. This ucertaity is amed as hesitatio degree. Therefore the summatio of membership, o-membership, ad hesitatio degree is equal to 1. It is obvious that 0 π A (x) 1, for each x X. I may theoretical ad practical problems, i order to determie the differece betwee two objects, it is ecessary to kow the distace betwee two fuzzy sets. Szmidt ad Kacprzyk [12, 13] preseted some distace measures betwee two Ituitioistic Fuzzy Sets (IFS) A ad B that take ito accout the degree of membership μ, the degree of o- 8519

3 membership γ, ad the hesitatio degree π i X = {x 1, x 2,, x }. EXPONENTIAL INTUITIONISTIC FUZZY ENTROPY DIVERGENCE Assume two ituitioistic fuzzy sets A ad B are expressed as A = {(x, μ A (x), γ A (x), π A (x)) x X} ad B = {(x, μ B (x), γ B (x), π B (x)) x X}, respectively. Let the rage of the membership degree of the two ituitioistic fuzzy sets A ad B may be, respectively, itroduced as {μ A (x), (1 π A (x))} ad {μ B (x), (1 π B (x))} where μ A (x), μ B (x) are the degrees of membership ad π A (x), π B (x) are the degrees of hesitatio i the particular sets, with π A (x) = 1 μ A (x) γ A (x), ad π B (x) = 1 μ B (x) γ B (x). This rage due to the lack of kowledge i determiig the membership values. The proposed distace measure takes ito accout the hesitatio degrees. Fa ad Xie [33] itroduced fuzzy divergece from fuzzy expoetial etropy usig a row-vector. I this paper the divergece cocept of Fa ad Xie is exteded to a image, represeted by a matrix. Let p 1, p 2,, p k 1 be the probability distributio for a image of size M M with K gray-levels, accordig to (2) the expoetial etropy for a image A is K 1 defied as E = p i e 1 p i i=0. Accordig to (3), the expoetial fuzzy etropy of a image A of size M M is defied as [17, 31]: 1 M 1 M 1 H(A) = [μ ( e 1) A(a ij )e 1 μ A(a ij ) + (1 μ A (a ij )) e μ A(a ij ) 1] (5) where = M 2 ad μ A (a ij ) is the membership values of the pixels i the image ad a ij is the (i, j)th pixel of the image A. I order to determie the differece betwee two images A ad B (i.e., at pixels a ij ad b ij ), it is ecessary to kow the amout of iformatio betwee the membership degrees of images A ad B which is give by: Due to the membership values of the (i, j)th pixels of images A ad B (i.e., μ A (a ij ) ad μ B (b ij ) of the (i, j)th pixels, respectively): e μ A(a ij ) μ B (b ij ). Correspodig to the expoetial fuzzy etropy, the expoetial fuzzy etropy divergece betwee images A ad B may be give as D E (A, B) [1 (1 μ A (a ij )) e μ A(a ij ) μ B (b ij ) μ A (a ij )e μ B(b ij ) μ A (a ij ) ] Similarly, the expoetial fuzzy etropy divergece of B agaist A is: D E (B, A) [1 (1 μ B (b ij )) e μ B(b ij ) μ A (a ij ) μ B (b ij )e μ A(a ij ) μ B (b ij ) ] So, the total divergece betwee the pixels a ij ad b ij of the images A ad B is D T = D E (A, B) + D E (B, A) = [ 2 (1 μ A(a ij ) μ B (b ij )) e μ A(a ij) μ B (b ij) (1 μ B (b ij ) μ A (a ij )) e ] μ B(b ij ) μ A (a ij ) Accordig to 1 π A (a ij ) ad 1 π B (b ij ) of the (i, j)th pixels of A ad B, this distace measure take ito accout the hesitatio degrees: e (1 π A(a ij )) e (1 π B(b ij )) or e (π B(b ij ) π A (a ij )) I similar maer, the total Ituitioistic Expoetial Fuzzy Divergece betwee the pixels a ij ad b ij of the images A ad B is: D π [ 2 (1 π B(b ij ) π A (a ij )) e π B(b ij) π A (a ij) (1 π A (a ij ) + π B (b ij )) e ] (7) π A(a ij ) π B (b ij ) Cosequetly, the overall Ituitioistic Expoetial Fuzzy Divergece (IEFD), betwee the images A ad B by addig equatios (6) ad (7), is give by : IEFD(A, B) = 4 (1 μ A (a ij ) + μ B (b ij )) e μ A(a ij ) μ B (b ij ) i j (1 μ B (b ij ) + μ A (a ij )) e μ B(b ij ) μ A (a ij ) (1 π B (b ij ) + π A (a ij )) e π B(b ij ) π A (a ij ) (1 π A (a ij ) + π B (b ij )) e π A(a ij ) π B (b ij) (8) PROPOSED METHODOOLOGY The process of spatial filterig cosists simply of movig a filter mask w of order m from poit to poit i a image. At each poit (i, j), the respose of the filter at that poit is calculated a predefied relatioship. We will use the usual masks for detectio the edges. For this purpose, smallest meaigful size of 8 fuzzy mask templates each of size 3 3, as show i Figure 1. Where the a ad b are template parameters, a, b [0,1], which are chaged with the differet traied parameters. a a a a 0 b 0 b b a a a 0 b a 0 b a 0 b b b b a 0 b a a 0 0 b b a a a 0 a b a b 0 a a a b b b 0 a b a b 0 b b b a b a b 0 Figure 1: Set of eight 3 3 template Move each fuzzy template o the whole biary image ad fid The IEFD measure at each cetral pixel positio (i, j) of the image uder the fuzzy template. IEFD(i, j), is calculated betwee the image widow (same size as the template) ad the template, as give below: IEFD(i, j) = max N (6) [mi (IEFD(A, B))] (9) r where N= umber of templates, r= umber of elemets i the square template. It is oted that, IEFD(i, j) is calculated for all pixel positios of the image. IEFD(A, B), is calculated by determiig the IEFD betwee each of the elemets a ij ad b ij of image widow A ad of template B usig Equatio (8). The IEFD matrix, which has the same size as that of image, is created with values of IEFD(i, j) at each poit of the matrix. This IEFD matrix is thresholded ad thied to get a edge- 8520

4 detected image. The selectio of threshold value is maually curbed for gettig the fial edge-detected result. I our experimet, For the two images A ad B, the membership degree, o-membership degree ad the ituitioistic fuzzy idex (hesitatio degree) of images A ad B are, respectively, give by: The membership degrees μ A (a ij ) are the ormalized values of the (i, j)th pixel of image A, where the image A represets the chose widow i the test image. The membership degrees of the template pixels, μ B (b ij ) are the values of the template, where the image B is the fuzzy template. Due to the ituitioistic characteristics, the membership degrees of images A ad B may take the values i the rage {μ A (x), (1 π A (x))} ad {μ B (x), (1 π B (x))}, respectively. From (4) we kow that γ A (a ij ) = 1 μ A (a ij ) π A (a ij ). So, the o-membership degree= 1 membership degree hesitatio degree. For calculatig the hesitatio degree or ituitioistic fuzzy idex, we have assumed Hesitatio degree = h c (1 membership) (10) where 0 < h c 1 is a hesitatio costat. The value of h c should be such that the (4) holds. The followig Algorithm summarize the proposed techique for carryig out the edge detector. Algorithm : Edge Detectio 1. Iput: A digital grayscale image A of size M N. 2. Create 8 fuzzy templates with values a ad b. 3. Apply the fuzzy templates over the digital image by placig the ceter of each template at each poit (i, j) over the digital grayscale image, 4. Apply equatio (8) to calculate the IEFD betwee each elemets of each template ad the image widow (same size as that of template) ad choose the miimum IEFD value. 5. For all the 8 miimum IEFD values, that determied i step 4. Choose the maximum value betwee them by usig equatio (9). 6. Put the maximum value at the poit where the template was cetered over the image. 7. For all the pixel positios the max mi value has bee determied ad positioed. 8. A ew ituitioistic expoetial divergece matrix (IED- Matrix) has bee formed. 9. Create a biary image ad thi: For all i, j if IED-Matrix(i, j) th the f(i, j) = 0 else f(i, j) = 255, where th is the threshold value. 10. Output: The edge detectio image f of A. RESULTS AND DISCUSSION To demostrate the efficiecy of the proposed approach, the algorithm is tested over a umber of differet Gray scale images ad compared with classical operators. Results with differet combiatio of a ad b are show for each images, but the edge-detected results are ot at all good as show i the Figures 2-6. The best combiatio is a = 0.4, b = 0.6 ad with these values, the edge-detected results are foud better. Also, it is observed that, o decreasig the umber of templates, may edges ca be missig ad whe icreasig the umber of templates, there is o chage i the edge detectio results. Results with differet values of hesitatio costat (hesitatio degree) h c have bee show i Figures 2-6. To demostrate the efficiecy of our proposed algorithm, the proposed approach is tested over a umber of differet grayscale ormally medical images or atural images ad compared with Cay's method [19], Laplacia's method [34] ad wavelet method [35] as show i Figures 6 ad 7. I each of the images i Figures 2-7, th ad h c deote, the threshold value ad the edge template hesitatio costat, respectively. a) "Blood" image. CT scaed Blood image of size cotaiig the gray level is show i Figure 2a. The IEFD matrix has bee thresholded ad the thied. The results with differet values of h c, are show. The results with h c = 0.3 ad h c = 0.4 have bee foud better, as show i Figures 2c ad 2e. The edges are clearly extracted usig our proposed approach, with proper h c, implies that the edge detectio is completely depedet o the choice of h c. Figure 2f, where the edges are ot properly detected, is the result with a = 0.9, b = 0.8. b) "Camerama" image. Camerama image of size is show i Figure 3a. The result of edge detectio with varyig values of h c are show. Better results are obtaied i Figures 3b ad 3c. a) Origial image d) a=0.4, b=0.6, hc=0.2, th=0.11 b) a=0.2, b=0.7, e) a=0.2, b=0.7, hc=0.4, th=0.15 c) a=0.9, b=0.5, hc=0.3, th=0.10 f) a=0.9, b=0.8, hc=0.3, th=0.12 Figure 2: The results of the edge detectio for blood image usig IEFD a) Origial image d) a=0.5, b=0.3, hc=0.6, th=0.13 b) a=0.6, b=0.4, e) a=0.8, b=0.5, hc=0.2, th=0.1 c) a=0.8, b=0.4, hc=0.5, th=0.12 f) a=0.9, b=0.8, hc=0.4, th=0.11 Figure 3: The results of the edge detectio for Camerama image usig IEFD 8521

5 a) Origial image b) a=0.75, b=0.35, hc=0.5, th=0.12 c) a=0.8, b=0.4, CONCLUSION I this paper, the ucovetioality lies i usig Attaassov's ituitioistic fuzzy set theory i image edge detectio. A ew distace measure, called expoetial ituitioistic fuzzy divergece has bee itroduced. Edge detectio was carried out by usig the suggested distace measure. The result of edge detectio is completely depedet o the selectio of hesitatio costat ad thus be the hesitatio degree. The domiat edges is clearly detected by usig the proposed method, whereas removig the uwated edges. d) a=0.7, b=0.7, hc=0.4, th=0.13 e) a=0.7, b=0.65, hc=0.4, th=0.11 f) a=0.9, b=0.8, hc=0.5, th=0.10 Figure 4: The results of the edge detectio for Brai image usig IEFD c) "Brai" image of size is show i Figure 4a. Edge-detected results with varyig values of h c are show. Figures 4b ad 4c give a better result. Figure 4f, where the edges are ot properly detected, is the result with differet values of a = 0.9, b = 0.8. d) "MRI" image is of size is show i Figure 5a. The edge detectio results with differet values of h c are show i Figures 5b-5f. But the result i Figure 5b is better. The results with a = 0.4, b = 0.65 is show i Figure 5f, where the edges are ot properly detected. For compariso with other methods, two results are show. e) "Lea" image is of size is show i Figure 6a. The results of our approach have bee compared with a Cay's method, Laplacia's method ad wavelet method. The edge detectio results with differet values of hesitatio costats, h c, are show i Figures 6b ad 6c. I Figure 6b, with h c = 0.5, better result is obtaied. Figure 6d is the result usig Wavelet method. Figure 6e is the result usig Cay's method. Figure 6f is the result usig Laplacia's method f) "Rice" image is of size is show i Figure 7a. Figure 7b-7d are the result usig proposed approach with h c = 0.4. Figure 7e is the result usig Cay's method. Figure 7f is the result usig Laplacia's method. a) Origial image b) a=0.7, b=0.4, hc=0.5, th=0.1 c) a=0.4, b=0.6, d) Wavelet method e) Cay's method f) Laplacia method Figure 6: The results of the edge detectio for Lea image usig IEFD ad other methods a) Origial image d) a=0.8, b=0.8, hc=0.4, th=0.1 b) a=0.9, b=0.8, hc=0.4, th=0.1 c) a=0.2, b=0.5, hc=0.4, th=0.1 e) Cay's method f) Laplacia method Figure 7: The results of the edge detectio for Seeds image usig IEFD ad other methods. a) Origial image b) a=0.2, b=0.8, c) a=0.3, b=0.7, hc=0.5, th=0.10 REFERENCES [1]. Zadeh, L. A., (1965). "Fuzzy Sets". Iformatio ad Cotrol, 8(3), pp [2]. Zadeh, L. A. (1975). "Cocept of a liguistic variable ad its applicatio to approximate reasoig-i". Iformatio Scieces, 8(3), pp [3]. Ataassov, K. T. (1989). "More o Ituitioistic fuzzy set". Fuzzy sets ad systems. 33(1), pp d) a=0.8, b=0.4, hc=0.5, th=0.11 e) a=0.7, b=0.5, f) a=0.4, b=0.65, Figure 5: The results of the edge detectio for MRI image usig IEFD [4]. Bustice, H., ad Burillo P. (1996). "Vague sets are ituitioistic fuzzy sets". Fuzzy sets ad systems. 79(3), pp

6 [5]. Chaira, T. ad Ray, A. K. (2003). "Segmetatio usig fuzzy divergece". Patter Recogitio Letters. 24(12), pp [6]. Chaira, T. ad Ray, A. K. (2008). "A ew measure usig ituitioistic fuzzy set theory ad its applicatio to edge detectio". Applied Soft Computig. 8(2), pp [7]. Degfeg, L. ad Chutia, C. (2002). "New similarity measures of ituitioistic fuzzy sets ad applicatio to patter recogitio". Patter Recogitio Letters. 23(1-3), pp [8]. Ataassov, K. T. (1986). "Ituitioistic fuzzy set". Fuzzy sets ad systems. 20(1), pp [9]. Ataassov, K. T. (1994). "Operators over iterval valued ituitioistic fuzzy sets". Fuzzy sets ad systems. 64(2), pp [10]. Ataassov, K. T. (1994). "New operatios defied over the ituitioistic fuzzy sets". Fuzzy sets ad systems. 61(2), pp [11]. Ataassov, K. T. (1999). "Ituitioistic Fuzzy Sets: Theory ad Applicatios". Physica-Verlag, Heidelberg/ New York. ISBN: (prit), pp [12]. Szmidt, E. ad Kacprzyk, J. (2000). "Distace betwee ituitioistic fuzzy set". Fuzzy sets ad systems. 114(3), pp [13]. Szmidt, E. ad Kacprzyk, J. (2001). "Etropy for ituitioistic fuzzy set". Fuzzy sets ad systems. 118(3), pp [14]. Grzegorzewski, P. (2004). Distaces betwee ituitioistic fuzzy sets ad/or iterval-valued fuzzy sets based o Hausdorff metric". Fuzzy sets ad systems. 148(2), pp [15]. Shao, C. E. (1948). "A mathematical Theory of Commuicatio". The Bell System Techical Joural. 27(4), pp [16]. Ladsberg, P. T. ad Vedral, V. (1998). "Distributios ad chael capacities i geeralized statistical mechaics". Physics Letters A. 247(3), pp [17]. Pal, N. R. ad Pal, S. K. (1989). "Object backgroud segmetatio usig ew defiitios of etropy". I: IEEE Proceedigs o Computers ad Digital Techiques. 136(4), pp [18]. Gozalez, R. C. ad Woods, R. E. (2008). "Digital Image Processig". Secod editio, Pretice Hall, New Jersey. ISBN: [19]. Cay, J. (1986). "Computatioal approach to edge detectio". IEEE Trasactio o Patter Aalysis ad Machie Itelligece. PAMI-8(6), pp [20]. Alsheawy, A. ad Aly, A. A. (2009). "Edge Detectio i Digital Images Usig Fuzzy Logic Techique". World Academy of Sciece, Egieerig ad Techology. 51, pp [21]. Barkhoda, W., Akhlaqia, F. ad Shahryari, O. (2009). "Fuzzy Edge Detectio Based o Pixel's Gradiet ad Stadard Deviatio Values". I: Proceedigs of the Iteratioal Multi-coferece Computer Sciece ad Iformatio Techology, IMCSIT09, Oct., Mragowo, Polad, pp.7-10 [22]. Ho, K.H.L. ad Ohishi, N. (1997). "FEDGE Fuzzy edge detectio by Fuzzy Categorizatio ad Classificatio of edges". Lecture Notes i Computer Sciece. 1188, (Editors: Trevor P. Marti ad Aca L. Ralescu), Spriger, Berli Heidelberg pp [23]. Hu, C. ad Li, P. (2013). "Edge Detectio for Hardwood seedligs Leaves Based o Ituitioistic Fuzzy Set". Iteratioal Coferece o iformatio techology ad applicatios(ita), Nov., Chegdu, pp [24]. kha, A. R. ad Thakur, K. (2012). "A Efficiet Fuzzy Logic Based Edge Detectio Algorithm for Gray Scale Image". Iteratioal Joural of Emergig Techology ad Advaced Egieerig. 2(8), [25]. Kuo, Y., Lee, C., ad Liu, C. (1997). "A ew Fuzzy Edge Detectio Method for image Ehacemet". I: Proceedigs of the Sixth IEEE Iteratioal Coferece o Fuzzy Systems, 1-5 Jul., Barceloa pp [26]. Tao, T. W. ad Thomso, W. E. (1993). "A fuzzy IF- THEN approach to edge detectio". I: Proceedigs of the Secod IEEE Iteratioal Coferece o Fuzzy Systems, Vol. 2, 28 March-01 April, Sa Fracisco, CA, USA, pp [27]. Lopera, J. G., ad Ilhami, N. etl. (1999). "Improved etropic edge detectio". I: Proceedigs of the 10th iteratioal Coferece of Image Aalysis ad Processig, Sep., Veice Italy, pp [28]. Chaira, T. (2012). "A rak ordered filter for medical image edge ehacemet ad detectio usig ituitioistic fuzzy set". Applied Soft Computig. 12(4), pp [29]. Aas, E. (2016). "Edge detectio techiques usig fuzzy logic". 3rd Iteratioal Coferece o Sigal Processig ad Itegrated Networks (SPIN) Feb. 2016, Noida, Idia. [30]. Asari, M.D., Mishra, A.R. ad Asari. (2017). "New Divergece ad Etropy Measures for Ituitioistic Fuzzy Sets o Edge Detectio". Iteratioal Joural of Fuzzy Systems. pp [31]. Verma, R. ad Sharma, B. D. (2013). "Expoetial Etropy o Ituitioistic Fuzzy Sets". Kyberetika. 49(1), pp [32]. Wag, G. ad He, Y. (2000). "Ituitioistic fuzzy sets ad L-fuzzy sets". Fuzzy Sets Systems. 110(2), pp [33]. Fa, J. ad Xie, W. (1999). "Distace measure ad iduced fuzzy etropy". Fuzzy Sets Systems. 104(2), pp

7 [34]. Colema, S., Scotey, B., ad Sugatha, S. (2010). "Edge detectig for rage data usig Laplacia operators". IEEE Trasactios o Image Processig. 19(11), pp [35]. Deg, C., Bai, T. ad Geg, Y. (2009). "Image edge detectio based o wavelet trasform ad cay operator". I: Proceedigs of the Iteratioal Coferece o Wavelet Aalysis ad Patter Recogitio, July, Baodig, Chia, pp

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New 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 information

Image Segmentation EEE 508

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

More information

New HSL Distance Based Colour Clustering Algorithm

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

More information

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

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

More information

3D Model Retrieval Method Based on Sample Prediction

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

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

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

More information

Improving Template Based Spike Detection

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

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro 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 information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

Ones Assignment Method for Solving Traveling Salesman Problem

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

More information

Cubic Polynomial Curves with a Shape Parameter

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

More information

Performance Plus Software Parameter Definitions

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

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

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

More information

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

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

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving 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 information

Chapter 3 Classification of FFT Processor Algorithms

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

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN 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 information

are two specific neighboring points, F( x, y)

are 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 information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

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

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

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

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms 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 information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning 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 information

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

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

More information

Accuracy Improvement in Camera Calibration

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

More information

Handwriting Stroke Extraction Using a New XYTC Transform

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

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.

More information

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

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

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris 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 information

The isoperimetric problem on the hypercube

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

More information

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

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

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship 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 information

Fuzzy Linear Regression Analysis

Fuzzy Linear Regression Analysis 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical

More information

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

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

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

BASED ON ITERATIVE ERROR-CORRECTION

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

More information

New Results on Energy of Graphs of Small Order

New 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 information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement 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 information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

Application of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images

Application of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images 66 Applicatio of Decisio Tree ad Support Vector Machie for Ispectig Bubble Defects o LED Sealig Glue Images * Chua-Yu Chag ad Yi-Feg Li Abstract Bubble defect ispectio is a importat step i light-emittig

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

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

More information

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE

RESEARCH 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 information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 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 information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Research Article Intuitionistic Fuzzy Time Series Forecasting Model Based on Intuitionistic Fuzzy Reasoning

Research Article Intuitionistic Fuzzy Time Series Forecasting Model Based on Intuitionistic Fuzzy Reasoning Mathematical Problems i Egieerig Volume 2016, Article ID 5035160, 12 pages http://dx.doi.org/10.1155/2016/5035160 Research Article Ituitioistic Fuzzy Time Series Forecastig Model Based o Ituitioistic Fuzzy

More information

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

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

More information

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

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

More information

Study on effective detection method for specific data of large database LI Jin-feng

Study on effective detection method for specific data of large database LI Jin-feng Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog

More information

Lip Contour Extraction Based on Support Vector Machine

Lip Contour Extraction Based on Support Vector Machine Lip Cotour Extractio Based o Support Vector Machie Author Pa, Xiaosheg, Kog, Jiagpig, Liew, Ala Wee-Chug Published 008 Coferece Title CISP 008 : Proceedigs, First Iteratioal Cogress o Image ad Sigal Processig

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

More information

ANN WHICH COVERS MLP AND RBF

ANN 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 information

A Comparative Study of Color Edge Detection Techniques

A Comparative Study of Color Edge Detection Techniques CS31A WINTER-1314 PROJECT REPORT 1 A Comparative Study of Color Edge Detectio Techiques Masood Shaikh, Departmet of Electrical Egieerig, Staford Uiversity Abstract Edge detectio has attracted the attetio

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Primitive polynomials selection method for pseudo-random number generator

Primitive polynomials selection method for pseudo-random number generator Joural of hysics: Coferece Series AER OEN ACCESS rimitive polyomials selectio method for pseudo-radom umber geerator To cite this article: I V Aiki ad Kh Alajjar 08 J. hys.: Cof. Ser. 944 0003 View the

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Fast Fourier Transform (FFT) Algorithms

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

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

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

More information

Hand Gesture Recognition for Human-Machine Interaction

Hand Gesture Recognition for Human-Machine Interaction Had Gesture Recogitio for Huma-Machie Iteractio Elea Sáchez-Nielse Departmet of Statistic, O.R. ad Computer Sciece, Uiversity of La Lagua Edificio de Física y Matemáticas 38271, La Lagua, Spai eielse@ull.es

More information

Image based Cats and Possums Identification for Intelligent Trapping Systems

Image based Cats and Possums Identification for Intelligent Trapping Systems Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School

More information

We are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1%

We are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1% We are ItechOpe, the first ative scietific publisher of Ope Access books 3,350 108,000 1.7 M Ope access books available Iteratioal authors ad editors Dowloads Our authors are amog the 151 Coutries delivered

More information

USING PHASE AND MAGNITUDE INFORMATION OF THE COMPLEX DIRECTIONAL FILTER BANK FOR TEXTURE SEGMENTATION

USING PHASE AND MAGNITUDE INFORMATION OF THE COMPLEX DIRECTIONAL FILTER BANK FOR TEXTURE SEGMENTATION 6th Europea Sigal Processig Coferece EUSIPCO 008, Lausae, Switzerlad, August 5-9, 008, copyright by EURASIP USING PASE AND MAGNITUDE INFORMATION OF TE COMPLEX DIRECTIONAL FILTER BANK FOR TEXTURE SEGMENTATION

More information

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

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

More information

Classification of binary vectors by using DSC distance to minimize stochastic complexity

Classification of binary vectors by using DSC distance to minimize stochastic complexity Patter Recogitio Letters 24 (2003) 65 73 www.elsevier.com/locate/patrec Classificatio of biary vectors by usig DSC distace to miimize stochastic complexity Pasi Fr ati *, Matao Xu, Ismo K arkk aie Departmet

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic 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 information

A Note on Least-norm Solution of Global WireWarping

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

More information

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

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

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

More information

Analysis of Algorithms

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

More information

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity.

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity. 7 IEEE. Persoal use of this material is permitted. Permissio from IEEE must be obtaied for all other uses, i ay curret or future media, icludig repritig/republishig this material for advertisig or promotioal

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Data Structures and Algorithms. Analysis of Algorithms

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

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

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

More information

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

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

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

Automated Extraction of Urban Trees from Mobile LiDAR Point Clouds

Automated Extraction of Urban Trees from Mobile LiDAR Point Clouds Automated Extractio of Urba Trees from Mobile LiDAR Poit Clouds Fa W. a, Cheglu W. a*, ad Joatha L. ab a Fujia Key Laboratory of Sesig ad Computig for Smart City ad the School of Iformatio Sciece ad Egieerig,

More information

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:

More information

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

arxiv: v2 [cs.ds] 24 Mar 2018

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

More information

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

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

More information

Algorithms Chapter 3 Growth of Functions

Algorithms 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 information

Web Text Feature Extraction with Particle Swarm Optimization

Web Text Feature Extraction with Particle Swarm Optimization 32 IJCSNS Iteratioal Joural of Computer Sciece ad Network Security, VOL.7 No.6, Jue 2007 Web Text Feature Extractio with Particle Swarm Optimizatio Sog Liagtu,, Zhag Xiaomig Istitute of Itelliget Machies,

More information

Performance Comparisons of PSO based Clustering

Performance Comparisons of PSO based Clustering Performace Comparisos of PSO based Clusterig Suresh Chadra Satapathy, 2 Guaidhi Pradha, 3 Sabyasachi Pattai, 4 JVR Murthy, 5 PVGD Prasad Reddy Ail Neeruoda Istitute of Techology ad Scieces, Sagivalas,Vishaapatam

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis 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 information

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

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

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

An Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram

An Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram http://dx.doi.org/10.5755/j01.eee.0.4.6888 ELEKTROIKA IR ELEKTROTECHIKA ISS 139 115 VOL. 0 O. 4 014 A Image Retrieval Method Based o Hu Ivariat Momet ad Improved Aular Histogram F. Xiag 1 H. Yog 1 S. Dada

More information

Texture Image Segmentation Using Without Re-initialization Geodesic Active Contour Model

Texture Image Segmentation Using Without Re-initialization Geodesic Active Contour Model Texture Image Segmetatio Usig Without Re-iitializatio Geodesic Active Cotour Model Kaibi Wag Biazhag Yu Departmet of Electroic ad Iformatio Egieerig, Northwester Polytechical Uiversity, Xi a 71007, Shaaxi

More information