On Computing Strength of Evidence for Writer Verification
|
|
- Shanon Townsend
- 5 years ago
- Views:
Transcription
1 On Computng Strength of Evdence for Wrter Verfcaton Shrvardhan Kabra Harsh Srnvasan Chen Huang Sargur Srhar Center of Excellence for Document Analyss and Recognton (CEDAR) Department of Computer Scence and Engneerng, Unversty at Buffalo {skabra, hs32, chuang5, Abstract The problem of Wrter Verfcaton s to make a decson of whether or not two handwrtten documents are wrtten by the same person. Provdng a strength of evdence for any such decson s an ntegral part of the wrter verfcaton problem. The strength of evdence should ncorporate () The amount of nformaton compared n each of the two documents (lne/half page/full page etc.), () The nature of content present n the document (same/dfferent content), () Features used for comparson and (v) The error rate of the model used for makng the decson. Ths paper descrbes the statstcal model used for wrter verfcaton and also ntroduces a mathematcal formulaton to nclude the above four mentoned parameters, for calculatng strength of evdence of same/dfferent wrter. The statstcal model uses Gamma and Gaussan denstes to parametrcally model the dstance space dstrbuton arsng from comparng ensemble of pars of documents. The strength of evdence s mapped to a 9-pont qualtatve scale for the decson; one that s often used by questoned document examners. Experments and results show that wth ncrease n nformaton content from just a sngle word to a full page of document, the verfcaton accuracy of the model ncreases. of Kullback-Lebler(KL) dvergence) to one of the dstrbuton(same), t s about the same for the other dstrbuton(dfferent). Frstly ths paper shows that, modelng the same dstrbuton wth Gamma and the dfferent dstrbuton wth Gaussan s better. Secondly, ths paper focuses on a method to provde a strength of evdence of same/dfferent that ncorporates () The amount of nformaton compared n each of the two documents(lne/half page/full page etc.), () The nature of content present n the document (same/dfferent content), () Features used for comparson and (v) The error rate of the model used for makng the decson. The frst two of the parameters above were not ncluded n framework of strength of evdence n []. The strength of evdence s then calbrated nto a standard nne-pont scale used by questoned document examners. 2 Wrter Verfcaton Model The three major components of the verfcaton model nclude () Identfyng dscrmnatng elements () Mappng from feature to dstance space by usng smlarty measure and ()Parametrc modelng of the dstance space dstrbuton. Each of the three s brefly descrbed below. 2. Features - Dscrmnatng elements Introducton Wrter verfcaton s the task of determnng whether two handwrtng samples were wrtten by the same or by dfferent wrters, a task of mportance n Questoned Document Examnaton (QDE). A statstcal model for ths task was descrbed n []. The model uses two dstance space dstrbutons resultng from comparng features from ensemble of pars of documents wrtten by () same wrter and () dfferent wrters. It was shown that a Gamma densty s a better ft than Gaussan denstes for modelng these dstrbutons. Although a Gamma s a better ft(n terms Features for wrter verfcaton have been splt nto Macro (global) and Mcro (Local) features n [2] and features are termed as dscrmnatng elements (DE [3]). The statstcal model to be descrbed can be used wth any other set of features as well. Macro features(3 of them ) are gray-scale based (entropy, threshold, no. of black pxels), contour based (external and nternal contours), slope-based (horzontal, postve, vertcal and negatve), stroke-wdth, slant and heght. These are real valued features. Mcro features are for characters, b-grams(two characters) and words. A set of 52 bnary-valued mcro-features correspondng to gradent (92 bts), structural (92 bts), and
2 concavty (28 bts) whch respectvely capture the fnest varatons n the contour, ntermedate stroke nformaton and larger concavtes and enclosed regons, e.g., [4] are used for characters. For b-grams and words, 24 such bnary valued GSC features [5] are used. The number of local features are dependent on the recognton of characters n the document. To assst recognton and ncrease the amount of local features, lexcon-based word recognton and transcrpt mappng approaches [6] can be used. The number of local features also depends on the amount of nformaton n the document(full page/half page etc.). 2.2 space dstrbuton Once a set of features descrbed above n Secton 2. are avalable for two documents, they can be compared. The comparson results n mappng from feature space to dstance space. The macro features are real valued and hence the mappng to dstance space s just the absolute dfference between the two feature values. On the other hand, the smlarty between bnary valued feature vectors for local features can be calculated usng a number of dfferent measures such as Hammng dstance, Eucldean dstance etc. A detaled descrpton of smlarty measures for bnary features s descrbed n [7]. After much expermentaton, the correlaton smlarty was decded as the best smlarty measure. 2.3 Parametrc model The dstrbuton n dstance space can be modeled usng known probablty densty functons (pdf). Assumng that smlarty data can be acceptably represented by Gaussan or Gamma dstrbutons, pdfs of dstances condtoned upon the same-wrter and dfferent-wrter categores for a sngle feature x have the parametrc forms p s (x) N(µ s,σs), 2 p d (x) N(µ d,σd 2) for the Gaussan case, and p s(x) Gam(a s,b s ), p d (x) Gam(a d,b d ) for the Gamma case. The Gaussan and Gamma densty functons are as follows. Gaussan: p(x) = (2π) /2 σ exp 2 ( x µ σ )2. Gamma: p(x) = x a exp ( x/b) (Γ(a)) b. Estmatng µ and σ from samples usng the a usual maxmum lkelhood estmaton, the parameters of the gamma dstrbuton are calculated as a = µ 2 /σ 2 and b = σ 2 /µ. For macro features, we model both categores by Gamma dstrbuton as p s (x) Gam(α s,β s ) and p d (x) Gam(α d,β d ). For mcro features, whle the same-wrter category s modeled as p s (x) Gam(α s,β s ) for Gamma dstrbuton, the dfferent-wrter s modeled as p d (x) N(µ d,σd 2 ) for Gaussan dstrbuton. As an example, dssmlarty hstograms correspondng to the same wrter and dfferent wrter dstrbutons for slant (macro feature) and for the letter e (mcro feature) are shown n Fgure (a) and (b) respectvely. Condtonal parametrc pdfs for slant and for e are shown n Fgure (c) and (d). Probablty densty (a) (c) Probablty densty x x (b) (d) Fgure. Hstograms and parametrc probablty densty functons Once the dstrbutons are modeled, the learnng phase s complete. A new par of unseen documents when compared results n a N dstance values, for each feature compared. For eg. f there were common characters n the two documents, and bgrams and words common, the value of N would be 3 Macro + Mcro features = 23. It s evdent that the nature of the document affects the number of mcro features but not the macro features. For one dstance value x, {...N}, the Lkelhood rato (LR) s gven as LR(x) = p s (x)/p d (x). Consderng the features as ndependent, we can have the LR for N of them as N LR(x ) = N p s (x )/p d (x ). The log lkelhood rato (LLR) s gven as LLR = N log p s (x ) log p d (x ) 2.4 Dscusson on LLR The understandng of the log lkelhood rato for the problem of wrter verfcaton s the key before the formulaton of strength of evdence s presented. Frstly t s mportant to note that the magntude of the LLR alone cannot provde a strength of evdence, though ths s not obvous drectly. Two reasons for ths are the followng. The reason can be llustrated wth an example. Lets say that a LLR of + was obtaned when only one word was avalable n the two documents ndcatng same wrter par. If the same LLR of + was obtaned when a whole page of document was compared, then ths s a weaker case. Ths s because, f a whole page of document were avalable, one would expect a larger postve LLR. Ths then a relatvely small LLR value n magntude can represent a strong strength of evdence. 2. The doman of LLR s ( nf,nf) and hence t cannot be calbrated onto the requred 9 qualtatve scale (dscussed later n Secton 3. Even wth the use of a
3 smoother lke a sgmod or a hyperbolc tangent, the resultng values le n the extremty and does not take nto account the amount of nformaton compared between the documents, the features used and the nature of the content compared. Hence there requres a new way to map from LLR to a qualtatve assessment of strength of evdence. It s evdent that the value of N (the number of features) drectly affects the magntude of the LLR. Below are two key factors that nfluence the value of N.. The amount of nformaton compared n the two documents (I). When two full page documents are compared, then t s more lkely that more characters are common between them and hence greater s the value of N. If the model s perfect, then each of the terms n the summaton s postve for same wrter pars and negatve for dfferent wrter pars. Hence, the magntude of LLR s hgher when documents wth more nformaton s compared. 2. The nature of content(same/dfferent) n the two documents (C). When two documents beng compared have the same content(text) n them, then t s obvous that more characters/b-grams/words recognzed n each of them wll be common. Hence, ths also ncreases the value of N and results n a hgher magntude of LLR. Also t s mportant to note that, when N s fxed (for eg. when only macro features are used), the range of the LLR values should not vary much. However, the accuracy of the model defned as percentage of correctly made decsons(same/dfferent) s stll nfluenced by the amount of nformaton I and the nature of the content C. For example, when only macro features are used, the feature values are more accurate when more nformaton s present n the document and as a result the LLR values classfy the par as same and dfferent better. 3 Strength of Evdence Havng observed two mportant reasons that affect the LLR as mentoned n Secton 2.4, the formulaton of strength of evdence s parameterzed based on two thngs () The amount of nformaton compared(i) and () Whether the documents beng compared have the same or dfferent content(c). In ths paper, we dscretze the values that I can take on as one of word,lne,multple lnes,half page,full page. Words of dfferent lengths(short,medum and long) and words made of purely numbers were all consdered as belongng to the type word. The two dfferent values C can take on s Same Content,Dfferent Content. The value of I can be automatcally found durng the processng of the handwrtten document whch conssts of lne and word segmentaton. The algorthm used for lne segmentaton s dscussed n [8] and that for word segmentaton s usng a Neural Network to decde whether or not the gap between two connected components s a word gap or not. Hence usng the number of lnes L and the number of words n each lne W {...L}, the value of I s decded as follows: [L =,W = I = word],[l =,W > I = lne],[l > & L < 4 I = multple-lnes],[l 4 & L < 8 I = half-page],[l 8 Ifull-page]. Smlarly for the value of C, f the number of common words between the two documents s greater than 8% of the number of words n the smaller document(n terms of number of lnes), then the value of C s Same Content, or else t s dfferent content. 3. Mathematcal formulaton For each possble pars of settngs for I and C, the dstrbuton of the LLR as observed on a valdaton set of ensemble of pars s obtaned. Ths ensemble of pars conssts of both, pars from same as well as from dfferent wrters. The number of such pars from the same and dfferent wrters are kept the same to avod a bas n the dstrbuton of LLR. Let D c represent the dstrbuton of LLR for I = and C = c. Further, let Dc S represent the subset of D c where the samples truly belonged to the same wrter and let Dc D represent the subset of D c where the samples truly belonged to dfferent wrters. It s clear that D c = Dc S DD c. Here t s mportant to note that the dstrbuton Dc S and DD c wll be dfferent for dfferent sets of features used. For eg., the dstrbuton can be further parameterzed by a thrd varable that measures whch feature set was used (macro only or macro+mcro). We leave the dscusson of ncluson of ths thrd parameter to the experments and results secton. Usng the dstrbutons Dc S and DD c, and for any gven value of LLR L, two percentages can now be obtaned () Pc S: Percentage of samples n Dc S that had LLR values > L and () Pc D: Percentage of samples n DD c that had LLR values > L. To be verbose, Pc S represents the percentage of same wrter cases n the valdaton set that had LLR values even larger than the one for ths. Ths mples that Pc S represents the percentage of same wrter cases n the valdaton set that were stronger than the current case. Smlarly, Pc D represents percentage of dfferent wrter cases that were weaker than the current case. Mathematcally, they are defned as n equaton. P S c = DS c >L D S c P D c = DD c >L D D c ()
4 Scale Opnons for same P S c Identfed as same Hghly probably same Probably same Indcatng same No concluson Table. Rules for obtanng the 9 pont scale(-5) when LLR L s +ve Scale Opnons for dfferent P D c 5 No concluson Indcatng dfferent Probably dfferent Hghly probable dfferent Identfed as dfferent Table 2. Rules for obtanng the 9 pont scale(5-9) when LLR L s -ve where represents cardnalty. It s clear that Pc S = Pc S wll represent that percentage of samples n DS c that had LLR values L and smlarly we defne Pc D = D and Pc represent the complement of P c S and P c D Pc D. P c S respectvely pont scale A standard 9 pont scale s used by questoned document examners to verfy whether two documents are wrtten by the same person or not. Ths scale s as follows: [-Identfed as same, 2-Hghly Probable same, 3-Probably same, 4-Indcatng same, 5-No concluson, 6-Indcatng dfferent, 7-Probably dfferent, 8-Hghly probably dfferent and 9-Identfed as dfferent]. The sgn(+ve,-ve) of the LLR L between a par of documents makes a decson of same or dfferent wrter. The strength of evdence s based on ths decson. The scale 9 for a partcular par of document can be obtaned usng ether Pc S (f L < ). (In both cases, we are evaluatng the percentage of samples that were stronger than the current case.) These two values can be calculated usng Equaton provded and c are known. The begnnng of ths secton descrbed the method to calculate these and c. If the LLR L s +ve, then the opnon scale s n the range -5 and n the range 5-9 f t s -ve. Note that, n ether cases, the scale 5-No concluson can be obtaned. Table and 2 summarzes the rules for obtanng the 9 pont scale for +ve and -ve LLR values. 4 Experments (f L > ) or P D c All experments were conducted usng the CEDAR-FOX system [9] that s an applcaton desgned for wrter verfcaton. A total of 824 wrters, wth each wrter havng wrtten 3 samples of full page document s the sze of the Informaton I Content C Sys. Accuracy Mn.LLR Max.LLR Lne Same 8.46% Dfferent 62.98% Multple lnes Same 88.7% Dfferent Half page Same 93.56% Dfferent 94.4% Full page Same Table 3. System accuracy and range of LLR when only Macro features are used total learnng/valdaton set to obtan the four dstrbutons Pc S,P c D S D,Pc and Pc. These documents were full page documents, and hence smaller content half-page, lne, word etc. were derved from ths set. Another set of the same sze was used as the testng set. The experments were conducted prmarly to show that the system accuracy and the range of LLR values obtaned do vary wth the amount of nformaton content I and the nature of the content C. The strength of evdence presented above s just a mathematcal formulaton to provde for a qualtatve assessment of the models decson. A thrd parameter other than I and C s ntroduced here as was told n Secton 3.. Ths parameter s ntroduced due to the nteractve nature of the system that has the capablty of nteractvely turnng on/off the mcro features and hence Tppett plots(dstrbutons) nclusve/exclusve of mcro features can also be obtaned. The results are presented for each of settng of ths parameter. 4. Results wth macro features only Wthout the mcro features (only macro avalable), the value of N (number of features) to calculate the LLR s a constant and hence as expected, the dstrbuton of LLR values does not vary much. The mnmum and maxmum values of the LLR are shown n Table 3. A row for word level s not ncluded n the table snce for one word, the macro features are extremely nosy. Ths s because, global document features cannot be represented well wth just one word. But, ths row s ncluded for experments when macro as well as mcro s used (see Secton 4.2). Also the row correspondng to full page dfferent content s also not avalable due to lack of such data. The system accuracy column n the Table 3 s the percentage of tmes the system decded on same/dfferent wrter correctly. Although the range of LLR values s the same, t s evdent from the table that as the nformaton present n the document ncreases, the system accuracy also ncreases and saturates when half page of document s present. The mappng from LLR to 9 pont scale strength of evdence s the same as dscussed n Secton 3.. The LLR dstrbutons correspondng to each row of the table s stored from performng experments on the valdaton set. Once ths s done, equaton, Table and Table 2 are used to calculate the 9 pont scale.
5 No of letters Word/Strng Sys. Accuracy Mn.LLR Max.LLR 9 Allentown 8.43% Street 73.3% Elder 8.9% * York,Loop 74.63% * Apt,New 74.63% % * 829,3 73.5% % Table 4. System accuracy and range of LLR when only one word/strng s used. It s seen that dscrmnablty power of word s more than numerals and longer words gve better accuracy. * denotes that the average accuracy was taken when two words of same length were consdered. Informaton I Content C Sys. Accuracy Mn.LLR Max.LLR Lne Same 86.4% Dfferent 62.98% Multple lnes Same 93.8% Dfferent Half page Same 93.8% Dfferent 94.78% Full page Same 95.75% Table 5. System accuracy and range of LLR when only Macro and Mcro features are used 4.2 Results wth macro and mcro features Wth the ncluson of mcro features, the range of LLR values as well as the system accuracy vares. Table 4 shows how the system accuracy vares wth the number of characters avalable when only one word s avalable n both documents. It s seen that the system accuracy on longer words s better than those n shorter words. Also the dscrmnablty power of words wth characters s seen to be greater than strngs of numbers. Table 5 shows the system accuracy and the LLR range when macro and mcro features are used for other page types. The calculaton of strength of evdence for a new unseen test case s as before. 4.3 Dscusson on strength of evdence From the above experments t s conclusve that the LLR values and hence the model s accuracy n decson makng depends on the amount of nformaton as well as the nature of content. When presented wth a new par of documents to be assessed, the followng nformaton s used to calculate the strength of evdence ()Amount of nformaton I (word,lne,multple-lnes,half-page,full-page), () Nature of content compared C (same content,dfferent content), () Lst of features compared (only Macro or Macro+Mcro). and (v)llr value obtaned by the model L. The frst three of the above decdes on whch LLR dstrbuton(d c as n Secton 3.) to use for the assessment. The LLR value s then used to calculate the percentages and 9 pont scale as n Equaton and Table and 2. Note that the 9 pont scale opnon s condtoned on the above four mentoned quanttes and hence t suffces to say that the strength of evdence s reflectve of the complete model/setup used. 5 Summary and Concluson A statstcal model for wrter verfcaton usng Gamma and Gaussan denstes to model the dstance space dstrbuton was shown as a better ft than earler used models[]. A mathematcal formulaton to provde for a qualtatve 9 pont scale assessment of strength of evdence was ntroduced and t was shown that ths formulaton takes nto account () Amount of nformaton present n the documents, () The nature of the content compared n the two documents and () The set of features used(macro/mcro) for comparson. Experments and results on a large set ndcated that the models accuracy and range of LLR values does ndeed depend on all of the above mentoned factors and hence the correctness of the formulaton of strength of evdence. References [] S. Srhar, M. Beal, K. Band, V. Shah, and P. Krshnamurthy, A statstcal model for wrter verfcaton, August 25, pp. pp [2] S. Lee, S. Cha, and S. N. Srhar, Combnng macro and mcro features for wrter dentfcaton, SPIE, Document Recognton and Retreval IX, San Jose, CA, pp , 22. [3] R. A. Huber and A. M. Headrck, Handwrtng dentfcaton:facts and fundamentals, CRC Press, 999. [4] S. N. Srhar, S. H. Cha, and S. Lee, Indvdualty of handwrtng, n Journal of Forensc Scences, 22, pp [5] B. Zhang, S. N. Srhar, and C. Huang, Word mage retreval usng bnary features, n SPIE, E. H. B. Smth, J. Hu, and J. Allan, Eds., vol. 5296, 24, pp [6] C. Huang and S. Srhar, Mappng transcrpts to handwrtten text, October 26, pp. pp [7] B. Zhang and S. N. Srhar, Bnary vector dssmlarty measures for handwrtng dentfcaton, Proc. Document Recognton and Retreval X, Santa Clara, CA, pp. pp 28 38, January 23. [8] M. Arvazhagan, H. Srnvasan, and S. Srhar, A statstcal approach to handwrtten lne segmentaton, February 27. [9] S. N. Srhar, B. Zhang, C. Toma, S. Lee, Z. Sh, and Y.-C. Shn, A system for handwrtng matchng and recognton. Proc. Symposum on Document Image Understandng Technology, 23, pp
A Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationWriter Identification using a Deep Neural Network
Wrter Identfcaton usng a Deep Neural Network Jun Chu and Sargur Srhar Department of Computer Scence and Engneerng Unversty at Buffalo, The State Unversty of New York Buffalo, NY 1469, USA {jchu6, srhar}@buffalo.edu
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationThree supervised learning methods on pen digits character recognition dataset
Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationSixth Indian Conference on Computer Vision, Graphics & Image Processing
Sxth Indan Conference on Computer Vson, Graphcs & Image Processng Incorporatng Cohort Informaton for Relable Palmprnt Authentcaton Ajay Kumar Bometrcs Research Laboratory, Department of Electrcal Engneerng
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationPictures at an Exhibition
1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationBAYESIAN MULTI-SOURCE DOMAIN ADAPTATION
BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,
More informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationAVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves
AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationCan We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search
Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton
More informationAdaptive Transfer Learning
Adaptve Transfer Learnng Bn Cao, Snno Jaln Pan, Yu Zhang, Dt-Yan Yeung, Qang Yang Hong Kong Unversty of Scence and Technology Clear Water Bay, Kowloon, Hong Kong {caobn,snnopan,zhangyu,dyyeung,qyang}@cse.ust.hk
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationFuzzy Logic Based RS Image Classification Using Maximum Likelihood and Mahalanobis Distance Classifiers
Research Artcle Internatonal Journal of Current Engneerng and Technology ISSN 77-46 3 INPRESSCO. All Rghts Reserved. Avalable at http://npressco.com/category/jcet Fuzzy Logc Based RS Image Usng Maxmum
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationDECISION HELP SYSTEM SUPPORTED DATA-MINING METHOD
DECISION HELP SYSTEM SUPPORTED DATA-MINING METHOD Péter Tamás, Norbert Szakály Budapest Unversty of Technology and Economcs Mechancal engneerng Faculty Department of Mechatroncs, Optcs and Engneerng Informatcs
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationCell Count Method on a Network with SANET
CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationA B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images
A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationHistogram of Template for Pedestrian Detection
PAPER IEICE TRANS. FUNDAMENTALS/COMMUN./ELECTRON./INF. & SYST., VOL. E85-A/B/C/D, No. xx JANUARY 20xx Hstogram of Template for Pedestran Detecton Shaopeng Tang, Non Member, Satosh Goto Fellow Summary In
More informationEXTENDED BIC CRITERION FOR MODEL SELECTION
IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7
More informationA high precision collaborative vision measurement of gear chamfering profile
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng
More information12. Segmentation. Computer Engineering, i Sejong University. Dongil Han
Computer Vson 1. Segmentaton Computer Engneerng, Sejong Unversty Dongl Han Image Segmentaton t Image segmentaton Subdvdes an mage nto ts consttuent regons or objects - After an mage has been segmented,
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationth International Conference on Document Analysis and Recognition
2013 12th Internatonal Conference on Document Analyss and Recognton Onlne Handwrtten Cursve Word Recognton Usng Segmentaton-free n Combnaton wth P2DBM-MQDF Blan Zhu 1, Art Shvram 2, Srrangaraj Setlur 2,
More informationAnalysis of Non-coherent Fault Trees Using Ternary Decision Diagrams
Analyss of Non-coherent Fault Trees Usng Ternary Decson Dagrams Rasa Remenyte-Prescott Dep. of Aeronautcal and Automotve Engneerng Loughborough Unversty, Loughborough, LE11 3TU, England R.Remenyte-Prescott@lboro.ac.uk
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationHybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton
More informationAutomatic 3D Building Reconstruction
Automatc 3D Buldng Reconstructon Ildko Suveg, George Vosselman Delft Unversty of Technology, The Netherlands Secton of Photogrammetry and Remote Sensng {I.Suveg, G.Vosselman}@geo.tudelft.nl ABSTRACT We
More informationAnalysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress
Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons
More informationComparison Study of Textural Descriptors for Training Neural Network Classifiers
Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84
More informationSignature and Lexicon Pruning Techniques
Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word
More informationIntrinsic Plagiarism Detection Using Character n-gram Profiles
Intrnsc Plagarsm Detecton Usng Character n-gram Profles Efstathos Stamatatos Unversty of the Aegean 83200 - Karlovass, Samos, Greece stamatatos@aegean.gr Abstract: The task of ntrnsc plagarsm detecton
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More information