VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING

Size: px
Start display at page:

Download "VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING"

Transcription

1 VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING Yasufumi Suzuki ad Tadashi Shibata Departmet of Frotier Iformatics, School of Frotier Scieces, The Uiversity of Tokyo 701 Kiba Bldg Kashiwaoha, Kashiwa, Chiba, , Japa ABSTRACT Directioal edge-based image feature represetatios have already bee developed ad applied to medical radiograph aalysis, face detectio, ad face idetificatio. The scheme of the feature-vector geeratio is cosidered as a dimesioality reductio from a high-dimesio edge feature map space to a low-dimesio edge histogram space. However, the validity of such schemes i dimesioality reductio has ot yet bee studied o the soud basis of statistics. I this paper, i order to validate the directioal edge-based feature represetatios, the scheme of dimesioality reductio employig the hierarchical clusterig based o the spatial correlatios of edges has bee ivestigated. I this study, the feature represetatios of images have bee evaluated usig facial images as the test vehicle. As a result, the validity of usig the directioal edge-based feature vectors i image recogitio has bee verified by the similarity betwee the results of the hierarchical clusterig ad the schemes employed i the feature represetatios. 1. INTRODUCTION The developmet of robust image recogitio systems is quite essetial i a variety of applicatios such as itelliget huma-computer iterfaces, security systems, ad so forth. For huma-like robust image perceptio, a image feature represetatio which extracts oly essetial features from images ad represets them i a vector format is of critical importace. A umber of feature represetatios have bee developed so far. I the visual cortex of aimals, it is kow that directioal edge iformatio i visual iputs plays a essetial role i early visual processig. Namely, biological systems rely o the spatial relatioship amog edges i various directios for image perceptio. Beig ispired by such a biological priciple, a directioal edge-based feature represetatio called Projected Pricipal-Edge Distributio (PPED for short) [1] has bee developed ad has bee successfully applied to had-writte patter recogitio ad medical radiograph aalysis [2, 3]. It has also bee applied successfully to the face detectio system [4] i cojuctio with aother directioal edge-based feature represetatio called Averaged Pricipal-Edge Distributio (APED for short) [5]. I additio, APED-like feature represetatios have bee applied to face idetificatio [6]. Both PPED ad APED feature vectors are geerated from the spatial distributios of the four directioal edges (horizotal, +45, vertical, ad 45 ). Sice the amout of data i the directioal edge maps is massive, the dimesioality reductio is carried out by producig the spatial distributio histograms from the four directioal edge maps. The feature-vector-geeratio schemes i PPED ad APED are compatible with the dedicated feature-extractio VLSI chip [7], makig the feature represetatio algorithms compatible to buildig real-time respodig systems. However, the schemes of dimesioality reductio i PPED ad APED have ot yet bee supported by statistical aalysis. The pricipal compoets aalysis (PCA) is ofte used for the dimesioality reductio of feature represetatios. The PCA calculates the orthogoal liear trasformatio which maximizes the variaces amog feature vectors. Such a liear trasformatio is derived from the eigevectors of the spatial correlatios i the image data. Although the PCA achieves the dimesioality reductio efficietly preservig the characteristics of images, the liear trasformatio of the PCA is ot suitable for direct hardware implemetatios due to the computatioal cost. The purpose of this paper to validate the directioal edgebased feature represetatios by the statistical aalysis. The dimesioality reductio i both PPED ad APED vector represetatios is carried out by takig the spatial histograms employig their ow partitios of the directioal edge maps. The dedicated VLSI chip has already bee developed [7] which is compatible to ay types of edge-histogram geeratio. Therefore, it is crucial to fid how to divide the directioal edge maps for geeratig histograms i order to maximize the performace i image classificatio. I this work, as like i the PCA, it is cosidered to maximize the variace amog feature vectors. For each directioal edge map, groupig the pixel sites havig the high correlatios together ito the same elemet of the feature vector icreases the variace as described i Sectio 3. I order to determie such partitios, the techique of hierarchical clusterig based o the spatial correlatio of the directioal edges has bee itroduced. I this work, the evaluatio has bee carried out usig a set of frotal facial images as a test vehicle. The results of the hierarchical clusterig are similar to the partitio employed i PPED or APED vector-geeratio scheme, thus validatig the directioal edge-based feature represetatios. 2. DIRECTIONAL EDGE-BASED FEATURE REPRESENTATIONS This sectio describes the directioal edge-based feature represetatios utilized for the face detectio system i the previous works [4, 5]. Firstly, the directioal edge-based feature maps which represet the distributio of four directioal edges are geerated. The, the 64-dimesio feature vectors are formed by takig the spatial histograms of the directioal 2007 EURASIP 1940

