COMPLEMENTARY SIMILARITY MEASURE
|
|
- Steven Clarke
- 6 years ago
- Views:
Transcription
1 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER Text-Lie Extractio ad Character Recogitio of Documet Headlies With Graphical Desigs Usig Complemetary Similarity Measure Miako Sawaki ad Norihiro Hagita, Member, IEEE Computer Society Abstract A method for recogizig characters o graphical desigs is proposed. A ew projectio feature that separates text-lie regios from backgrouds, ad adaptive thresholdig i displacemet matchig are itroduced. Experimetal results for ewspaper headlies with graphical desigs show a recogitio rate of 97.7 percet. Idex Terms Character recogitio, OCR, character segmetatio, projectio feature, displacemet matchig, adaptive thresholdig. F INTRODUCTION THE optical character reader (OCR) plays a importat role as a coveiet device for trasformig paper documets ito a computer-readable format. Oe problem ecoutered by the OCR is that headlies or emphasized strigs are ofte prited o top of graphical desigs. For example, graphical desigs are ofte used i Japaese ewspapers to draw the reader s attetio to certai articles. However, recogitio of such decorated characters suffers from several problems: ) Characters ofte have a variety of graphical desigs such as black-plai or white-plai, outlie, ad textured characters (Figs. a-g). 2) Backgrouds also have a variety of graphical desigs such as white-plai, black-plai, or graphical desigs over all or part of the headlie (Figs. a-g). Graphical desigs sometimes chage horizotally or vertically (Figs. e ad f). 3) Text-lies ca be prited horizotally or vertically (Figs. a-g). A headlie sometimes cosists of several text-lies (Figs. d ad e). To solve these problems, several methods for removig the graphical desigs before recogitio have bee studied. Sakou et al. [] focused o differeces i the texture properties betwee the character ad backgroud regios. Okamoto et al. [2] ad Liag et al. [3] proposed methods to remove backgroud texture iteratively usig morphological techiques. Ozawa et al. [4] attempted to separate character ad backgroud regios usig gray-scale images. However, these methods ofte extract icomplete regios of character parts, that is, character strokes are elimiated or backgroud desigs are left i segmeted character images. This occurs because the stroke cofiguratios of complicated Kaji characters ca be quite similar to textured backgrouds. This paper proposes a method for recogizig characters without removig the graphical desigs. Japaese ewspaper headlies are ²²²²²²²²²²²²²²²² M. Sawaki is with NTT Basic Research Laboratories, 3- Moriosato- Wakamiya, Atsugi, Kaagawa, , Japa. miako@apollo3.brl.tt.co.jp N. Hagita is with NTT Commuicatio Sciece Laboratories, 2-4 Hikaridai, Seika-cho, Soraku-gu, Kyoto, , Japa. hagita@cslab.kecl.tt.co.jp. Mauscript received 7 Feb. 997; revised 20 July 998. Recommeded for acceptace by J. Hull. For iformatio o obtaiig reprits of this article, please sed to: tpami@computer.org, ad referece IEEECS Log Number selected as a example of this task, as headlies usually iclude keywords for queries, ad their recogitio is especially sigificat. The proposed method allows text-lie regios to be separated from backgrouds ad is idepedet of the laguage of the documet. We have already proposed a robust recogitio method for characters with graphical desigs ad degraded characters [5]. It utilizes a biary image as a feature vector ad the complemetary similarity measure as a discrimiat fuctio. To apply this method to the recogitio of headlies, the umber of text-lie regios ad character heights or widths must be extracted before recogitio. A text-lie regio is, i this paper, a rectagular regio that cotais all characters i a text-lie ad its height or width is the average height, or average width, of all characters i the textlie, as show i Fig. 5a. First, a ew projectio value is itroduced for separatig the text-lie regios from backgrouds i the headlie images. The umber of text-lie regios ad the averaged character heights are extracted from a local distributio of the projectio values. Next, characters i the extracted text-lie regios are recogized by displacemet matchig. Whe covetioal methods recogize idividual characters with o graphical desigs, they select cut positios of idividual characters i the text-lie regio. Features more effective tha projectio profiles of black or white pixels have bee proposed for selectig the cut positios, such as the secod differetial of the margial desity [6], the upper- ad lower-cotour shapes of the characters [7], ad the break cost [8]. However, these methods caot readily hadle headlie images with graphical desigs. Therefore, we perform recogitio without selectig cut positios. Displacemet matchig is applied for this purpose. Kovalevsky formulated a recogitio algorithm based o displacemet matchig for text-lies [9]. Casey ad Nagy [0] also applied this algorithm to the segmetatio ad classificatio of composite character patters. I displacemet matchig, a character cadidate widow is matched agaist referece patters i a dictioary usig a similarity measure while beig shifted pixel-bypixel alog the horizotal axis. I Kovalevsky's algorithm, a directed graph is obtaied from the distributio of the similarity measure ad widow locatio. Recogitio ivolves fidig the maximal path of the directed graph. Our character recogitio method is based o Kovalevsky's algorithm, ad high recogitio reliability is achieved usig the complemetary similarity measure which is sesitive to positio traslatio ad adaptive thresholdig agaist the degree of degradatio, istead of fidig the maximal path. We itroduce the complemetary similarity measure i Sectio 2, ad a ew projectio measure for extractig the umber of textlie regios ad the averaged character heights i Sectio 3. Sectio 4 describes our method of recogizig idividual characters i the text-lie regio by displacemet matchig ad learig a adaptive threshold value. Sectio 5 presets experimetal results. Sectio 6 presets coclusios. 2 COMPLEMENTARY SIMILARITY MEASURE We take a brief look at the complemetary similarity measure [5]. A iput character is biarized ad the ormalized i size. The ormalized character patter ( = N N pixels) is expressed as a -dimesioal biary feature vector. Now, let 2 7 (where f i = 0 F = f, f2, K, fi, K, f or ) be the feature vector of a iput character ad T = 2t, t2, K, ti, K, t7 (where t i = 0 or ) be the feature vector of a biary referece patter. The complemetary similarity measure S c of F to T is defied as /98/$ IEEE
2 04 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER 998 (a) (b) (c) (d) (e) (f) (g) Fig.. Examples of headlie images. (a) Black-plai characters o white-plai backgroud. (b) White-plai characters o textured backgroud. (c) Outlie characters o textured backgroud. (d) Textured characters o textured backgroud. (e) Black-plai characters o textured backgroud. (f) White-plai characters o textured backgroud. (g) White-plai characters o textured backgroud. where a e b c S F,T6 c T - = -T 6 a = fi ti, b = fi ti The value of S c 2 7, c = fi ti e = fi ti 2 7, () , (2) T = T, a + b + c + e =. (3) varies i the rage 6 c 6. T T S T T Whe a iput character F comes from T with deletio oise, c becomes zero, ad whe F is derived from T with additive oise, b becomes zero. I both cases, provided that the term b c = 0, the similarity values of these degraded patters are still high. This complemetary relatioship makes this measure robust agaist oise. The complemetary similarity measure S c has the followig characteristic agaist the reverse cotrast patter F c of F. c Sc4 F, T 9 = S F,T c 6. (4) Equatio (4) shows that by usig the absolute value of the complemetary similarity measure as a discrimiat fuctio, iput characters may be recogized regardless of character color. I this paper, we use the measure S c (absolute value of S c, 0 Sc T T6 ) as a discrimiat fuctio i character recogitio, sice ewspaper headlies ca have differet character colors. The dimesio of the feature vector is = =,024 pixels, which is large eough to express eve complicated Kaji characters. Fig. 2 shows recogitio rates for the complemetary similarity measure uder the assumptio that character heights or widths are correctly detected [5]. ETL2 (57 categories) was used, which is oe of the stadard machie-prited Kaji character databases offered by the Electrotechical Laboratory. It is oted that the referece patters were black-plai characters o white-plai backgrouds. The measure achieves over 98 percet recogitio accuracy with prited Kaji characters with graphical desigs. 3 TEXT-LINE REGION EXTRACTION BASED ON COMPLEMENTARY SIMILARITY MEASURE This sectio itroduces a ew projectio value for extractig textlie regios []. The value stems from the complemetary relatioships betwee characters ad backgrouds i terms of black ad white rus. We assume that headlie images are extracted from the ewspaper, ad that skews are corrected before text-lie regio extractio. This assumptio is reasoable give covetioal methods of skew correctio ad text ad headlie image extractio [2]. Japaese ewspaper headlies fall ito five types i terms of character parts ad backgrouds. Table shows the occurrece rates of these types for two of the mai ewspapers i Japa. Type V is seldom used, because it is ot legible. With o graphical desigs (Type I), the projectio profile of black or white pixels eables us to detect the text-lie regios [2]. However, the projectio profile techique is ot applicable for headlies with graphical desigs (Types II-IV). Therefore, we developed a alterative measure which estimates the umber of text-lies ad the averaged character heights of text-lie regios that suits Types II-IV as well as Type I. This measure focuses o the complemetary relatioship betwee characters ad backgrouds. That is, backgrouds usually are white-plai or black-plai for textured characters, while they usually cotai texture or the reverse cotrast color for black-plai ad white-plai characters. These relatioships are mixed for outlie characters. Sice textured
3 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER Fig. 2. Recogitio rates for characters with graphical desigs [5] (Test samples i gothic style characters i ewspapers i ETL2). TABLE TYPES OF HEADLINE IMAGES IN JAPANESE NEWSPAPERS (ASAHI NEWSPAPER AND NIKKEI NEWSPAPER) backgrouds ca chage gradually alog the horizotal or vertical axis, as show i Figs. e ad f, the umber of text-lies ad their character heights are locally estimated usig the projectio profile i a local rectagle widow, which is shifted pixel-by-pixel alog the directio of the text-lie. I this paper, we will explai the algorithm for a headlie with horizotal text-lies. For a headlie with vertical text-lies, the scaig directio is vertical. Let G (N x N y pixels) be the iput headlie image ad G w (g w (u, y); W N y pixels; u =, 2,..., W; y =, 2,..., N y ) be a rectagular widow that ca iclude at least oe character. The projectio value p(y) ehacig the differece betwee the character parts ad backgrouds for Types I-IV is defied by: where 27 py = W - ap ep bp cp r r r r r r T t x x ap = Â g u, w y gw u +, y, W bp = Â - gw u, y gw u+, y W , cp = g u, w y gw u +, y , (5) W ep = gw u, y 3 gw u +, y8, (6) rt = ap + bp, rx = ap + cp, (7) ap + bp + cp + ep = r. (8) This projectio profile makes use of the complemetary relatioship of these four parameters (a p, e p, b p, c p ). They correspod to the four possible chages of black ad white pixels (black-to-black,, white-to-white, white-to-black, ad black-to-white) that ca occur alog the sca directio of the text-lie. Usig these four parameters, p(y) is ivariat for character color. p(y) lies i the rage py 27. ap ep correspods to the product of the total of the black ru-legth ad the total of the white ru-legth, ad bp cp correspods to the square of lie complexity i each scaig lie. I geeral, ap ep takes higher values i character parts ad lower oes i black-plai or whiteplai backgrouds. Also, bp cp takes higher values for the textured backgrouds ad lower oes for plai characters. As a result, p(y) takes higher values i character parts tha i backgrouds for Types I-IV. Sice p(y) is the same expressio as four-fold poit correlatio, a special case of the complemetary similarity measure, p(y) comes from the complemetary similarity measure. The projectio profile is averaged to avoid otches. The projectio axis is divided ito N sectios ad projectio values p(y) are averaged i each sectio. A group of high projectio values i the vertical projectio profile is the selected as a cadidate of a textlie regio. Its rage h correspods to the character height at locatio G w. Whe the headlie cosists of two text-lies, the vertical projectio profile geerates two groups with high values. More specifically, whe the averaged projectio value exceeds 30 percet of the maximum of the projectio profile, the sectio is determied to be a text-lie regio. This threshold was defied empirically. I practice, the text-lie regios ad character heights fluctuate somewhat over all G w due to the differet character heights at each locatio ad the graphical desigs. To avoid these otches, the text-lie regio ad its character height are averaged over all G w. Fig. 3 shows a example of the averaged projectio profile of p(y) for G w ad the projectio profile of black pixels without smoothig at x =. The two groups of high values i the averaged projectio profile of p(y) i Fig. 3b show the existece of two textlie regios ad their character heights, although the projectio values of black pixels i Fig. 3c do ot idicate the text-lie regios
4 06 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER 998 (a) (b) (c) Fig. 3. Observatio widow for regio extractio ad projectio profile of p(y). well. Fig. 4 shows the local distributios of p(y) for four types of headlie images at x =. This figure shows that with the proposed measure, the umber of text-lies ad the character heights are estimated for headlie images of Types I-IV. 4 CHARACTER RECOGNITION BASED ON COMPLEMENTARY SIMILARITY MEASURE 4. Displacemet Matchig Sice it is difficult to select cut positios of idividual characters eve with the proposed measure p(y), displacemet matchig is applied to the extracted text-lie regio for character recogitio. Whe estimatig text-lie positios, text-lie cadidates are obtaied for each observatio widow ad the cadidate positios are averaged. However, for segmetig idividual characters, this averagig effect is ot available because a text-lie has oly oe character i the vertical directio ad the segmetatio fails easily. Though displacemet matchig may require much processig time, this method seldom overlooks existig characters i a text-lie. Oe of the problems of displacemet matchig is that extra cadidates may be ecoutered; that is, false categories may be selected (a) (c) Fig. 4. Local distributios of p(y) for various graphical desigs. h: character height for each text-lie regio. (a) Type I. (b) Type II. (c) Type III. (d) Type IV. (b) (d) at locatios where o correct character category is located [9]. I the proposed method, the complemetary similarity measure ad adaptive thresholdig suppress these spurious cadidates. The complemetary similarity measure is sesitive to positio traslatio ad takes high values whe the iput character is matched agaist the referece patter of its character category while takig low values for the other categories. These properties hold eve for characters with graphical desigs or oise. Therefore, wheever the square widow is located at a correct character positio, the similarity betwee the widow ad a referece patter of the correct category is maximal; local peaks are observed i the distributio of maximum similarity value oly at correct character positios. The extracted text-lie regio with height h is ormalized to yield ormalized text-lie regio L with height N. A N N-pixel square widow is selected for matchig ormalized text-lie regio L, sice the biary referece patters cosist of N N pixels. The square widow is shifted pixel-by-pixel alog the directio of the text-lie ad the widow s cotets, iput feature vector F, are compared to the referece patters usig the complemetary similarity measure. The biary referece patters are made of character patters without graphical desigs i advace. As the biary patter matchig method is used, the similarity decreases sigificatly whe the iput is shifted i the vertical directio. This shift may be due to fluctuatio i text-lie extractio. The amout of pixel shift that ca be tolerated maily depeds o character stroke width because the similarity value is strogly related to the umber of pixels to which the iput patter ad referece patter overlap. For example, the stroke width of the referece patters we use is withi six pixels. Therefore, it is expected that vertical shifts of a few pixels (less tha six) ca be tolerated whe these referece patters are used. Fig. 5 shows a example of the distributio of maximum complemetary similarity value ad the maximum covetioal similarity value at each positio alog the horizotal axis for the ormalized text-lie regio. Fig. 5b ad Fig. 5d show that the complemetary similarity measure has domiat peaks aroud the left-most side of F of the exactly correct category, while the covetioal similarity measure SFT, 6 = a F T, F = F has few peaks. 4.2 Adaptive Thresholdig Whe the maximum S c at each positio exceeds the threshold, the recogized category ad its positio are determied. To recogize
5 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER (a) (b) (c) (d) Fig. 5 Character recogitio by displacemet matchig. (a) Normalized text-lie regio L. (b) Maximum S c (solid bars) ad estimated thresholds Th 2T i,z7(dot plots). (c) Recogized categories. (d) Maximum S. characters with high precisio, the most appropriate threshold should be determied usig the degree of degradatio i F ad the referece patter of the category with the maximum S c value. Whe F is located at the correct character positio durig displacemet matchig, S c of F to the referece patter of the correct category decreases accordig to the degree of degradatio while S c of F to the referece patters of the other categories decrease more rapidly. Therefore, by assumig that the square widow F at each positio cotais the referece patter havig the maximal similarity value, the degree of degradatio for F ad the adaptive threshold agaist the degree ca be estimated. The thresholds for differet degradatio degrees are determied i advace by a learig process for each referece patter. Let T i be a referece patter of the ith category without oise, ad Z i ad Z be a oisy image of T i ad the umber of black pixels i Z i, respectively. Also, let Th T, Z 2 i 7 be a threshold value for T i whe the umber of black pixels of a iput patter is Z. A oisy image Z i is sythesized from T i ad a radom dot image [5]. Similarity values Sc4Zi, Tj92j π i7 are calculated for differet Z. Fig. 6 shows a example of the threshold-to-degradatio table, that is the relatioship betwee the maximum S c Z i, T j Z. For compariso, Fig. 6 also shows S c j j 4 9 for j = ad 4Z, T9 for j =. I order 4Z, T9 4T j, Z9 for the referece patter 4Tj 9 4Tj - 9 as the threshold. to elimiate false recogitio cadidates, the maximum S c i j is determied as the threshold Th T j. For S c, we select max Th, Z, Th, Z Other referece patters showed the same tedecy as. 5 EXPERIMENTAL RESULTS 5. Headlie Data As test data, we used 50 headlies, Types II-IV, i Japaese ewspapers (25 horizotal ad 25 vertical text-lies) which cotaied 529 characters. They were gathered by usig three biarizatio thresholds, level (low), level 2 (fie), ad level 3 (high). The umber of text-lies i oe headlie was either oe or two. The character fot i the headlies was Gothic. Referece patters without graphical desigs were extracted maually from 2 headlie images at level 2. Fifty headlies out of 2 were the same as the test data; the remaiig 7 were also gathered to icrease category umber. As the aspect ratio of characters differs with text-lie directio, the referece patters were stored i either a horizotal text-lie dictioary or a vertical text-lie dictioary accordig to the directio of the text-lie of the headlie. The umber of referece patters was 93 (500 categories) for the horizotal text-lie dictioary ad 988 (525 categories) for the vertical text-lie dictioary. The umbers of referece patters per category i the horizotal dictioary ad the vertical textlie dictioary were i the rage of oe to 32 ad oe to 23, respectively. The horizotal text-lie dictioary occupied 39 KB while the vertical text-lie dictioary took 50 KB. Fig. 6. Relatioship betwee complemetary similarity ad umber of black pixels (Example for referece patter ).
6 08 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER 998 TABLE 2 RESULTS OF TEST-LINE EXTRACTION TABLE 3 RECOGNITION RESULTS TABLE 4 RECOGNITION RESULTS FOR IMAGES IN FIG. (LEVEL 2) 5.2 Text-Lie Extractio Experimetal results for text-lie extractio are listed i Table 2. Table 2 shows the umbers of images whose all-text-lies were correctly extracted. We determied that text-lies i which all characters were misrecogized as NOT correctly extracted. For images at level 2, all text-lies were correctly extracted, while a few errors occurred for images at levels ad 3. Oe of the reasos for error was that for the images with striped graphical desigs whose directio matched the projectio directio, the projected value is similar to that for the character regios ad for the backgroud regios. The average processig time was 0.2 secods per oe headlie image o a Su Sparcstatio 0. For compariso, a covetioal method was applied to the test data with level 2 scaig. Graphical desigs were removed usig the method i [2] ad text-lies i the resultig images were extracted with commercial OCR software. The method i [2] extracts character strokes based o morphological approach. The commercial OCR extracts text-lies usig projectio features of black pixels. This table shows that the proposed projectio value achieves much higher text-lie extractio rates tha the covetioal method. The error of the covetioal method comes from the cofusio of text regios with backgrouds ad the cofusio of text ad graphic regios. 5.3 Character Recogitio Character recogitio was coducted for the test headlie images icludig images with text-lie extractio errors. I recogitio, the horizotal (vertical) text-lie dictioary was used whe the width of the iput headlie image was larger (smaller) tha its height. Whe recogized characters overlapped each other, the category, which had the highest similarity, was kept ad the others were removed from the recogitio results. The recogitio results for 50 test headlie images are show i Table 3. Table 3 shows that the recogitio rate for level 2 is 97.7 percet ad the recogitio rates for levels ad 3 are 8.3 percet ad 82.4 percet, respectively. The umber of extra cadidates are 40 (level ), 8 (level 2), ad 43 (level 3), respectively. Recogitio results for the images i Fig. are listed i Table 4. The average processig time was 39.2 secods per headlie image o the Su Sparcstatio-0. For compariso, a covetioal method was applied to the test data with level 2 scaig. Graphical desigs were removed usig the method i [2] ad the resultig images were recogized with commercial OCR software. This OCR software did ot lear the referece patters we obtaied from headlie images. The recogitio rate was 7.0 percet. This shows that the proposed method achieves much higher recogitio rates tha the covetioal method, sice it is oted that our test data did ot iclude headlie images i Type I but i Types II-IV. Recogitio errors i our method fall ito two mai sources: usuccessful extractio of text-lie regios ad adaptive thresholdig. Errors i adaptive thresholdig occurred whe the maximum similarity of the correct category was less tha the estimated threshold. The complemetary similarity measure achieves over 98 percet recogitio accuracy agaist both learig ad test samples whe the character height is kow [5]. The accuracy of headlie image recogitio will be improved by elimiatig these two sources of recogitio error. 6 CONCLUSIONS We proposed a method for text-lie extractio ad character recogitio of Japaese ewspaper headlies with graphical desigs. A ew projectio measure extracts text-lie regios by focusig o the complemetary relatioship betwee characters ad backgrouds. Characters i the text-lies are recogized by the complemetary similarity measure ad displacemet matchig. Spurious cadidates i displacemet matchig are suppressed by adaptive thresholdig. Experimetal results for 50 ewspaper headlies showed that this method achieves a high recogitio rate of 97.7 percet, which is higher tha the 7.0 percet of a covetioal method. Improvig text-lie extractio ad thresholdig are future tasks.
7 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER ACKNOWLEDGMENTS We would like to ackowledge the ecouragemet ad support of Dr. Ke ichiro Ishii ad stimulatig discussios with Dr. Kazumi Odaka. REFERENCES [] H. Sakou, H. Matsushima, ad M. Ejiri, Texture Discrimiatio Usig Self-Orgaized Multiresolutio Filterig, IEICE Tras. D- II, vol. J73-D-II, o. 4, pp , 990 (i Japaese). [2] M. Okamoto ad H. Hayashi, Character Extractio From Headlies With Backgroud Patters by Usig Shrikig/Expadig Methods, IEICE, Techical Report PRU90-5, pp , 99 (i Japaese). [3] S. Liag ad M. Ahmadi, A Morphological Approach to Text Strig Extractio from Regular Periodic Overlappig Text/Backgroud Images, Computer Visio, Graphics, ad Image Processig, vol. 56, o. 5, pp , Sept [4] H. Ozawa ad T. Nakagawa, "A Character Image Ehacemet Method From Characters With Various Backgroud Images, Proc. Secod It l Cof. Documet Aalysis ad Recogitio, pp. 58-6, Tsukuba, Japa, Oct [5] M. Sawaki ad N. Hagita, Recogitio of Degraded Machie- Prited Characters Usig a Complemetary Similarity Measure ad Error-Correctio Learig", IEICE Tras. Iformatio ad Systems, vol. E79-D, o. 5, pp , 996. [6] S. Kaha ad T. Pavlidis, O the Recogitio of Prited Characters of Ay Fot ad Size", IEEE Tras. Patter Aalysis ad Machie Itelligece, vol. 9, o. 3, pp , 987. [7] R. Ferich, Segmetatio of Automatically Located Hadwritte Words, Proc. Secod It l Workshop o Frotiers i Hadwritig Recogitio, pp , Chateau de Boas, Frace, 99. [8] S. Tsujimoto ad H. Asada, Major Compoets of a Complete Text Readig System, Proc. IEEE, vol. 80, o. 7, pp.,33-,49, 992. [9] V.A. Kovalevsky, Image Patter Recogitio. Berli: Spriger, 980. [0] R.G. Casey ad G. Nagy, Recursive Segmetatio ad Classificatio of Composite Character Patters, Proc. Sixth It l Cof. Patter Recogitio, pp.,023-,026, 982. [] M. Sawaki ad N. Hagita, Text-Lie Extractio ad Character Recogitio of Japaese Newspaper Headlies With Graphical Desigs, Proc. 3th It l Cof. Patter Recogitio, Track C, pp , 996. [2] T. Akiyama ad N. Hagita, Automated Etry System for Prited Documets, Patter Recogitio, vol. 23, o., pp.,4-,54, 990.
Neuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More 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 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 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 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 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 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 informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
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 informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
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 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 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 informationText Line Segmentation Based on Morphology and Histogram Projection
2009 10th Iteratioal Coferece o Documet Aalsis ad Recogitio Tet Lie Segmetatio Based o Morpholog ad Histogram Projectio Rodolfo P. dos Satos, Gabriela S. Clemete, Tsag Ig Re ad George D.C. Calvalcati Ceter
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 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 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 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 informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More 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 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 informationFast algorithm for skew detection. Adnan Amin, Stephen Fischer, Tony Parkinson, and Ricky Shiu
Fast algorithm for skew detectio Ada Ami, Stephe Fischer, Toy Parkiso, ad Ricky Shiu School of Computer Sciece ad Egieerig Uiversity of New South Wales, Sydey NSW, 2052 Australia ABSTRACT Documet image
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
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 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 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 informationSearching a Russian Document Collection Using English, Chinese and Japanese Queries
Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.
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 informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
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 informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationGraphic Standards for District Identification. September, 2012
Graphic Stadards for District Idetificatio September, 2012 CASE Graphic Stadards for District Idetificatio DRAFT 12.8.14 Coucil for Advacemet ad Support of Educatio, 2012. 1 . This documet is a draft of
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 informationl-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word
A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
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 informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More 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 informationThe VSS CCD photometry spreadsheet
The VSS CCD photometry spreadsheet Itroductio This Excel spreadsheet has bee developed ad tested by the BAA VSS for aalysig results files produced by the multi-image CCD photometry procedure i AIP4Wi v2.
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationOn the Accuracy of Vector Metrics for Quality Assessment in Image Filtering
0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy
More 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 informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
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 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 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 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 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 informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More 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 informationLecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV
Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch
More informationNormal Distributions
Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,
More informationAn Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram
http://dx.doi.org/10.5755/j01.eee.0.4.6888 ELEKTROIKA IR ELEKTROTECHIKA ISS 139 115 VOL. 0 O. 4 014 A Image Retrieval Method Based o Hu Ivariat Momet ad Improved Aular Histogram F. Xiag 1 H. Yog 1 S. Dada
More 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 informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
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 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 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 informationTerm Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.
CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig
More informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationDocument Image Segmentation for Analyzing of Data in Raster Image
Iteratioal Joural of Egieerig Research ad Developmet e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 2 (August 2012), PP. 47-53 Documet Image Segmetatio for Aalyzig of Data i Raster
More informationON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES
ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES Thomas Läbe, Timo Dickscheid ad Wolfgag Förster Istitute of Geodesy ad Geoiformatio, Departmet of Photogrammetry, Uiversity of Bo laebe@ipb.ui-bo.de,
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 informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More 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 informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationApplication of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images
66 Applicatio of Decisio Tree ad Support Vector Machie for Ispectig Bubble Defects o LED Sealig Glue Images * Chua-Yu Chag ad Yi-Feg Li Abstract Bubble defect ispectio is a importat step i light-emittig
More 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 informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationCS 111: Program Design I Lecture 15: Objects, Pandas, Modules. Robert H. Sloan & Richard Warner University of Illinois at Chicago October 13, 2016
CS 111: Program Desig I Lecture 15: Objects, Padas, Modules Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago October 13, 2016 OBJECTS AND DOT NOTATION Objects (Implicit i Chapter 2, Variables,
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 informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
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 information27 Refraction, Dispersion, Internal Reflection
Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet
More informationEvaluation of Support Vector Machine Kernels for Detecting Network Anomalies
Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/
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 informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationTitle: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity.
7 IEEE. Persoal use of this material is permitted. Permissio from IEEE must be obtaied for all other uses, i ay curret or future media, icludig repritig/republishig this material for advertisig or promotioal
More informationIdentification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.
Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's
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 informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More 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 informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More information. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.
MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics
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 informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More 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 informationBAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8
BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject
More informationFinal Report Pedestrian Control Issues at Busy Intersections and Monitoring Large Crowds
Fial Report 22-29 Pedestria Cotrol Issues at Busy Itersectios ad Moitorig Large Crowds PEDESTRIAN CONTROL ISSUES AT BUSY INTERSECTIONS AND MONITORING LARGE CROWDS Prepared by: Bejami Mauri, Osama Masoud,
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More information