Principal Components Analysis Based Iris Recognition and Identification System
|
|
- Malcolm Small
- 5 years ago
- Views:
Transcription
1 Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: , Volume-3, Issue-2, May 203 Pricipal Compoets Aalysis Based Iris Recogitio ad Idetificatio System E. Mattar Abstract his article focuses o the employmet of iris recogitio techique ad their applicatio i security systems. he implemetatio of such a system is based o the processig of a iris (scee) usig Priciple Compoet Aalysis ow i the literature as (PCA). his is doe by a iris segmetatio algorithm of (Libor Mase). Libor Mase algorithm is utilized here to segmet a iris from some udesired oises ad igrediets i a eye image. his rather helps to acquire the most accurate iris scee. Eige irises are hece obtaied usig the PCA method. Eige of irises are the utilized to trai a Artificial Neural Networ (ANN) recogitio system. his is followed by trasformig a set of irises ito a ew space. rasformed irises are accumulated i a database, where they are compared with a set of test irises trasformed i the same state of the recogitio cycle. he proposed system has resulted i accurate results up to 9 % for idetifyig a pre-stored idividuals. Idex erms Iris recogitio, Pricipal Compoet Aalysis, Patter recogitio, Eige vectors. I. INRODUCION A. he Biometric echology he use of biometric systems has bee icreasigly ecouraged by both govermet ad private etities i order to replace or improve traditioal security systems. he iris is commoly recogised as oe of the most reliable biometric measures: it has a radom morphogeesis ad o geetic peetrace. I 987, Flom ad Safir [] studied the problem ad cocluded that iris morphology remais stable throughout huma life, where they have estimated that, the probability of the existece of two similar irises o distict persos at i (072). A biometric system provides automatic recogitio of a idividual based o some uique feature or characteristic possessed by the idividual. Biometric systems have bee developed based o figerprits, facial features, voice, had geometry, hadwritig, the retia [2], ad the oe preseted i this paper, the iris. Biometric systems wor by first capturig a sample of the feature, such as recordig a digital soud sigal for voice recogitio, or taig a digital colour image for face recogitio. he sample is the trasformed usig some sort of mathematical fuctio i to a biometric template. ca the be objectively compared with other templates i order to determie idetity. Most biometric systems do permit two modes of operatio. A erolmet mode for addig templates to a database, ad a idetificatio mode, where a template is created for a idividual ad the a match is searched for i the database of pre-erolled templates [4]. Biometric systems wor by first capturig samples of the feature, such as image for face recogitio, digital voice for voice recogitio etc... Such samples are the trasformed usig some sort of mathematical fuctios to produce some characteristic property for idetificatio. A good biometric system is characterized by the use of a feature that is; highly uique so that the chace of ay two people havig the same characteristic will be miimal, stable so that the feature does ot chage over time, ad be easily captured i order to provide coveiece to the user, ad prevet misrepresetatio of the feature. B. he Huma Eye A iris is a thi circular diaphragm, which lies betwee the corea ad the les of the huma eye. A frot-o view of the iris is show i Fig... he iris is perforated close to its ceter by a circular aperture ow as the pupil. he fuctio of the iris is to cotrol the amout of light eterig through the pupil, ad this is doe by the sphicter ad the dilator muscles, which adjust the size of the pupil. he average diameter of the iris is 2 mm, ad the pupil size ca vary from % 80 % of the iris diameter [4]. A frot-o view of 0 to the iris is show i Fig. (). he iris is perforated close to its cetre by a circular aperture ow as the pupil. he fuctio of the iris is to cotrol the amout of light eterig through the pupil, ad this is doe by the sphicter ad the dilator muscles, which adjust the size of the pupil. he commo diameter of the iris is 2 mm, ad the pupil size ca vary from (0% to 80%) of the iris diameter [4]. he biometric template will provide a ormalized, efficiet ad highly discrimiatig represetatio of the feature, which Mauscript received May, 203. E. Mattar, Departmet of Electrical ad Electroics Egieerig, College of Egieerig, Uiversity of Bahrai, P. O. Box 384, Kigdom of Bahrai Fig. () : A frot view of the huma eye. Wolff, [4]. Formatio of iris begis durig the third moth of embryoic life [4]. he uique model o the surface of the iris is formed durig the first year of life, ad pigmetatio of 430
2 Pricipal Compoets Aalysis Based Iris Recogitio ad Idetificatio System the stroma taes place for the first few years. Formatio of the uique patters of the iris is radom ad ot related to ay geetic factors [4]. he oly characteristic that is depedet o geetics is the pigmetatio of the iris, which determies its color. Due to the epigeetic ature of iris patters, the two eyes of a idividual cotai completely idepedet iris patters, ad idetical twis possess ucorrelated iris patters. For further details o the aatomy of the huma eye cosult the boo by Wolff [4]. he iris had bee historically recogized to possess characteristics uique to each idividual. I the mid-980s, two ophthalmologists, (Leoard Flom ad Ara Safir) have proposed the cocept that o two irises are alie. (Leoard Flom ad Ara Safir), researched ad documeted the potetial of usig the iris for idetifyig people ad were awarded a patet i 987. Soo after, the itricate ad sophisticated algorithm that brought the cocept to reality was developed by (Joh Daugma, [4]) ad pateted i 994. he origial wor ad the cotiued developmet have established the Iridia s iris recogitio algorithm, [7] as the mathematically urivalled meas for autheticatio. Compared with other biometric techologies, such as face, speech ad figer recogitio, iris recogitio ca easily be cosidered as the most reliable form of biometric techology [4]. C. Research Objectives ad Outlie I this article a iris recogitio system based o Pricipal Compoet Aalysis (PCA) is implemeted. PCA is a method used to process a variety of data, where is well ow as a method that extract global ad fie features, respectively. I this research, it was adapted the ANN PCA related methodology for a Iris Recogitio. he developmet tool was doe through Matlab, where a emphasis was give oly to the software for performig recogitio, ad ot o the hardware for capturig a eye image. he performace of the ecodig techique was executed usig the (CASIA) eye images: with a courtesy from the Chiese Academy of Scieces Istitute of Automatio, (CASIA) [6]. Hece, followig will be the followed steps :. A algorithm to segmet the iris from the uwated parts(eyelids, eyelashes)will be used. 2. Eige Irises will be obtaied usig PCA. 3. Eige irises obtaied will be used to trai the system ad to trasform the traiig irises i to a ew space. 4. Irises i the ew trasformed space will be stored i a database, hece will be used i the recogitio process. II. PRINCIPAL COMPONEN ANALYSIS A. Review Stage he (PCA) ool: Pricipal Compoet Aalysis has bee widely used for aalyzig computer images. It is employed i biometric idustry ad systems as a classificatio tool. PCA does eable someoe to measure a differece betwee two images while allowig expressio chages. I the vector space. PCA performs these by computig the eigevectors ad eigevaluses of a covariace matrix of a image data. Keepig merely a few eigevectors correspodig to the largest eigespace (for details o PCA, refer to [7]). Priciple Compoet Aalysis, also ow as the Eige XY aalysis, ad is a stadard statistical techique for fidig directios of maximum variatios i data. hese directios, called the priciple compoets, where they ca be used to recostruct all of the iformatio withi a data set, ad ca be tested to which level a test image couples with a image of a traiig set. Priciple compoets with slighter associated magitudes ca frequetly be omitted, as they cotribute fewer to the etire recostructio of each data elemet. his allows sufficiet represetatio of the origial data set with a reduced set of pricipal compoets. he pricipal compoets are foud by computig the eigevalues ad eige vectors of the (Covariace Matrix) associated with the data. Eigevectors with largest associated eigevalues are the pricipal compoets that describe the most variatio i the data set. Priciple Compoet coefficiets of data elemets are foud by projectig each datum oto the eigespace of the Covariace Matrix. B. Preparatios of (PCA) I order to employ PCA for iris processig, firstly it is required to covert a RGB (Red-Gree-Blue) scee ito a gray scale (blac ad white) format. It is also possible to use a RGB scee, other tha, istead of usig a (3-D) matrices, (2-D) matrices are eve easier to evaluate. Give a gray scale image, that ca be represeted as a matrix of itesity values. We ca covert it ito a vector by placig the colum of a image o top of each aother. Eye image is a two-dimesioal array of size x.y x, y are, where width ad height of the a image. Each image ca thus be represeted as a vector of dimesio x y: RGB (Red-Gree-Blue) Image vector form of the image Fig. (2) : Obtaiig Vector Form of a Image C. raiig Phase of (PCA) Lettig be a image from a collectio of () images i database. : P,P P 2,, i Fig. (2), are put as P Average image is defied as : P 2 P 3 P () 43
3 Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: , Volume-3, Issue-2, May 203 (2) i M i After computig the average colum vector matrices, it is required to build a differeces matrix. Each image differ from the average image by the vector : i for i,2,3,, 2 3 he covariace matrix of the dataset is thus defied by Equ. (4) as: C M C i M (3) (4) After computig the covariace matrix C, we hece build the eigevectors. If we cosider eige vectors u of. Eigevectors u are actually images ad are called eigefaces, amog those eigefaces are the oes with the higher eige values, ad are the most useful i the recogitio process. herefore, those eigefaces M M are used for costructig the eye space for image projectios, which are used i iris idetifyig classifyig or recogizig. D. estig Phase of (PCA) After a traiig phase, ad gettig the eigefaces, we hece move to testig phase to prove our (PCA) theory. I order to chec weather a picture is oe of the samples of our database or ot we should trasform that picture ito eigefaces as follows: u X (5) th is the coordiate of the i ew eye space. Equ. (5) i fact describes the poit by poit image multiplicatios ad summatios resultig i scalar value with dimesios previously defied as weights that defie each face. hose weights form a vector: (6) 2 M Gives the projectio vector. Vector describes cotributio of each eigeface i represetig the iput test images. his vector is used i fidig the class this iput image belogs to, if there are more tha oe images describig a perso, otherwise it is used to fid to which iput image is it much similar, this will be doe by usig eucludiea distace betwee the test image ad projectio image classes. If we compute the distace by usig the ω for the traiig ad test phase, it will give us the distace of the test picture accordig to the traiig phase. 2 (7) th I Equ. (7), describes the eye class, which is average of the eigeface represetatio of the eye images of each idividual. A eye will be classified to some class if the miimum is below some threshold, otherwise it will be classified as a uow picture. E. Fuzzy C-Meas Clusterig: (FCM) Fuzzy C-meas (FCM) is a data clusterig techique, through which each data poit belogs to a cluster with some degree, that is specified by a membership grade. his techique was origially itroduced by Bezde i 98 as a improvemet o earlier clusterig methods. It provides a approach that shows how to group data poits that populate some multidimesioal space ito a specific umber of differet clusters. he MatLab Fuzzy Logic oolbox, commad lie fuctio (FCM) starts with a prelimiary guess for the cluster ceters, which are iteded to mar the mea locatio of each cluster. he prelimiary guess for these cluster ceters is most liely icorrect. Furthermore, (FCM) assigs every data poit a membership grade for every cluster. By iteratively updatig the cluster ceters ad the membership grades for each data poit, (FCM) iteratively moves the cluster ceters to the right locatio cotaied by a data set. his iteratio is based o miimizig a objective fuctio that represets the distace from ay give data poit to a cluster ceter weighted by that data poit s membership grade. (FCM) is a commad lie fuctio whose output is a list of cluster ceters ad several membership grades for each data poit. his ca be used to get the iformatio retured by Matlab routie (FCM) to facilitate buildig a fuzzy iferece system by creatig membership fuctios to represet the fuzzy qualities of each cluster. For istat, while usig some quasi-radom two-dimesioal data, as show i Fig. (3), to illustrate how (FCM) clusterig wors. y Scattred data Eye image desity Data v v2 Clusters ceter Image desity has bee projected clusters Curves of equidistace Fig. (3) : A clusterig of images. A example of a two-dimesioal itese image. Now the commad-lie fuctio, FCM, is ivoed ad ased to fid two clusters i this data set. [ceter,u,objfc] = fcm(fcmdata,2); Iteratio cout =, obj. fc = Iteratio cout = 2, obj. fc = this is cotiued to be computed util the objective fuctio is o loger decreasig much at all. he variable ceter cotais the coordiates of the two cluster ceters, (U) cotais the x 432
4 Pricipal Compoets Aalysis Based Iris Recogitio ad Idetificatio System membership grades for each of the data poits, ad (objfc) cotais a history of the objective fuctio across the iteratios. Fig. (4) displays the two separate clusters classified by the (fcm) routie. he figure is geerated usig Cluster ceters ad are idicated i the figure below by the large characters. Eye image desity First Step: Iris localizatio Secod Step: Polar represetatio y Scattred data Data v v 2 Clusters ceter Image desity has bee projected clusters Curves of equidistace Fig. (4) Data separated ito two differet clusters after clusterig with their cetroid x Fig. (6) : Polar represetatio of the segmeted iris alog with oise masig. B. Chiese Academy of Scieces Dataset, (CASIA) All the iris experimets completed i this paper were performed o the (CASIA) dataset provided by the (Chiese Academy of Scieces), [6]. he (CASIA) dataset cotais some o-ideal iris images of 08 irises with 7 images per oe iris. Images i this dataset are strogly occluded, blurred, ad defocused. Sample images from CASIA datasets are exposed i Fig. (7). Fuzzy C-meas is also used i image segmetati.o, [], by clusterig a set of data based o it s color itesities as show i Fig. (5). Fig. (5) : (left), Real image. (right), segmeted image, Romdhai S. []. III. IMPLEMENAION A. Iris Localizatio, Ecodig, ad Matchig he followig geeral phases are ivolved i most of iris recogitio systems curretly i use : i. Localizatio: Durig this step the pupil, sclera ad eyelids are segmeted. ii. Ecodig: his step ivolves extractio of the most discrimiatig iformatio preset i a iris patter i order to provide accurate recogitio of idividuals. iii. Matchig: he ecoded irises are the stored i the database ad are matched with the test ecoded iris for the purpose of recogitio. o localize a iris, this was achieved by usig the Libor Mase s algorithm of [], as illustrated i Fig. (6). PCA was the used for traiig the system ad extractig the most importat features from irises. Hece, to trasform a iris image ito a ew space. he trasformed irises are stored i a database, where are compared with other irises for recogitio. Fig. (7) : Sample images from CASIA dataset, Chiese Academy of Scieces database, [6]. Left: Smaple_. Ceter: Sample_2. Right: Sample_3. C. Iris Segmetatio Fuzzy C-meas method was attempted to segmet the iris from the eye image. As metioed earlier, Fuzzy -meas partitios the data ito clusters based o their similarities. While eepig this i mid, the eye image show i Fig. (8) was coverted to (RGB) ad was clustered based o color to four differet parts. It was assumed that the si will tae the first cluster, sclera the secod, iris the third ad pupil the fourth. Result of each clustered iris ca be show i Fig. (9). Fig. (8) he origial eye. A sample of a eye iris to be clustered. Further processig steps are give i Fig. (9). 433
5 Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: , Volume-3, Issue-2, May 203 (a) (c) (d) Fig. (9) : Processed iris ito differet clusters. (a): Clustered si. (b): Clustered sclera. (c): clustered iris. (d): clustered pupil. D. Eige Irises Geeratio he first objective is to acquire the eige irises. hese will be the be used to trai a ANN system. he eigeiris geeratio implemetatio is ot the oe suggested i sectio (2). I fact, the used eigeirises are the eigevectors of the matrix XX. Adoptig the otatios of sectio (2), X is a matrix cotaiig the iput irises - each colum represetig a colum iris vector. he dimesio of X is I (umber of pixels of each iris) by I (umber of faces i the traiig set). As has bee oted, the umber of irises i a traiig set is usually smaller tha the umber of pixels cotaied i each iris image. For example, each iris cotais (4800) pixels. Hece, the dimesio of matrix XX is I I, where I his is a waste of both processig time ad memory space to compute the eigevectors by this basic method of SECION (2). I this sese, a more efficiet techique will be preseted here. Istead of computig the outer product XX, the ier product, X X, is this calculated. Eigevectors of the outer product are deduced from those of the ier product. Assumig the followigs : (b) V be the outer product, XX, i. the matrix ii. the matrix Q be the matrix of the eigevectors of V, iii. the matrix P be the matrix of the eigevectors of the outer product, XX, iv. ad the diagoal matrix be the matrix of the eigevalues of the ier product ad of the outer product, Dorairaj et. al. []. his results i P computed as ; XQ P (7) Each iris image is coverted i to a sigle colum vector as was show previously i Fig. (2). hese colum images are used to obtai the eige irises as illustrated here i Fig. (0). Fig. (0) : he first six eige irises, Dorairaj et. al. []. E. Iris Space Oce the eigeirises have bee computed, each iris i the image space ca be viewed i the trasformed space. he trasformatio from image space to trasformed space is fairly simple. Lettig the followigs : E be the matrix of the first (eigeirises), where the first i. colum is the first eigeiris ad so o. e be a face i the image space, ad. ii. i iii. e be the same iris i the trasformed space. e e E i his is a may-to-oe trasformatio, sice the dimesioality of the image space is far larger tha the dimesioality of trasformed space. F. he Recogitio Process Oce the eigeirises have bee computed, the trasformed space has to be populated with several ow irises. Usually these irises are iputted from the used traiig set. Each ow iris is trasformed ito the ew space, where its compoets are stored a database. At this stage, the idetificatio process ca be iitiated. A uow iris is preseted to the system. he system project it oto the trasformed space ad computes its distace from all the stored irises. he iris is idetified as beig the same idividual as the iris which is earest to it i trasformed space. here are several methods of computig the distace betwee multidimesioal vectors. Here, a mea of the distace betwee the two trasformed irises is computed ad the shortest mea gives the best match. he overall idetificatio process ca be summarized i Fig. (). G. he Etire Developed System Overview he software to perform iris recogitio was developed usig the MALAB developmet eviromet. A computer system with a Itel Petium IV processor ruig at (.7 GHz) was used. he program is composed of two MALAB fuctios - (get_p_irisdb.m) ad (test.m) the former fetches the eige vectors ad the database of the trasformed irises, while the latter fuctio is used for testig as show Fig. (2). Fig. () A flowchart summary of employed iris recogitio process. 434
6 FALIURE RAE FALURE RAE Pricipal Compoets Aalysis Based Iris Recogitio ad Idetificatio System MatLab Based Recogitio Eviromet Itel Petium IV processor ruig at.7 GHz Eigevectors ad Iris Databases Iris Extractio Phase ad raiig Phase For istat, i Fig. (3) more (30%) of the iris is ot accessible by the system due to the eyelid ad eyelashes herefore achievig such a success rate reveals that iris recogitio is i fact a very reliable biometric verificatio system. est results also show that Pricipal Compoet aalysis is robust feature extractio techique that ca be used i iris recogitio systems. Observatio was doe by reducig the umber of traiig images as show i Fig. (4). estig stage estig image of a iris Results: idetified iris 8 (i) RAINING IMAGES PER INDIVIDUL Fig. (4) Failure rate versus traiig images. (ii) NUMBER OF EIGEN IRISES (iii) Fig. (2) (i) Employed System Overview. (ii) Locally built iris database. (iii) Segmet of used Matlab codig eviromet. IV. RESULS VALIDAION Matlab computig eviromet was used to test the proposed algorithm. I order to verify the proposed idetificatio methodology, ad achieve some testig o the CASIA dataset, four differet irises have bee used durig the traiig phase. I additio, three differet images have bee used durig the testig phase (as per idividual). A success rate of (92.65%) was achieved. I additio, we have to bear i mid that the CASIA dataset cotais highly o-ideal, occluded images as show i Fig. (3). Fig. (3) estig phase: Eyes are imported from the used freely available CASIA dataset, Chiese Academy of Scieces, [6]. Fig. (5) Failure rate versus the used eige irises. A reductio i the umber of traiig images resulted i a icrease i the false idetificatio by the adopted system. his is mostly due to the fact that iris images whe tae i differet positios are slightly out of phase. herefore multiple iris images of the same idividual i the database icreases the idetificatio. Daugma [3], however came up with a solutio to this problem by maig a algorithm that taes the possibility of phase shift i to cosideratio, by which a sigle clear iris image per perso i the database is adequate to idetify the idividual idepedet of the positio he/she is i. Aother observatio was made by decreasig the umber of eige irises used as show i Fig. (5). he umber of eige vectors required geerally depeds o the data beig used [0]. We have reached the best results whe the umber of eige irises where M, where M is the total umber of database irises used for traiig. he umber of eige irises required for good result shows us how rich ad less compressible is the patter of the irises [0]. For more irises ad further aalysis, this ca be foud i [2]. V. CONCLUSIONS his research article has preseted a iris recogitio 435
7 Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: , Volume-3, Issue-2, May 203 system. he system was tested usig grey scale images. he eye images were highly o-ideal ad a good portio of the irises were hidde by eyelids ad eyelashes. Firstly, a automatic segmetatio algorithm is used to (localize) the iris ad (segmet) it from the uwated parts of the eye (eyelash, eyelid). Subsequetly (PCA) was applied to do a ANN traiig irises to obtai the Eige irises, these eige irises were used to trasform a origial iris image ito a ew MM trasformed space which had the dimesios of, where M is the umber of iris images used to trai the system. hese trasformed irises were (stored) i a iris database ad were used to (compare) the test irises which had bee trasformed i the same space to perform the recogitio process. he research results have achieved a success rate of (92.65%) with a highly o ideal iris images. o this extet, this verifies the high reliability of the iris beig used i biometric recogitio ad highlights the robustess of PCA i image recogitio. REFERENCES [] L. Flom, ad A. Safir, "Iris Recogitio System". U.S. Patet, (464394), (987). [2] S. Saderso, ad J. Erbetta, "Autheticatio For Secure Eviromets Based o Iris Scaig echology," IEE Colloquium o Visual Biometrics, UK, (2000). [3] J. Daugma, " How Iris Recogitio Wors," Proceedigs of 2002 Iteratioal Coferece o Image Processig, vol., (2002). [4] E. Wolff, "Aatomy of the Eye ad Orbit.", 7 th Editio. H. K. Lewis ad Co. LD, (976). [5] R. Wildes. "Iris Recogitio: A Emergig Biometric echology, " Proceedigs of the IEEE rasactios, vol. 85, o. 9, (997). [6] Chiese Academy of Scieces Istitute of Automatio. Database of 756 Grey Scale Eye Images. Versio.0, (2003). [7] Iridia echologies [8] A. ur, ad A. Petlad, Face Recogitio Usig Eigefaces, Proceedigs of the IEEE Coferece o Computer Visio ad Patter Recogitio, pp , Hawaii, Jue (992). [9] L. Mase, "Recogitio of Huma Iris Patters for Biometric Idetificatio", Bachelor of Eg. hesis, the Uiversity of Wester Australia, (2003). [0] S. Romdhai, "Face Recogitio Usig Pricipal Compoet Aalysis," Published M.Sc. hesis, Uiversity of Glasgow, (996). [] V. Dorairaj, A. Natalia, ad G. Fahmy, "Performace Evaluatio of No-Ideal Iris Based Recogitio System Implemetig Global ICA Ecodig, IEEE Iteratioal Coferece o Image Processig, vol. 3, Issue, (-4), Page(s): III , (2005). [2] M. A Hameed, "Iris Recogitio Usig Pricipal Compoet Aalysis", echical Project Report, College of Egieerig, Uiversity of Bahrai, (2007). E. Mattar is a associate professor of itelliget cotrol ad robotics at Uiversity of Bahrai, Bahrai. He has received BSc. i Electrical Egieerig (from Uiversity of Bahrai i 986), studied MSc. i Electroics i 989 (from Uiversity of Southampto, UK), ad i 994 he received Uiversity of Readig Ph.D. i Cyberetics ad Robotics Cotrol. Dr. Mattar has iterests i computatioal itelligece, robotics cotrol, modelig ad cotrol. 436
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 informationEigenimages. 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 informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationElementary 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 informationFEATURES VECTOR FOR PERSONAL IDENTIFICATION BASED ON IRIS TEXTURE
FEATURES VECTOR FOR PERSONAL IDENTIFICATION BASED ON IRIS TEXTURE R. P. Moreo Departameto de Egeharia Elétrica EESC - USP Av. Trabalhador Sãocarlese, 400 São Carlos / SP Brasil raphael@digmotor.com.br
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationVALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING
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
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationImproving 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 informationImage 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 informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationImproving 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 informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationBiometric System Design for Iris Recognition Using Intelligent Algorithms
I.J. Moder Educatio ad Computer Sciece, 8, 3, 9-6 Published Olie March 8 i MECS (http://www.mecs-press.org/) DOI:.585/ijmecs.8.3. Biometric System Desig for Iris Recogitio Usig Itelliget Algorithms Muthaa
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationDimensionality Reduction PCA
Dimesioality Reductio PCA Machie Learig CSE446 David Wadde (slides provided by Carlos Guestri) Uiversity of Washigto Feb 22, 2017 Carlos Guestri 2005-2017 1 Dimesioality reductio Iput data may have thousads
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationA Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System
A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality
More informationAnalysis 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 informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationChapter 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 informationHADOOP: 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 informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationAnnouncements. Recognition III. A Rough Recognition Spectrum. Projection, and reconstruction. Face detection using distance to face space
Aoucemets Assigmet 5: Due Friday, 4:00 III Itroductio to Computer Visio CSE 52 Lecture 20 Fial Exam: ed, 6/9/04, :30-2:30, LH 2207 (here I ll discuss briefly today, ad will be at discussio sectio tomorrow
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationPosition and Velocity Estimation by Ultrasonic Sensor
Positio ad Velocity Estimatio by Ultrasoic Sesor N Ramarao 1, A R Subramayam 2, J Chara Raj 2, Lalith B V 2, Varu K R 2 1 (Faculty of EEE, BMSIT & M, INDIA) 2 (Studets of EEE, BMSIT & M, INDIA) Abstract:
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationStone 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 informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationJournal 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 informationPython 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 informationCopyright 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 informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationEMPIRICAL 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 informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationRunning 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 informationAnalysis 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 informationOutline. 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 informationDATA 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 informationLecture 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 informationCarnegie Mellon University
Caregie Mello Uiversity CARNEGIE INSTITUTE OF TECHNOLOGY THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Doctor of Philosophy TITLE Pose Robust Video-Based Face Recogitio
More informationRunning 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 informationParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationLip 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 informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationTask 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 informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationAppendix A. Use of Operators in ARPS
A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationReal-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 informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationHandwriting Stroke Extraction Using a New XYTC Transform
Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig
More informationA Low Complexity and Efficient Face Recognition Approach in JPEG Compressed Domain Using Quantized Coefficients
00 5th Iteratioal Symposium o Telecommuicatios (IST'00) A Low Complexity ad Efficiet Face Recogitio Approach i JPEG Compressed Domai Usig Quatized Coefficiets Alireza Sepasmoghaddam Islamic Azad Uiversity
More informationDimension 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 informationA Novel Approach for Coin Identification using Eigenvalues of Covariance Matrix, Hough Transform and Raster Scan Algorithms
Iteratioal Joural of Computer, Electrical, Automatio, Cotrol ad Iformatio Egieerig Vol:, No:8, 008 A Novel Approach for Coi Idetificatio usig Eigevalues of Covariace Matrix, Hough Trasform ad Raster Sca
More informationOn-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 informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationCIS 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 informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationFACE RECOGNITION BY EMBEDDING OF DT-CWT COEFFICIENT USING SOM AND ENSEMBLE BASED CLASSIFIER
GAURI AGRAWAL AND SANJAY KUMAR MAURYA: FACE RECOGNITION BY EMBEDDING OF DT-CWT COEFFICIENT USING SOM AND ENSEMBLE BASED CLASSIFIER DOI: 0.297/ijivp.206.082 FACE RECOGNITION BY EMBEDDING OF DT-CWT COEFFICIENT
More informationResearch 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 informationAutomated 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 informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.
More informationChapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationHashing 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 informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationShape Completion and Modeling of 3D Foot Shape While Walking Using Homologous Model Fitting
Shape Completio ad Modelig of 3D Foot Shape While Walkig Usig Homologous Model Fittig Yuji YOSHIDA* a, Shuta SAITO a, Yoshimitsu AOKI a, Makiko KOUCHI b, Masaaki MOCHIMARU b a Faculty of Sciece ad Techology,
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationAnalysis of Algorithms
Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms
More informationCSCI 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 informationEfficient Eye Location for Biomedical Imaging using Two-level Classifier Scheme
828 Iteratioal Joural of Cotrol, Automatio, ad Systems, vol. 6, o. 6, pp. 828-835, December 2008 Efficiet Eye Locatio for Biomedical Imagig usig Two-level Classifier Scheme Mi Youg Nam, Xi Wag, ad Phill
More informationChapter 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