2 Horizotal +45-degree Vertical -45-degree Iput image Horizotal +45-degree Vertical -45-degree Figure 1: Directioal edge-based feature maps geerated from bright ad dark facial images. edge-based feature maps. 2.1 Directioal Edge-Based Feature Maps The first step i formig feature vectors is the geeratio of four feature maps i which edges are extracted from a pixel iput image i four directios. Figure 1 shows the relatioship betwee a iput image ad four feature maps. Each feature map represets the distributio of edge flags correspodig to oe of the four directios, i.e. horizotal, +45, vertical, ad 45. I the feature maps, each black pixel which we call a edge flag represets the locatio where a edge is idetified i the correspodig directio. These four directioal edge-based feature maps are regarded as represetig the most fudametal features extracted from the origial image. The procedure of feature-map geeratio is as i the followig. The iput image is firstly subjected to pixel-by-pixel spatial filterig operatios usig kerels of 5 5-pixel size. The kerel which gives the maximum value determies the directio of the edge at the pixel site. I order to retai oly edges of sigificace i feature maps, thresholdig operatio is itroduced. The threshold value is determied by takig the local variace of lumiace data ito accout. The itesity differeces betwee two eighborig pixels i the horizotal ad vertical directios i a 5 5-pixel block are obtaied ad the media of the 40 values of them is utilized as the threshold value for edge idetificatio. Thaks to such a thresholdig operatio, essetial edges represetig facial features are well extracted from both bright ad dark facial images as show i Fig. 1, thus makig directioal edge-based represetatios robust agaist illumiatio coditios. Details of the directioal edge-based feature maps are give i [1]. I the followig discussio, for each directio d H,P,V,M}, the directioal edge map is expressed as F d (x,y) 0,1}, where the directioal edge exists at the locatio (x,y) if F d (x,y) = 1. Here, H, P, V, ad M represet horizotal, +45, vertical, ad 45, respectively. 2.2 Directioal Edge-Based Feature Represetatios Although the directioal edge-based feature maps retai essetial feature iformatio i the origial image, the amout of data is still massive ad dimesioality reductio is essetial for efficiet processig of classificatio. Figure 2 illustrates the procedure of feature-vector geeratio i the Projected Pricipal-Edge Distributio (PPED) [1]. The feature vector i PPED is formed by projectig the feature maps alog the directio of the edges. I the horizotal edge map, for example, edge flags i every four rows are accumulated, Figure 2: Partitios of feature maps for vector geeratio based o projected pricipal-edge distributio (PPED). Horizotal +45-degree Vertical -45-degree Figure 3: Partitios of feature maps for vector geeratio based o averaged pricipal-edge distributio (APED). ad a spatial distributio of edge flags is represeted by a histogram. Similar procedures are applied to other three directios. Fially, a 64-dimesio vector is formed by cocateatig the four histograms. I the PPED feature represetatio, the iformatio of edge distributio alog the directio idetical to the directioal edge (e.g. the horizotal distributio of horizotal edge flags) is lost durig the accumulatio. I order to complemet such loss i PPED vectors, aother feature-vector geeratio scheme has bee developed [5]. I the Averaged Pricipal-Edge Distributio scheme (which was origially amed Cell Edge Distributio i [5]), every feature map is divided ito 4 4 cells each of which cotais -pixel sites as show i Fig. 3. The umber of edge flags i each cell is couted ad the umber costitute a sigle elemet i the vector represetatio by the APED scheme. A 64- dimesio feature vector i the APED scheme is obtaied by cocateatig these four vectors. 3. SPATIAL CORRELATION-BASED CLUSTERING The process of the feature-vector geeratio is cosidered as a dimesioality reductio i the space of four directioal edge maps oto the lower-dimesio spaces. I the feature-vector-geeratio schemes, each directioal edgebased pixel feature map of F H, F P, F V, or F M is divided ito groups as show i Figs. 2 ad 3. The umber of directioal edge flags withi each group is couted ad costitutes a sigle elemet i the feature vector, thus makig a -dimesioal feature vector. The dedicated VLSI chip [7] is capable of geeratig feature vectors usig such a scheme with ay form of feature-map partitios. Therefore, i the preset study, it is cosidered that how the feature maps should be divided for maximizig the variace amog the feature vectors geerated from facial images. I the fol EURASIP 1941

3 lowig discussio, pixel two dimesioal image data of a feature map are treated as a 4096-dimesio biary vector. Namely, each feature map F d (d H,P,V,M}) is coverted to a 4096-dimesio vector E d (i) which is expressed as E d (x + 64y) = F d (x,y), (1) where x = 0,1,2,...,63 ad y = 0,1,2,...,63. For each directio d H,P,V,M}, the partitio P d (i) of the feature map E d (i) is give as P d (i) j j N,1 j }, where i = 0,1,2,...,. This meas that the pixel site correspodig to the feature map E d (i) belogs to the P d (i)-th elemet i the feature vector. A mask fuctio M d (i, j) is defied from P d (i) as 1, if Pd (i) = j M d (i, j) = 0, otherwise, where i = 0,1,2,..., ad j = 1,2,3,...,. Note that the mask fuctio M d (i, j) satisfies the followig equatio: M d (i, j) = M d (i, j)} 2 = 1. (2) From the directioal edge map E d (i) defied i Eq. (1), a - dimesioal feature vector V d is geerated usig the mask fuctio M d as V d ( j) = M d (i, j)e d (i), (3) where j = 1,2,3,...,. Whe sample images are give, the mea E d (i) ad the variace Var(E d (i)) of the directioal edge-based feature maps E d (i) are obtaied as E d (i) = 1 Var(E d (i)) = 1 Ed k (i), (4) E k d (i) } 2 E d (i)} 2, (5) respectively, where Ed k (i) is the edge map of the directio d obtaied from the k-th face sample. The covariace C d (i, j) betwee two differet pixel sites E d (i) ad E d ( j) i the feature map is also obtaied as follows: C d (i, j) = 1 E k d (i)ek d ( j) E d(i) E d ( j). (6) The feature vector V d ( j) is geerated from the directioal edge map E d (i) usig Eq. (3). The mea V d ( j) ad the variace Var(V d ( j)) of the j-th elemet i the feature vector V d are expressed as V d ( j) = 1 Var(V d ( j)) = 1 Vd k ( j), (7) V k d ( j) } 2 V d ( j)} 2, (8) respectively, where Vd k ( j) is the j-th elemet i the feature vector i the directio d geerated from the k-th sample. From Eqs. (3), (4), ad (7), the values of Vd k( j)}2 ad 2 V d ( j)} are obtaied as V k d ( j) } 2 = 2 V d ( j) + M d (l, j)e k d (l)m d(m, j)e k d (m) M d (i, j)e k d (i) } 2, (9) } 2 = M d (i, j)e d (i) = 2 + } 2 M d (l, j)e d (l)m d (m, j)e d (m) M d (i, j)e d (i)} 2, (10) respectively. The value of Var(V d ( j)) is simplified usig Eqs. (5), (6), (8), (9), ad (10) as Var(V d (J)) = 2 M d (i, j)} Var(Ed (i)) + 2 M d (l, j)m d (m, j)c d (l,m).(11) Here, we cosider the summatio of variaces of featurevector elemets W d which is give as W d = Var(V d ( j)). From Eqs. (2) ad (11), W d is expressed as i the followig: W d = 2 + M d (l, j)m d (m, j)c d (l,m) Var(E d ( j)). (12) I Eq. (12), sice Var(E d ( j)) is a costat idepedet of the mask fuctio M d (i, j), maximizig W d is equivalet to maximize α d defied as α d = l= M d (l, j)m d (m, j)c d (l,m). (13) α d i Eq. (13) meas the summatio of all covariaces betwee ay pair of pixels which belog to the same elemet i the feature vector. I order to determie the divisio of four feature maps which maximizes the sum of variaces of feature-vector elemets (this is idetical to maximizig the value of α d ), the hierarchical clusterig techique has bee itroduced. All sites withi pixel widow are divided ito clusters usig the agglomerative hierarchical clusterig algorithm [8] where the covariaces betwee differet pixel sites are utilized as the dissimilarity measure EURASIP 1942

4 Horizotal +45-degree Vertical -45-degree Horizotal +45-degree Vertical -45-degree Complete likage Figure 4: Mea images of directioal edge-based feature maps geerated from 900 frotal facial images. Average likage Wd Summatio of variaces of vector elemets 1.6e+4 1.4e+4 1.2e+4 1.0e+4 8.0e+3 6.0e+3 4.0e+3 2.0e+3 0.0e+0 Horizotal +45-degree Vertical -45-degree Feature map PPED APED Feature represetatio Figure 5: Summatio of variaces of all feature-vector elemets for PPED ad APED. 4. EXPERIMENTAL RESULTS AND DISCUSSION I order to evaluate the variaces of feature-vector elemets i PPED ad APED, a statistical aalysis has bee doe as i the followig. I this work, 900 frotal face samples (100%, 80%, ad 60% scaled faces) from HOIP face database [11] were utilized for the evaluatio. For each of facial images, the directioal edge-based feature vector was geerated. The mea images E d (i) of 900 directioal edge-based feature maps are preseted i Fig. 4. The, for each directio (horizotal (H), +45-degree (P), vertical (V ), ad -45-degree (M)), the value of W d (d H,P,V,M}) which is the summatio of the variaces of feature-vector elemets was calculated. The values of W d i PPED ad APED are show i Fig. 5. I Fig. 5, the values of feature map represet the summatio of variaces of all pixel sites i the feature map, ad are equivalet to the value Var(E d( j)) i Eq. (12). The differece betwee the value of PPED ad that of feature map idicates the icremet of variaces α d caused by the dimesioality reductio durig the PPED-vector geeratio. The hierarchical clusterig was carried out o the covariace matrices derived from the 900 frotal face samples to determie the partitios of edge maps maximizig the variace. Figure 6 demostrates the results of hierarchical clusterig employig the complete likage algorithm [9] ad the average likage algorithm [10]. The clusterig result by the complete likage algorithm, which has the tedecy of makig clusters compact, shows that the eighborig pixel sites alog the directio of edge flags (e.g. horizotal eighborig sites of horizotal edge flags) are likely to be classified ito the same cluster. Such clusterig is very similar to the feature Figure 6: Results of agglomerative hierarchical clusterig of all pixel sites i directioal edge-based feature maps. Each feature map is divided ito clusters which are idicated by differet colors. Wd Summatio of variaces of vector elemets 8e+4 7e+4 6e+4 5e+4 4e+4 3e+4 2e+4 1e+4 0e+0 Horizotal +45-degree Vertical -45-degree PPED APED Complete likage Average likage clusterig clusterig Feature represetatio Figure 7: Summatio of variaces of all feature-vector elemets for each vector-geeratio scheme. map divisio scheme employed i the PPED vector geeratio show i Fig. 2. O the other had, it is iterestig to see the clusterig result by the average likage algorithm. It displays more coectivity tha that by the complete likage algorithm, i which each facial part such as the eyes, the ose, ad the outlie of a face is assiged to the same cluster. This implies that the feature map divisio scheme employed i the APED vector geeratio (Fig. 3) is essetial for facial image recogitio. The results of the clusterig suggest that PPED ad APED are essetial for facial image classificatio. However, PPED ad APED have bee developed as geeral-purpose feature represetatios. Therefore, we ca expect that employig the results of the hierarchical clusterig as the partitios ca improve the performace of facial image recogitio. Figure 7 shows the values of W d i Eq. (12) employig the results of hierarchical clusterig illustrated i Fig. 6 as the partitios of the edge maps are demostrated i compariso with those of PPED ad APED. The clusterig-based feature represetatios achieve larger variaces tha PPED ad APED. The prelimiary experimets of face detectio were carried out usig a image i CMU test set C [12]. I the template matchig-based face detectio, a pixel image was take from a iput image ad a feature vector was geerated from the take image. The, the feature vector was 2007 EURASIP 1943

5 900 frotal facial images as test samples, four directioal edge maps were aalyzed employig the hierarchical clusterig based o the spatial correlatios of edge flags. As a result, the validity of usig PPED ad APED feature vectors for facial image recogitio has bee verified by the similarity betwee the results of the hierarchical clusterig ad the partitio employed i PPED or APED vector-geeratio scheme. I additio, it has also bee demostrated that the hierarchical clusterig-based feature represetatios improve the performace of face detectio. REFERENCES Figure 8: Result of face detectio from a image i CMU test set C [12] usig PPED ad APED feature vectors. Figure 9: Result of face detectio usig hierarchical clusterig-based feature vectors. matched with all template vectors of face ad oface samples, ad classified as a face or a oface accordig to the category of the best-matched template vectors. This classificatio was carried out by pixel-by-pixel scaig the etire image. The 900 facial images ad 2000 radomly chose backgroud images were utilized for face samples ad oface samples, respectively. I the experimet, the cocept of multiple-clue criterio [5] has bee itroduced. Namely, oly pixel sites where both feature vectors classified as a face were determied as a true face. The results of face detectio usig PPED ad APED feature vectors are show i Fig. 8. Although all faces are detected, may false positives also occur. Figure 9 demostrates the result of face detectio usig the feature vectors utilizig the results of the complete likage clusterig ad the average likage clusterig show i Fig. 6. The umber of false positives has bee reduced without missig the true faces. (These false positives ca be elimiated by the facial parts verificatio algorithm described i [4].) This result implies that the directioal edge-based feature represetatios usig the hierarchical clusterig improve the performace of image recogitio. 5. CONCLUSIONS The directioal edge-based image feature represetatios have bee studied o the basis of statistic aalysis. Usig [1] M. Yagi ad T. Shibata, A image represetatio algorithm compatible with eural-associative-processorbased hardware recogitio systems, IEEE Tras. Neural Netw., vol. 14, pp , Sept [2] M. Yagi, M. Adachi, ad T. Shibata, A hardwarefriedly soft-computig algorithm for image recogitio, i Proc. EUSIPCO 2000, Tampere, Filad, September , pp [3] M. Yagi ad T. Shibata, Huma-perceptio-like image recogitio system based o the associative processor architecture, i Proc. EUSIPCO 2002, Toulouse, Frace, September , pp [4] Y. Suzuki ad T. Shibata, Multiple-Resolutio Edge- Based Feature Represetatios for Robust Face Segmetatio ad Verificatio, i Proc. EUSIPCO 2005, Atalya, Turkey, Sept [5] Y. Suzuki ad T. Shibata, Multiple-clue face detectio algorithm usig edge-based feature vectors, i Porc. of Itl. Cof. o Accoustics, Speech ad Sig. Proc. (ICASSP), Motreal, Caada, May , pp [6] Y. Suzuki ad T. Shibata, Illumiatio-ivariat face idetificatio usig edge-based feature vectors i pseudo-2d hidde Markov models, i Proc. EUSIPCO 2006, Florece, Italy, Sept [7] H. Yamasaki ad T. Shibata, A real-time imagefeature-extractio ad vector-geeratio VLSI employig arrayed-shift-register architecture, i Proc of Europea Solid-State Circuits Cof. (ESSIRC), Greoble, Frace, Sept , pp [8] W. H. E. Day ad H. Edelsbruer, Efficiet algorithms for agglomerative hierarchical clusterig methods, Joural of Classificatio, vol. 1, pp. 7-24, Dec [9] D. Defays, A efficiet algorithm for a complete lik method, Computer Joural, vol. 20, pp , [10] E. M. Voorhees, Implemetig agglomerative hierarchic clusterig algorithms for use i documet retrieval, Iformatio Processig ad Maagemet, vol. 22, pp , [11] Softpia Japa, Research ad Developmet Divisio, HOIP Laboratory, HOIP facial image database, catalog/top.html [12] H. Rowley, S. Baluja, ad T. Kaade, Neural etworkbased face detectio, IEEE Tras. Patter Aal. Machie Itell., vol.20, pp , Ja EURASIP 1944

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

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

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

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

Elementary Educational Computer

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

More information

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

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

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

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

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Evaluation scheme for Tracking in AMI

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

More information

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

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies

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

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

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

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

More information

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

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

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

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

Dimension Reduction and Manifold Learning. Xin Zhang

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

More information

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

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

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

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

Chapter 3: Introduction to Principal components analysis with MATLAB

Chapter 3: Introduction to Principal components analysis with MATLAB Chapter 3: Itroductio to Pricipal compoets aalysis with MATLAB The vriety of mathematical tools are avilable ad successfully workig to i the field of image processig. The mai problem with graphical autheticatio

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

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

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

More information

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

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

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL Iteratioal Joural of Iformatio Techology ad Kowledge Maagemet July-December 2012, Volume 5, No. 2, pp. 371-375 EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

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

Principal Components Analysis Based Iris Recognition and Identification System

Principal Components Analysis Based Iris Recognition and Identification System Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: 223-2307, Volume-3, Issue-2, May 203 Pricipal Compoets Aalysis Based Iris Recogitio ad Idetificatio System E. Mattar Abstract his article focuses

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More 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

MULTI-VIEW FACE DETECTION AND POSE ESTIMATION EMPLOYING EDGE-BASED FEATURE VECTORS

MULTI-VIEW FACE DETECTION AND POSE ESTIMATION EMPLOYING EDGE-BASED FEATURE VECTORS MULTI-VIEW FACE DETECTION AND POSE ESTIMATION EMPLOYING EDGE-BASED FEATURE VECTORS Daisuke Moriya, Yasufumi Suzuki, and Tadashi Shibata Masakazu Yagi and Kenji Takada Department of Frontier Informatics,

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More 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

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

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

COMPLEMENTARY SIMILARITY MEASURE

COMPLEMENTARY SIMILARITY MEASURE IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER 998 03 Text-Lie Extractio ad Character Recogitio of Documet Headlies With Graphical Desigs Usig Complemetary Similarity

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

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

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory Cluster Aalysis Adrew Kusiak Itelliget Systems Laboratory 2139 Seamas Ceter The Uiversity of Iowa Iowa City, Iowa 52242-1527 adrew-kusiak@uiowa.edu http://www.icae.uiowa.edu/~akusiak Two geeric modes of

More information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

More information

Real-Time Secure System for Detection and Recognition the Face of Criminals

Real-Time Secure System for Detection and Recognition the Face of Criminals Available Olie at www.ijcsmc.com Iteratioal Joural of Computer Sciece ad Mobile Computig A Mothly Joural of Computer Sciece ad Iformatio Techology IJCSMC, Vol. 4, Issue. 9, September 2015, pg.58 83 RESEARCH

More information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

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

More information

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

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 14, No 4 Sofia 2014 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI: 10.1515/cait-2014-0008 Evaluatio of the Software Idustry

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

DATA MINING II - 1DL460

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

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

A Semi- Non-Negative Matrix Factorization and Principal Component Analysis Unified Framework for Data Clustering

A Semi- Non-Negative Matrix Factorization and Principal Component Analysis Unified Framework for Data Clustering A Semi- No-Negative Matrix Factorizatio ad Pricipal Compoet Aalysis Uified Framework for Data Clusterig V.Yuvaraj, N.SivaKumar Assistat Professor, Departmet of Computer Sciece, K.S.G college of Arts ad

More information

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware

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

More information

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

Research Article An Improved Metric Learning Approach for Degraded Face Recognition

Research Article An Improved Metric Learning Approach for Degraded Face Recognition Mathematical Problems i Egieerig, Article ID 74978, 10 pages http://dxdoiorg/101155/014/74978 Research Article A Improved Metric Learig Approach for Degraded Face Recogitio Guofeg Zou, 1 Yuayua Zhag, 1

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

Hashing Functions Performance in Packet Classification

Hashing Functions Performance in Packet Classification Hashig Fuctios Performace i Packet Classificatio Mahmood Ahmadi ad Stepha Wog Computer Egieerig Laboratory Faculty of Electrical Egieerig, Mathematics ad Computer Sciece Delft Uiversity of Techology {mahmadi,

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

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

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

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University CSCI 5090/7090- Machie Learig Sprig 018 Mehdi Allahyari Georgia Souther Uiversity Clusterig (slides borrowed from Tom Mitchell, Maria Floria Balca, Ali Borji, Ke Che) 1 Clusterig, Iformal Goals Goal: Automatically

More information

Improving Face Recognition Rate by Combining Eigenface Approach and Case-based Reasoning

Improving Face Recognition Rate by Combining Eigenface Approach and Case-based Reasoning Improvig Face Recogitio Rate by Combiig Eigeface Approach ad Case-based Reasoig Haris Supic, ember, IAENG Abstract There are may approaches to the face recogitio. This paper presets a approach that combies

More information

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

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

More information

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

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

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

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

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

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

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

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

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

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

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

Lecture 1: Introduction and Strassen s Algorithm

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

More information

Soft Computing Based Range Facial Recognition Using Eigenface

Soft Computing Based Range Facial Recognition Using Eigenface Soft Computig Based Rage Facial Recogitio Usig Eigeface Yeug-Hak Lee, Chag-Wook Ha, ad Tae-Su Kim School of Electrical Egieerig ad Computer Sciece, Yeugam Uiversity, 4- Dae-dog, Gyogsa, Gyogbuk, 7-749

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

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More 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

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

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

1 Graph Sparsfication

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

More information

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

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More 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

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

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1 Ozea Joural of Applied Scieces (), 009 Ozea Joural of Applied Scieces (), 009 ISSN 943-49 009 Ozea Publicatio Kerel Smoothig Fuctio ad Choosig Badwidth for No-Parametric Regressio Methods Murat Kayri ad

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

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

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

More information

Texture Analysis and Indexing Using Gabor-like Hermite Filters

Texture Analysis and Indexing Using Gabor-like Hermite Filters Submitted to Image ad Visio Computig, Elsevier, 2004 Texture Aalysis ad Idexig Usig Gabor-like Hermite Filters Carlos Joel Rivero-Moreo Stéphae Bres LIRIS, FRE 2672 CNRS, Lab. d'iformatique e Images et

More information

Descriptive Statistics Summary Lists

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

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

A Parallel DFA Minimization Algorithm

A Parallel DFA Minimization Algorithm A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this

More information

Fast algorithm for skew detection. Adnan Amin, Stephen Fischer, Tony Parkinson, and Ricky Shiu

Fast algorithm for skew detection. Adnan Amin, Stephen Fischer, Tony Parkinson, and Ricky Shiu Fast algorithm for skew detectio Ada Ami, Stephe Fischer, Toy Parkiso, ad Ricky Shiu School of Computer Sciece ad Egieerig Uiversity of New South Wales, Sydey NSW, 2052 Australia ABSTRACT Documet image

More information

Automatic Road Extraction from Satellite Image

Automatic Road Extraction from Satellite Image Automatic Road Extractio from Satellite Image B.Sowmya Dept. of Electroics & Cotrol Egg., Sathyabama Istitute of Sciece & Techology, Deemed Uiversity, Cheai bsowya@yahoo.com Abstract This paper explais

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

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

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

More information